/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-16 16:30:46,001 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 16:30:46,069 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 16:30:46,072 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 16:30:46,073 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 16:30:46,094 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 16:30:46,094 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 16:30:46,094 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 16:30:46,095 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 16:30:46,098 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 16:30:46,098 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 16:30:46,098 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 16:30:46,098 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 16:30:46,099 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 16:30:46,099 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 16:30:46,100 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 16:30:46,100 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 16:30:46,100 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 16:30:46,100 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 16:30:46,100 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 16:30:46,100 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 16:30:46,101 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 16:30:46,101 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 16:30:46,101 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 16:30:46,101 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 16:30:46,101 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 16:30:46,101 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 16:30:46,101 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 16:30:46,102 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 16:30:46,102 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 16:30:46,102 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 16:30:46,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 16:30:46,103 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 16:30:46,103 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 16:30:46,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:30:46,103 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 16:30:46,103 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 16:30:46,103 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 16:30:46,103 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 16:30:46,103 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 16:30:46,103 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 16:30:46,104 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 16:30:46,104 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 16:30:46,104 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 16:30:46,104 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 16:30:46,105 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 16:30:46,105 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-16 16:30:46,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 16:30:46,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 16:30:46,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 16:30:46,299 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 16:30:46,300 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 16:30:46,301 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-16 16:30:47,234 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 16:30:47,368 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 16:30:47,368 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bh2017-ex3.i [2023-12-16 16:30:47,373 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff464b4cd/0c593bdee4284f3598f4d9f7ef96cea4/FLAG91173caa5 [2023-12-16 16:30:47,382 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff464b4cd/0c593bdee4284f3598f4d9f7ef96cea4 [2023-12-16 16:30:47,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 16:30:47,385 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 16:30:47,386 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 16:30:47,386 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 16:30:47,389 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 16:30:47,389 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:30:47" (1/1) ... [2023-12-16 16:30:47,390 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e7e01c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:47, skipping insertion in model container [2023-12-16 16:30:47,390 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:30:47" (1/1) ... [2023-12-16 16:30:47,404 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 16:30:47,512 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-16 16:30:47,522 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:30:47,531 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 16:30:47,541 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-16 16:30:47,543 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:30:47,552 INFO L206 MainTranslator]: Completed translation [2023-12-16 16:30:47,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:47 WrapperNode [2023-12-16 16:30:47,553 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 16:30:47,554 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 16:30:47,554 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 16:30:47,554 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 16:30:47,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:47" (1/1) ... [2023-12-16 16:30:47,563 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:47" (1/1) ... [2023-12-16 16:30:47,575 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2023-12-16 16:30:47,575 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 16:30:47,576 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 16:30:47,576 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 16:30:47,576 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 16:30:47,583 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:47" (1/1) ... [2023-12-16 16:30:47,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:47" (1/1) ... [2023-12-16 16:30:47,584 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:47" (1/1) ... [2023-12-16 16:30:47,591 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 16:30:47,591 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:47" (1/1) ... [2023-12-16 16:30:47,592 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:47" (1/1) ... [2023-12-16 16:30:47,594 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:47" (1/1) ... [2023-12-16 16:30:47,596 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:47" (1/1) ... [2023-12-16 16:30:47,597 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:47" (1/1) ... [2023-12-16 16:30:47,597 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:47" (1/1) ... [2023-12-16 16:30:47,599 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 16:30:47,599 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 16:30:47,599 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 16:30:47,599 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 16:30:47,600 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:47" (1/1) ... [2023-12-16 16:30:47,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:30:47,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 16:30:47,621 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 16:30:47,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 16:30:47,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 16:30:47,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 16:30:47,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 16:30:47,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 16:30:47,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-16 16:30:47,671 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-16 16:30:47,712 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 16:30:47,714 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 16:30:47,804 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 16:30:47,826 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 16:30:47,826 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 16:30:47,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:30:47 BoogieIcfgContainer [2023-12-16 16:30:47,827 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 16:30:47,828 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 16:30:47,828 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 16:30:47,830 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 16:30:47,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:30:47" (1/3) ... [2023-12-16 16:30:47,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2447b538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:30:47, skipping insertion in model container [2023-12-16 16:30:47,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:47" (2/3) ... [2023-12-16 16:30:47,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2447b538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:30:47, skipping insertion in model container [2023-12-16 16:30:47,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:30:47" (3/3) ... [2023-12-16 16:30:47,832 INFO L112 eAbstractionObserver]: Analyzing ICFG bh2017-ex3.i [2023-12-16 16:30:47,845 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 16:30:47,845 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 16:30:47,885 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 16:30:47,889 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;@75b71961, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 16:30:47,890 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 16:30:47,892 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-16 16:30:47,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-16 16:30:47,897 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:30:47,897 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-16 16:30:47,897 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:30:47,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:30:47,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1248097640, now seen corresponding path program 1 times [2023-12-16 16:30:47,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:30:47,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1207581187] [2023-12-16 16:30:47,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:30:47,909 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:30:47,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:30:47,911 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:30:47,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 16:30:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:30:47,950 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 16:30:47,953 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:30:48,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:30:48,008 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:30:48,009 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:30:48,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1207581187] [2023-12-16 16:30:48,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1207581187] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:30:48,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:30:48,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 16:30:48,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412594419] [2023-12-16 16:30:48,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:30:48,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 16:30:48,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:30:48,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 16:30:48,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 16:30:48,032 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-16 16:30:48,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:30:48,094 INFO L93 Difference]: Finished difference Result 56 states and 94 transitions. [2023-12-16 16:30:48,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 16:30:48,096 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-16 16:30:48,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:30:48,101 INFO L225 Difference]: With dead ends: 56 [2023-12-16 16:30:48,101 INFO L226 Difference]: Without dead ends: 35 [2023-12-16 16:30:48,103 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-16 16:30:48,105 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-16 16:30:48,106 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-16 16:30:48,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-16 16:30:48,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-12-16 16:30:48,163 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-16 16:30:48,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2023-12-16 16:30:48,167 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 6 [2023-12-16 16:30:48,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:30:48,168 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2023-12-16 16:30:48,168 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-16 16:30:48,168 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2023-12-16 16:30:48,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-16 16:30:48,169 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:30:48,169 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:30:48,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-16 16:30:48,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:30:48,371 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:30:48,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:30:48,372 INFO L85 PathProgramCache]: Analyzing trace with hash 675454336, now seen corresponding path program 1 times [2023-12-16 16:30:48,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:30:48,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [346176280] [2023-12-16 16:30:48,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:30:48,373 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:30:48,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:30:48,374 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:30:48,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 16:30:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:30:48,423 INFO L262 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 16:30:48,424 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:30:48,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:30:48,448 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:30:48,448 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:30:48,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [346176280] [2023-12-16 16:30:48,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [346176280] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:30:48,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:30:48,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 16:30:48,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48337260] [2023-12-16 16:30:48,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:30:48,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 16:30:48,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:30:48,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 16:30:48,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 16:30:48,450 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-16 16:30:48,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:30:48,486 INFO L93 Difference]: Finished difference Result 93 states and 135 transitions. [2023-12-16 16:30:48,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 16:30:48,487 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-16 16:30:48,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:30:48,488 INFO L225 Difference]: With dead ends: 93 [2023-12-16 16:30:48,488 INFO L226 Difference]: Without dead ends: 59 [2023-12-16 16:30:48,488 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-16 16:30:48,489 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-16 16:30:48,489 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-16 16:30:48,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-16 16:30:48,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-12-16 16:30:48,497 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-16 16:30:48,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 84 transitions. [2023-12-16 16:30:48,498 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 84 transitions. Word has length 11 [2023-12-16 16:30:48,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:30:48,498 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 84 transitions. [2023-12-16 16:30:48,499 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-16 16:30:48,499 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 84 transitions. [2023-12-16 16:30:48,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-16 16:30:48,499 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:30:48,499 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:30:48,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 16:30:48,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:30:48,702 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:30:48,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:30:48,703 INFO L85 PathProgramCache]: Analyzing trace with hash 606007415, now seen corresponding path program 1 times [2023-12-16 16:30:48,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:30:48,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1566407324] [2023-12-16 16:30:48,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:30:48,704 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:30:48,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:30:48,704 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:30:48,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 16:30:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:30:48,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 16:30:48,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:30:48,779 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-16 16:30:48,779 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:30:48,860 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-16 16:30:48,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:30:48,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1566407324] [2023-12-16 16:30:48,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1566407324] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:30:48,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:30:48,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-16 16:30:48,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070143629] [2023-12-16 16:30:48,865 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:30:48,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 16:30:48,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:30:48,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 16:30:48,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-16 16:30:48,866 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-16 16:30:49,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:30:49,010 INFO L93 Difference]: Finished difference Result 161 states and 239 transitions. [2023-12-16 16:30:49,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 16:30:49,010 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-16 16:30:49,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:30:49,015 INFO L225 Difference]: With dead ends: 161 [2023-12-16 16:30:49,015 INFO L226 Difference]: Without dead ends: 103 [2023-12-16 16:30:49,016 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-16 16:30:49,018 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-16 16:30:49,018 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-16 16:30:49,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-12-16 16:30:49,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-12-16 16:30:49,036 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-16 16:30:49,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 151 transitions. [2023-12-16 16:30:49,037 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 151 transitions. Word has length 21 [2023-12-16 16:30:49,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:30:49,038 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 151 transitions. [2023-12-16 16:30:49,038 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-16 16:30:49,038 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 151 transitions. [2023-12-16 16:30:49,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-16 16:30:49,038 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:30:49,039 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:30:49,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-16 16:30:49,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:30:49,242 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:30:49,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:30:49,242 INFO L85 PathProgramCache]: Analyzing trace with hash -617286383, now seen corresponding path program 1 times [2023-12-16 16:30:49,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:30:49,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2078739905] [2023-12-16 16:30:49,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:30:49,243 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:30:49,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:30:49,247 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:30:49,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 16:30:49,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:30:49,266 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 16:30:49,267 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:30:49,301 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-16 16:30:49,301 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:30:49,375 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-16 16:30:49,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:30:49,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2078739905] [2023-12-16 16:30:49,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2078739905] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:30:49,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:30:49,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-16 16:30:49,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539765214] [2023-12-16 16:30:49,378 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:30:49,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 16:30:49,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:30:49,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 16:30:49,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-16 16:30:49,379 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-16 16:30:49,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:30:49,486 INFO L93 Difference]: Finished difference Result 285 states and 433 transitions. [2023-12-16 16:30:49,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 16:30:49,487 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-16 16:30:49,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:30:49,491 INFO L225 Difference]: With dead ends: 285 [2023-12-16 16:30:49,491 INFO L226 Difference]: Without dead ends: 183 [2023-12-16 16:30:49,496 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-16 16:30:49,498 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 85 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-16 16:30:49,499 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-16 16:30:49,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-12-16 16:30:49,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2023-12-16 16:30:49,523 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-16 16:30:49,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 274 transitions. [2023-12-16 16:30:49,528 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 274 transitions. Word has length 26 [2023-12-16 16:30:49,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:30:49,528 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 274 transitions. [2023-12-16 16:30:49,528 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-16 16:30:49,528 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 274 transitions. [2023-12-16 16:30:49,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-16 16:30:49,533 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:30:49,533 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1] [2023-12-16 16:30:49,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 16:30:49,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:30:49,735 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:30:49,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:30:49,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1044461023, now seen corresponding path program 1 times [2023-12-16 16:30:49,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:30:49,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1811842620] [2023-12-16 16:30:49,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:30:49,736 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:30:49,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:30:49,737 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:30:49,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-16 16:30:49,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:30:49,765 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 16:30:49,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:30:49,836 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-16 16:30:49,836 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:30:49,936 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-16 16:30:49,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:30:49,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1811842620] [2023-12-16 16:30:49,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1811842620] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:30:49,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:30:49,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-16 16:30:49,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908719361] [2023-12-16 16:30:49,937 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:30:49,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 16:30:49,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:30:49,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 16:30:49,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-16 16:30:49,939 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-16 16:30:50,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:30:50,103 INFO L93 Difference]: Finished difference Result 555 states and 867 transitions. [2023-12-16 16:30:50,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 16:30:50,104 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-16 16:30:50,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:30:50,106 INFO L225 Difference]: With dead ends: 555 [2023-12-16 16:30:50,106 INFO L226 Difference]: Without dead ends: 373 [2023-12-16 16:30:50,107 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-16 16:30:50,107 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-16 16:30:50,108 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-16 16:30:50,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2023-12-16 16:30:50,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2023-12-16 16:30:50,132 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-16 16:30:50,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 574 transitions. [2023-12-16 16:30:50,134 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 574 transitions. Word has length 65 [2023-12-16 16:30:50,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:30:50,134 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 574 transitions. [2023-12-16 16:30:50,134 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-16 16:30:50,134 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 574 transitions. [2023-12-16 16:30:50,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-16 16:30:50,135 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:30:50,136 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1] [2023-12-16 16:30:50,140 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 (6)] Ended with exit code 0 [2023-12-16 16:30:50,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:30:50,338 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:30:50,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:30:50,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1907350173, now seen corresponding path program 1 times [2023-12-16 16:30:50,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:30:50,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1374625228] [2023-12-16 16:30:50,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:30:50,339 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:30:50,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:30:50,340 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:30:50,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-16 16:30:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:30:50,382 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 16:30:50,384 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:30:50,434 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-16 16:30:50,434 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:30:50,528 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-16 16:30:50,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:30:50,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1374625228] [2023-12-16 16:30:50,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1374625228] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:30:50,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:30:50,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-16 16:30:50,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767418870] [2023-12-16 16:30:50,529 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:30:50,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 16:30:50,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:30:50,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 16:30:50,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-16 16:30:50,530 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-16 16:30:50,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:30:50,678 INFO L93 Difference]: Finished difference Result 1160 states and 1842 transitions. [2023-12-16 16:30:50,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 16:30:50,678 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-16 16:30:50,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:30:50,685 INFO L225 Difference]: With dead ends: 1160 [2023-12-16 16:30:50,685 INFO L226 Difference]: Without dead ends: 788 [2023-12-16 16:30:50,686 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-16 16:30:50,687 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-16 16:30:50,687 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-16 16:30:50,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2023-12-16 16:30:50,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2023-12-16 16:30:50,730 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-16 16:30:50,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1224 transitions. [2023-12-16 16:30:50,733 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1224 transitions. Word has length 65 [2023-12-16 16:30:50,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:30:50,733 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 1224 transitions. [2023-12-16 16:30:50,733 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-16 16:30:50,733 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1224 transitions. [2023-12-16 16:30:50,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-16 16:30:50,736 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:30:50,736 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 9, 9, 9, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1] [2023-12-16 16:30:50,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 16:30:50,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:30:50,939 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:30:50,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:30:50,939 INFO L85 PathProgramCache]: Analyzing trace with hash 549477600, now seen corresponding path program 2 times [2023-12-16 16:30:50,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:30:50,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2135843237] [2023-12-16 16:30:50,939 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:30:50,940 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:30:50,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:30:50,940 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:30:50,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-16 16:30:50,984 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 16:30:50,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:30:50,986 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 16:30:50,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:30:51,096 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-16 16:30:51,096 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:30:51,418 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-16 16:30:51,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:30:51,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2135843237] [2023-12-16 16:30:51,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2135843237] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:30:51,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:30:51,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-12-16 16:30:51,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110061225] [2023-12-16 16:30:51,418 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:30:51,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-16 16:30:51,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:30:51,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-16 16:30:51,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2023-12-16 16:30:51,420 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-16 16:30:52,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:30:52,060 INFO L93 Difference]: Finished difference Result 2405 states and 3837 transitions. [2023-12-16 16:30:52,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-16 16:30:52,061 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-16 16:30:52,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:30:52,067 INFO L225 Difference]: With dead ends: 2405 [2023-12-16 16:30:52,067 INFO L226 Difference]: Without dead ends: 1618 [2023-12-16 16:30:52,069 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-16 16:30:52,070 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-16 16:30:52,070 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-16 16:30:52,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2023-12-16 16:30:52,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1618. [2023-12-16 16:30:52,155 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-16 16:30:52,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 2524 transitions. [2023-12-16 16:30:52,161 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 2524 transitions. Word has length 140 [2023-12-16 16:30:52,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:30:52,161 INFO L495 AbstractCegarLoop]: Abstraction has 1618 states and 2524 transitions. [2023-12-16 16:30:52,161 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-16 16:30:52,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 2524 transitions. [2023-12-16 16:30:52,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-16 16:30:52,164 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:30:52,164 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 9, 9, 9, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1] [2023-12-16 16:30:52,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-16 16:30:52,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:30:52,367 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:30:52,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:30:52,368 INFO L85 PathProgramCache]: Analyzing trace with hash -755268690, now seen corresponding path program 2 times [2023-12-16 16:30:52,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:30:52,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1769336116] [2023-12-16 16:30:52,369 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:30:52,369 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:30:52,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:30:52,370 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:30:52,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-16 16:30:52,418 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 16:30:52,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:30:52,419 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 16:30:52,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:30:52,531 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-16 16:30:52,536 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:30:52,831 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-16 16:30:52,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:30:52,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1769336116] [2023-12-16 16:30:52,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1769336116] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:30:52,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:30:52,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-12-16 16:30:52,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589002453] [2023-12-16 16:30:52,832 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:30:52,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-16 16:30:52,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:30:52,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-16 16:30:52,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2023-12-16 16:30:52,833 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-16 16:30:53,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:30:53,524 INFO L93 Difference]: Finished difference Result 4965 states and 7937 transitions. [2023-12-16 16:30:53,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-16 16:30:53,525 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-16 16:30:53,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:30:53,538 INFO L225 Difference]: With dead ends: 4965 [2023-12-16 16:30:53,538 INFO L226 Difference]: Without dead ends: 3348 [2023-12-16 16:30:53,542 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-16 16:30:53,543 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-16 16:30:53,543 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-16 16:30:53,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3348 states. [2023-12-16 16:30:53,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3348 to 3348. [2023-12-16 16:30:53,675 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-16 16:30:53,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3348 states to 3348 states and 5224 transitions. [2023-12-16 16:30:53,685 INFO L78 Accepts]: Start accepts. Automaton has 3348 states and 5224 transitions. Word has length 140 [2023-12-16 16:30:53,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:30:53,686 INFO L495 AbstractCegarLoop]: Abstraction has 3348 states and 5224 transitions. [2023-12-16 16:30:53,686 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-16 16:30:53,686 INFO L276 IsEmpty]: Start isEmpty. Operand 3348 states and 5224 transitions. [2023-12-16 16:30:53,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2023-12-16 16:30:53,694 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:30:53,694 INFO L195 NwaCegarLoop]: trace histogram [39, 38, 38, 19, 19, 19, 19, 19, 19, 19, 19, 18, 1, 1, 1, 1, 1] [2023-12-16 16:30:53,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-16 16:30:53,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:30:53,897 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:30:53,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:30:53,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1210479488, now seen corresponding path program 3 times [2023-12-16 16:30:53,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:30:53,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548262271] [2023-12-16 16:30:53,898 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 16:30:53,898 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:30:53,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:30:53,899 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:30:53,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-16 16:30:53,952 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-16 16:30:53,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:30:53,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 16:30:53,961 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:30:54,044 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-16 16:30:54,044 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:30:54,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:30:54,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [548262271] [2023-12-16 16:30:54,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [548262271] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:30:54,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:30:54,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 16:30:54,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186070353] [2023-12-16 16:30:54,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:30:54,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 16:30:54,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:30:54,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 16:30:54,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:30:54,046 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-16 16:30:54,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:30:54,241 INFO L93 Difference]: Finished difference Result 3354 states and 5229 transitions. [2023-12-16 16:30:54,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 16:30:54,241 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-16 16:30:54,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:30:54,253 INFO L225 Difference]: With dead ends: 3354 [2023-12-16 16:30:54,253 INFO L226 Difference]: Without dead ends: 3352 [2023-12-16 16:30:54,254 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-16 16:30:54,256 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-16 16:30:54,256 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-16 16:30:54,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3352 states. [2023-12-16 16:30:54,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3352 to 3352. [2023-12-16 16:30:54,420 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-16 16:30:54,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3352 states to 3352 states and 5227 transitions. [2023-12-16 16:30:54,430 INFO L78 Accepts]: Start accepts. Automaton has 3352 states and 5227 transitions. Word has length 290 [2023-12-16 16:30:54,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:30:54,430 INFO L495 AbstractCegarLoop]: Abstraction has 3352 states and 5227 transitions. [2023-12-16 16:30:54,430 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-16 16:30:54,430 INFO L276 IsEmpty]: Start isEmpty. Operand 3352 states and 5227 transitions. [2023-12-16 16:30:54,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2023-12-16 16:30:54,436 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:30:54,436 INFO L195 NwaCegarLoop]: trace histogram [39, 38, 38, 19, 19, 19, 19, 19, 19, 19, 19, 18, 1, 1, 1, 1, 1] [2023-12-16 16:30:54,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-16 16:30:54,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:30:54,638 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:30:54,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:30:54,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1473922126, now seen corresponding path program 3 times [2023-12-16 16:30:54,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:30:54,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1266808900] [2023-12-16 16:30:54,639 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 16:30:54,639 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:30:54,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:30:54,640 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:30:54,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-16 16:30:54,678 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-16 16:30:54,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:30:54,679 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 16:30:54,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:30:54,767 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-16 16:30:54,768 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:30:54,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:30:54,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1266808900] [2023-12-16 16:30:54,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1266808900] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:30:54,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:30:54,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 16:30:54,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284487944] [2023-12-16 16:30:54,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:30:54,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 16:30:54,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:30:54,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 16:30:54,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:30:54,770 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-16 16:30:55,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:30:55,001 INFO L93 Difference]: Finished difference Result 3352 states and 5227 transitions. [2023-12-16 16:30:55,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 16:30:55,004 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-16 16:30:55,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:30:55,004 INFO L225 Difference]: With dead ends: 3352 [2023-12-16 16:30:55,004 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 16:30:55,010 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-16 16:30:55,010 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-16 16:30:55,013 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-16 16:30:55,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 16:30:55,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 16:30:55,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:30:55,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 16:30:55,016 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 290 [2023-12-16 16:30:55,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:30:55,016 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 16:30:55,016 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-16 16:30:55,016 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 16:30:55,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 16:30:55,018 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 16:30:55,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-16 16:30:55,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:30:55,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 16:31:11,472 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-16 16:31:11,472 INFO L899 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2023-12-16 16:31:11,472 INFO L899 garLoopResultBuilder]: For program point L23(lines 23 29) no Hoare annotation was computed. [2023-12-16 16:31:11,472 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-16 16:31:11,472 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-16 16:31:11,472 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-16 16:31:11,472 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 41) no Hoare annotation was computed. [2023-12-16 16:31:11,472 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 16:31:11,472 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-16 16:31:11,473 INFO L899 garLoopResultBuilder]: For program point L21(lines 21 42) no Hoare annotation was computed. [2023-12-16 16:31:11,473 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 16:31:11,473 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-16 16:31:11,474 INFO L899 garLoopResultBuilder]: For program point L38-1(line 38) no Hoare annotation was computed. [2023-12-16 16:31:11,474 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 40) no Hoare annotation was computed. [2023-12-16 16:31:11,474 INFO L899 garLoopResultBuilder]: For program point L22(lines 22 30) no Hoare annotation was computed. [2023-12-16 16:31:11,474 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 18 43) no Hoare annotation was computed. [2023-12-16 16:31:11,474 INFO L899 garLoopResultBuilder]: For program point L13(line 13) no Hoare annotation was computed. [2023-12-16 16:31:11,475 INFO L899 garLoopResultBuilder]: For program point L13-1(line 13) no Hoare annotation was computed. [2023-12-16 16:31:11,476 INFO L899 garLoopResultBuilder]: For program point L13-3(line 13) no Hoare annotation was computed. [2023-12-16 16:31:11,476 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(line 13) no Hoare annotation was computed. [2023-12-16 16:31:11,476 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 13) the Hoare annotation is: true [2023-12-16 16:31:11,477 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2023-12-16 16:31:11,483 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1] [2023-12-16 16:31:11,486 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 16:31:11,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:31:11 BoogieIcfgContainer [2023-12-16 16:31:11,496 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 16:31:11,497 INFO L158 Benchmark]: Toolchain (without parser) took 24111.92ms. Allocated memory was 253.8MB in the beginning and 549.5MB in the end (delta: 295.7MB). Free memory was 203.8MB in the beginning and 386.6MB in the end (delta: -182.8MB). Peak memory consumption was 324.3MB. Max. memory is 8.0GB. [2023-12-16 16:31:11,497 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 210.8MB. Free memory is still 162.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 16:31:11,497 INFO L158 Benchmark]: CACSL2BoogieTranslator took 167.48ms. Allocated memory is still 253.8MB. Free memory was 203.5MB in the beginning and 192.3MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-16 16:31:11,498 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.81ms. Allocated memory is still 253.8MB. Free memory was 192.3MB in the beginning and 190.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 16:31:11,498 INFO L158 Benchmark]: Boogie Preprocessor took 22.67ms. Allocated memory is still 253.8MB. Free memory was 190.9MB in the beginning and 189.2MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 16:31:11,498 INFO L158 Benchmark]: RCFGBuilder took 227.63ms. Allocated memory is still 253.8MB. Free memory was 189.2MB in the beginning and 177.6MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 16:31:11,499 INFO L158 Benchmark]: TraceAbstraction took 23668.16ms. Allocated memory was 253.8MB in the beginning and 549.5MB in the end (delta: 295.7MB). Free memory was 176.6MB in the beginning and 386.6MB in the end (delta: -210.0MB). Peak memory consumption was 297.0MB. Max. memory is 8.0GB. [2023-12-16 16:31:11,501 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.14ms. Allocated memory is still 210.8MB. Free memory is still 162.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 167.48ms. Allocated memory is still 253.8MB. Free memory was 203.5MB in the beginning and 192.3MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.81ms. Allocated memory is still 253.8MB. Free memory was 192.3MB in the beginning and 190.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.67ms. Allocated memory is still 253.8MB. Free memory was 190.9MB in the beginning and 189.2MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 227.63ms. Allocated memory is still 253.8MB. Free memory was 189.2MB in the beginning and 177.6MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 23668.16ms. Allocated memory was 253.8MB in the beginning and 549.5MB in the end (delta: 295.7MB). Free memory was 176.6MB in the beginning and 386.6MB in the end (delta: -210.0MB). Peak memory consumption was 297.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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.6s, OverallIterations: 10, TraceHistogramMax: 39, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 16.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1916 SdHoareTripleChecker+Valid, 0.8s 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, 5.9s HoareSimplificationTime, 6 FormulaSimplificationsInter, 21705 FormulaSimplificationTreeSizeReductionInter, 10.3s 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-16 16:31:11,535 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...