/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/eca-rers2012/Problem01_label08.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 08:21:44,034 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 08:21:44,103 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 08:21:44,107 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 08:21:44,107 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 08:21:44,126 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 08:21:44,127 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 08:21:44,127 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 08:21:44,128 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 08:21:44,131 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 08:21:44,131 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 08:21:44,131 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 08:21:44,132 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 08:21:44,133 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 08:21:44,133 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 08:21:44,133 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 08:21:44,133 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 08:21:44,134 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 08:21:44,134 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 08:21:44,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 08:21:44,134 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 08:21:44,134 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 08:21:44,135 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 08:21:44,135 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 08:21:44,135 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 08:21:44,135 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 08:21:44,135 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 08:21:44,135 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 08:21:44,135 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 08:21:44,135 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 08:21:44,136 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 08:21:44,136 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 08:21:44,136 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 08:21:44,137 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 08:21:44,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 08:21:44,137 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 08:21:44,137 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 08:21:44,137 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 08:21:44,137 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 08:21:44,137 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 08:21:44,137 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 08:21:44,138 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 08:21:44,138 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 08:21:44,138 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 08:21:44,138 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 08:21:44,138 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 08:21:44,138 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 08:21:44,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 08:21:44,340 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 08:21:44,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 08:21:44,343 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 08:21:44,344 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 08:21:44,345 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label08.c [2023-12-16 08:21:45,388 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 08:21:45,611 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 08:21:45,612 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label08.c [2023-12-16 08:21:45,630 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c5b652f5/738d299c83d3464d92b89e39333576c4/FLAG276042a6e [2023-12-16 08:21:45,641 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c5b652f5/738d299c83d3464d92b89e39333576c4 [2023-12-16 08:21:45,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 08:21:45,643 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 08:21:45,644 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 08:21:45,644 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 08:21:45,647 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 08:21:45,648 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 08:21:45" (1/1) ... [2023-12-16 08:21:45,648 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@237ae3b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:21:45, skipping insertion in model container [2023-12-16 08:21:45,649 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 08:21:45" (1/1) ... [2023-12-16 08:21:45,706 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 08:21:45,905 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label08.c[19599,19612] [2023-12-16 08:21:45,922 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 08:21:45,931 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 08:21:45,983 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label08.c[19599,19612] [2023-12-16 08:21:46,002 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 08:21:46,013 INFO L206 MainTranslator]: Completed translation [2023-12-16 08:21:46,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:21:46 WrapperNode [2023-12-16 08:21:46,013 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 08:21:46,014 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 08:21:46,014 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 08:21:46,014 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 08:21:46,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:21:46" (1/1) ... [2023-12-16 08:21:46,042 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:21:46" (1/1) ... [2023-12-16 08:21:46,087 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 656 [2023-12-16 08:21:46,087 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 08:21:46,088 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 08:21:46,088 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 08:21:46,088 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 08:21:46,096 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:21:46" (1/1) ... [2023-12-16 08:21:46,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:21:46" (1/1) ... [2023-12-16 08:21:46,100 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:21:46" (1/1) ... [2023-12-16 08:21:46,125 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 08:21:46,126 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:21:46" (1/1) ... [2023-12-16 08:21:46,126 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:21:46" (1/1) ... [2023-12-16 08:21:46,140 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:21:46" (1/1) ... [2023-12-16 08:21:46,165 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:21:46" (1/1) ... [2023-12-16 08:21:46,168 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:21:46" (1/1) ... [2023-12-16 08:21:46,171 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:21:46" (1/1) ... [2023-12-16 08:21:46,199 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 08:21:46,200 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 08:21:46,200 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 08:21:46,200 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 08:21:46,201 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:21:46" (1/1) ... [2023-12-16 08:21:46,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 08:21:46,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 08:21:46,261 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 08:21:46,297 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 08:21:46,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 08:21:46,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 08:21:46,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 08:21:46,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 08:21:46,401 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 08:21:46,403 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 08:21:47,227 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 08:21:47,259 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 08:21:47,259 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 08:21:47,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 08:21:47 BoogieIcfgContainer [2023-12-16 08:21:47,259 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 08:21:47,261 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 08:21:47,261 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 08:21:47,263 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 08:21:47,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 08:21:45" (1/3) ... [2023-12-16 08:21:47,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@117a0700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 08:21:47, skipping insertion in model container [2023-12-16 08:21:47,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:21:46" (2/3) ... [2023-12-16 08:21:47,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@117a0700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 08:21:47, skipping insertion in model container [2023-12-16 08:21:47,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 08:21:47" (3/3) ... [2023-12-16 08:21:47,278 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label08.c [2023-12-16 08:21:47,289 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 08:21:47,289 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 08:21:47,354 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 08:21:47,358 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;@19734793, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 08:21:47,358 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 08:21:47,362 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 134 states have (on average 1.9776119402985075) internal successors, (265), 135 states have internal predecessors, (265), 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 08:21:47,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-16 08:21:47,369 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:21:47,370 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 08:21:47,370 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:21:47,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:21:47,374 INFO L85 PathProgramCache]: Analyzing trace with hash 481303523, now seen corresponding path program 1 times [2023-12-16 08:21:47,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:21:47,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [458688311] [2023-12-16 08:21:47,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:21:47,386 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 08:21:47,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:21:47,391 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 08:21:47,416 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 08:21:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:21:47,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 08:21:47,476 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:21:47,496 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 08:21:47,496 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:21:47,497 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:21:47,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [458688311] [2023-12-16 08:21:47,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [458688311] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:21:47,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:21:47,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 08:21:47,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095028466] [2023-12-16 08:21:47,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:21:47,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 08:21:47,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:21:47,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 08:21:47,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 08:21:47,521 INFO L87 Difference]: Start difference. First operand has 136 states, 134 states have (on average 1.9776119402985075) internal successors, (265), 135 states have internal predecessors, (265), 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) Second operand has 2 states, 2 states have (on average 56.0) internal successors, (112), 2 states have internal predecessors, (112), 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 08:21:47,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:21:47,551 INFO L93 Difference]: Finished difference Result 271 states and 529 transitions. [2023-12-16 08:21:47,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 08:21:47,554 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 56.0) internal successors, (112), 2 states have internal predecessors, (112), 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) Word has length 112 [2023-12-16 08:21:47,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:21:47,560 INFO L225 Difference]: With dead ends: 271 [2023-12-16 08:21:47,560 INFO L226 Difference]: Without dead ends: 134 [2023-12-16 08:21:47,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 08:21:47,564 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 08:21:47,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 08:21:47,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-12-16 08:21:47,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2023-12-16 08:21:47,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.5037593984962405) internal successors, (200), 133 states have internal predecessors, (200), 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 08:21:47,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 200 transitions. [2023-12-16 08:21:47,609 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 200 transitions. Word has length 112 [2023-12-16 08:21:47,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:21:47,610 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 200 transitions. [2023-12-16 08:21:47,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 56.0) internal successors, (112), 2 states have internal predecessors, (112), 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 08:21:47,611 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 200 transitions. [2023-12-16 08:21:47,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-16 08:21:47,614 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:21:47,615 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 08:21:47,620 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 08:21:47,817 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 08:21:47,818 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:21:47,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:21:47,819 INFO L85 PathProgramCache]: Analyzing trace with hash 608565302, now seen corresponding path program 1 times [2023-12-16 08:21:47,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:21:47,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [889865341] [2023-12-16 08:21:47,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:21:47,820 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 08:21:47,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:21:47,822 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 08:21:47,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 08:21:47,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:21:47,902 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-16 08:21:47,911 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:21:52,377 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 08:21:52,377 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:21:52,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:21:52,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [889865341] [2023-12-16 08:21:52,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [889865341] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:21:52,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:21:52,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 08:21:52,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283621540] [2023-12-16 08:21:52,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:21:52,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 08:21:52,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:21:52,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 08:21:52,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-12-16 08:21:52,383 INFO L87 Difference]: Start difference. First operand 134 states and 200 transitions. Second operand has 10 states, 10 states have (on average 11.2) internal successors, (112), 9 states have internal predecessors, (112), 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 08:21:53,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:21:53,817 INFO L93 Difference]: Finished difference Result 587 states and 909 transitions. [2023-12-16 08:21:53,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 08:21:53,818 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 9 states have internal predecessors, (112), 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) Word has length 112 [2023-12-16 08:21:53,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:21:53,820 INFO L225 Difference]: With dead ends: 587 [2023-12-16 08:21:53,820 INFO L226 Difference]: Without dead ends: 323 [2023-12-16 08:21:53,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2023-12-16 08:21:53,822 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 215 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1557 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-16 08:21:53,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 102 Invalid, 1667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1557 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-16 08:21:53,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2023-12-16 08:21:53,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2023-12-16 08:21:53,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 322 states have (on average 1.2981366459627328) internal successors, (418), 322 states have internal predecessors, (418), 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 08:21:53,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 418 transitions. [2023-12-16 08:21:53,837 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 418 transitions. Word has length 112 [2023-12-16 08:21:53,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:21:53,837 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 418 transitions. [2023-12-16 08:21:53,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 9 states have internal predecessors, (112), 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 08:21:53,837 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 418 transitions. [2023-12-16 08:21:53,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-16 08:21:53,839 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:21:53,839 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 08:21:53,843 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 08:21:54,041 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 08:21:54,041 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:21:54,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:21:54,042 INFO L85 PathProgramCache]: Analyzing trace with hash -2126288642, now seen corresponding path program 1 times [2023-12-16 08:21:54,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:21:54,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1826185512] [2023-12-16 08:21:54,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:21:54,043 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 08:21:54,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:21:54,045 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 08:21:54,061 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 08:21:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:21:54,102 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-16 08:21:54,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:21:56,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 08:21:56,204 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:21:56,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:21:56,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1826185512] [2023-12-16 08:21:56,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1826185512] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:21:56,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:21:56,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 08:21:56,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447102768] [2023-12-16 08:21:56,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:21:56,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 08:21:56,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:21:56,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 08:21:56,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2023-12-16 08:21:56,217 INFO L87 Difference]: Start difference. First operand 323 states and 418 transitions. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 9 states have internal predecessors, (116), 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 08:21:57,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:21:57,451 INFO L93 Difference]: Finished difference Result 785 states and 1099 transitions. [2023-12-16 08:21:57,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 08:21:57,452 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 9 states have internal predecessors, (116), 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) Word has length 116 [2023-12-16 08:21:57,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:21:57,453 INFO L225 Difference]: With dead ends: 785 [2023-12-16 08:21:57,454 INFO L226 Difference]: Without dead ends: 521 [2023-12-16 08:21:57,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2023-12-16 08:21:57,455 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 156 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1471 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-16 08:21:57,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 151 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1471 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-16 08:21:57,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2023-12-16 08:21:57,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 519. [2023-12-16 08:21:57,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 518 states have (on average 1.2876447876447876) internal successors, (667), 518 states have internal predecessors, (667), 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 08:21:57,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 667 transitions. [2023-12-16 08:21:57,467 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 667 transitions. Word has length 116 [2023-12-16 08:21:57,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:21:57,467 INFO L495 AbstractCegarLoop]: Abstraction has 519 states and 667 transitions. [2023-12-16 08:21:57,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 9 states have internal predecessors, (116), 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 08:21:57,468 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 667 transitions. [2023-12-16 08:21:57,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-16 08:21:57,470 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:21:57,470 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 08:21:57,474 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 08:21:57,674 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 08:21:57,674 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:21:57,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:21:57,675 INFO L85 PathProgramCache]: Analyzing trace with hash 396957635, now seen corresponding path program 1 times [2023-12-16 08:21:57,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:21:57,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [81312342] [2023-12-16 08:21:57,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:21:57,676 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 08:21:57,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:21:57,709 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 08:21:57,710 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 08:21:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:21:57,760 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 08:21:57,762 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:21:59,038 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 08:21:59,039 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:21:59,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:21:59,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [81312342] [2023-12-16 08:21:59,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [81312342] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:21:59,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:21:59,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 08:21:59,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964861688] [2023-12-16 08:21:59,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:21:59,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 08:21:59,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:21:59,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 08:21:59,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:21:59,043 INFO L87 Difference]: Start difference. First operand 519 states and 667 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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 08:21:59,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:21:59,567 INFO L93 Difference]: Finished difference Result 1074 states and 1431 transitions. [2023-12-16 08:21:59,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 08:21:59,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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) Word has length 119 [2023-12-16 08:21:59,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:21:59,569 INFO L225 Difference]: With dead ends: 1074 [2023-12-16 08:21:59,569 INFO L226 Difference]: Without dead ends: 519 [2023-12-16 08:21:59,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:21:59,570 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 08:21:59,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 08:21:59,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2023-12-16 08:21:59,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 519. [2023-12-16 08:21:59,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 518 states have (on average 1.2007722007722008) internal successors, (622), 518 states have internal predecessors, (622), 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 08:21:59,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 622 transitions. [2023-12-16 08:21:59,583 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 622 transitions. Word has length 119 [2023-12-16 08:21:59,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:21:59,583 INFO L495 AbstractCegarLoop]: Abstraction has 519 states and 622 transitions. [2023-12-16 08:21:59,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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 08:21:59,583 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 622 transitions. [2023-12-16 08:21:59,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-12-16 08:21:59,584 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:21:59,584 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 08:21:59,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-16 08:21:59,789 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 08:21:59,790 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:21:59,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:21:59,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1044875845, now seen corresponding path program 1 times [2023-12-16 08:21:59,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:21:59,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [7397159] [2023-12-16 08:21:59,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:21:59,791 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 08:21:59,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:21:59,792 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 08:21:59,828 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 08:21:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:21:59,875 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 08:21:59,877 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:21:59,987 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-16 08:21:59,987 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:21:59,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:21:59,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [7397159] [2023-12-16 08:21:59,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [7397159] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:21:59,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:21:59,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 08:21:59,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197017342] [2023-12-16 08:21:59,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:21:59,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 08:21:59,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:21:59,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 08:21:59,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:21:59,989 INFO L87 Difference]: Start difference. First operand 519 states and 622 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 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 08:22:00,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:22:00,426 INFO L93 Difference]: Finished difference Result 1241 states and 1520 transitions. [2023-12-16 08:22:00,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 08:22:00,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 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) Word has length 176 [2023-12-16 08:22:00,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:22:00,428 INFO L225 Difference]: With dead ends: 1241 [2023-12-16 08:22:00,428 INFO L226 Difference]: Without dead ends: 781 [2023-12-16 08:22:00,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:22:00,430 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 96 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 08:22:00,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 56 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 08:22:00,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2023-12-16 08:22:00,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 781. [2023-12-16 08:22:00,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 780 states have (on average 1.1538461538461537) internal successors, (900), 780 states have internal predecessors, (900), 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 08:22:00,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 900 transitions. [2023-12-16 08:22:00,442 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 900 transitions. Word has length 176 [2023-12-16 08:22:00,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:22:00,443 INFO L495 AbstractCegarLoop]: Abstraction has 781 states and 900 transitions. [2023-12-16 08:22:00,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 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 08:22:00,443 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 900 transitions. [2023-12-16 08:22:00,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2023-12-16 08:22:00,444 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:22:00,444 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 08:22:00,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-16 08:22:00,648 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 08:22:00,649 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:22:00,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:22:00,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1561954726, now seen corresponding path program 1 times [2023-12-16 08:22:00,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:22:00,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1604393371] [2023-12-16 08:22:00,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:22:00,650 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 08:22:00,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:22:00,651 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 08:22:00,653 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 08:22:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:22:00,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 08:22:00,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:22:00,891 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-16 08:22:00,892 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:22:00,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:22:00,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1604393371] [2023-12-16 08:22:00,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1604393371] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:22:00,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:22:00,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 08:22:00,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809485007] [2023-12-16 08:22:00,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:22:00,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 08:22:00,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:22:00,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 08:22:00,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 08:22:00,893 INFO L87 Difference]: Start difference. First operand 781 states and 900 transitions. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 3 states have internal predecessors, (172), 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 08:22:01,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:22:01,566 INFO L93 Difference]: Finished difference Result 2027 states and 2354 transitions. [2023-12-16 08:22:01,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 08:22:01,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 3 states have internal predecessors, (172), 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) Word has length 189 [2023-12-16 08:22:01,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:22:01,570 INFO L225 Difference]: With dead ends: 2027 [2023-12-16 08:22:01,570 INFO L226 Difference]: Without dead ends: 1305 [2023-12-16 08:22:01,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 08:22:01,572 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 230 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 08:22:01,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 33 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 08:22:01,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2023-12-16 08:22:01,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1305. [2023-12-16 08:22:01,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1305 states, 1304 states have (on average 1.1134969325153374) internal successors, (1452), 1304 states have internal predecessors, (1452), 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 08:22:01,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 1452 transitions. [2023-12-16 08:22:01,592 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 1452 transitions. Word has length 189 [2023-12-16 08:22:01,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:22:01,592 INFO L495 AbstractCegarLoop]: Abstraction has 1305 states and 1452 transitions. [2023-12-16 08:22:01,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 3 states have internal predecessors, (172), 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 08:22:01,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1452 transitions. [2023-12-16 08:22:01,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2023-12-16 08:22:01,595 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:22:01,595 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 08:22:01,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-16 08:22:01,797 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 08:22:01,798 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:22:01,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:22:01,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1283410491, now seen corresponding path program 1 times [2023-12-16 08:22:01,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:22:01,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212512971] [2023-12-16 08:22:01,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:22:01,800 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 08:22:01,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:22:01,806 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 08:22:01,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-16 08:22:01,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:22:01,897 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 08:22:01,899 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:22:01,930 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-12-16 08:22:01,930 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:22:01,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:22:01,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1212512971] [2023-12-16 08:22:01,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1212512971] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:22:01,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:22:01,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 08:22:01,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312042687] [2023-12-16 08:22:01,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:22:01,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 08:22:01,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:22:01,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 08:22:01,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:22:01,932 INFO L87 Difference]: Start difference. First operand 1305 states and 1452 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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 08:22:02,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:22:02,448 INFO L93 Difference]: Finished difference Result 3075 states and 3440 transitions. [2023-12-16 08:22:02,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 08:22:02,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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) Word has length 210 [2023-12-16 08:22:02,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:22:02,453 INFO L225 Difference]: With dead ends: 3075 [2023-12-16 08:22:02,453 INFO L226 Difference]: Without dead ends: 1829 [2023-12-16 08:22:02,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:22:02,455 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 123 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 08:22:02,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 182 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 08:22:02,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2023-12-16 08:22:02,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1829. [2023-12-16 08:22:02,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1829 states, 1828 states have (on average 1.0968271334792123) internal successors, (2005), 1828 states have internal predecessors, (2005), 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 08:22:02,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2005 transitions. [2023-12-16 08:22:02,478 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2005 transitions. Word has length 210 [2023-12-16 08:22:02,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:22:02,478 INFO L495 AbstractCegarLoop]: Abstraction has 1829 states and 2005 transitions. [2023-12-16 08:22:02,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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 08:22:02,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2005 transitions. [2023-12-16 08:22:02,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2023-12-16 08:22:02,481 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:22:02,481 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 08:22:02,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-16 08:22:02,684 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 08:22:02,685 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:22:02,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:22:02,685 INFO L85 PathProgramCache]: Analyzing trace with hash 638779400, now seen corresponding path program 1 times [2023-12-16 08:22:02,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:22:02,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1841315809] [2023-12-16 08:22:02,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:22:02,686 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 08:22:02,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:22:02,687 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 08:22:02,712 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 08:22:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:22:02,769 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 08:22:02,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:22:03,429 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 173 proven. 8 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-12-16 08:22:03,429 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 08:22:04,522 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 145 proven. 36 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-12-16 08:22:04,522 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:22:04,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1841315809] [2023-12-16 08:22:04,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1841315809] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 08:22:04,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 08:22:04,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-16 08:22:04,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048811102] [2023-12-16 08:22:04,525 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 08:22:04,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 08:22:04,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:22:04,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 08:22:04,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 08:22:04,528 INFO L87 Difference]: Start difference. First operand 1829 states and 2005 transitions. Second operand has 7 states, 7 states have (on average 37.714285714285715) internal successors, (264), 6 states have internal predecessors, (264), 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 08:22:05,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:22:05,993 INFO L93 Difference]: Finished difference Result 4659 states and 5068 transitions. [2023-12-16 08:22:05,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 08:22:05,994 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 37.714285714285715) internal successors, (264), 6 states have internal predecessors, (264), 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) Word has length 228 [2023-12-16 08:22:05,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:22:06,001 INFO L225 Difference]: With dead ends: 4659 [2023-12-16 08:22:06,001 INFO L226 Difference]: Without dead ends: 2889 [2023-12-16 08:22:06,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 449 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2023-12-16 08:22:06,003 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 955 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1603 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 955 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-16 08:22:06,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [955 Valid, 93 Invalid, 1674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1603 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-16 08:22:06,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2889 states. [2023-12-16 08:22:06,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2889 to 1829. [2023-12-16 08:22:06,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1829 states, 1828 states have (on average 1.0929978118161925) internal successors, (1998), 1828 states have internal predecessors, (1998), 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 08:22:06,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 1998 transitions. [2023-12-16 08:22:06,030 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 1998 transitions. Word has length 228 [2023-12-16 08:22:06,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:22:06,030 INFO L495 AbstractCegarLoop]: Abstraction has 1829 states and 1998 transitions. [2023-12-16 08:22:06,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.714285714285715) internal successors, (264), 6 states have internal predecessors, (264), 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 08:22:06,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 1998 transitions. [2023-12-16 08:22:06,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2023-12-16 08:22:06,033 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:22:06,033 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 08:22:06,046 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 08:22:06,236 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 08:22:06,236 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:22:06,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:22:06,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1601234415, now seen corresponding path program 1 times [2023-12-16 08:22:06,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:22:06,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1658256596] [2023-12-16 08:22:06,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:22:06,238 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 08:22:06,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:22:06,240 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 08:22:06,241 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 08:22:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:22:06,345 INFO L262 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 08:22:06,348 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:22:06,458 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-12-16 08:22:06,459 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:22:06,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:22:06,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1658256596] [2023-12-16 08:22:06,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1658256596] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:22:06,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:22:06,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 08:22:06,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092707619] [2023-12-16 08:22:06,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:22:06,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 08:22:06,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:22:06,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 08:22:06,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 08:22:06,461 INFO L87 Difference]: Start difference. First operand 1829 states and 1998 transitions. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 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 08:22:06,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:22:06,950 INFO L93 Difference]: Finished difference Result 4516 states and 4954 transitions. [2023-12-16 08:22:06,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 08:22:06,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 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) Word has length 250 [2023-12-16 08:22:06,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:22:06,957 INFO L225 Difference]: With dead ends: 4516 [2023-12-16 08:22:06,957 INFO L226 Difference]: Without dead ends: 2746 [2023-12-16 08:22:06,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 08:22:06,974 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 213 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 08:22:06,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 33 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 08:22:06,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2023-12-16 08:22:06,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 2353. [2023-12-16 08:22:07,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2353 states, 2352 states have (on average 1.0914115646258504) internal successors, (2567), 2352 states have internal predecessors, (2567), 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 08:22:07,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2353 states to 2353 states and 2567 transitions. [2023-12-16 08:22:07,004 INFO L78 Accepts]: Start accepts. Automaton has 2353 states and 2567 transitions. Word has length 250 [2023-12-16 08:22:07,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:22:07,005 INFO L495 AbstractCegarLoop]: Abstraction has 2353 states and 2567 transitions. [2023-12-16 08:22:07,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 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 08:22:07,005 INFO L276 IsEmpty]: Start isEmpty. Operand 2353 states and 2567 transitions. [2023-12-16 08:22:07,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2023-12-16 08:22:07,008 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:22:07,008 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 08:22:07,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 (10)] Forceful destruction successful, exit code 0 [2023-12-16 08:22:07,211 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 08:22:07,211 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:22:07,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:22:07,212 INFO L85 PathProgramCache]: Analyzing trace with hash -55456257, now seen corresponding path program 1 times [2023-12-16 08:22:07,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:22:07,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821255236] [2023-12-16 08:22:07,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:22:07,213 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 08:22:07,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:22:07,229 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 08:22:07,280 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 08:22:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:22:07,375 INFO L262 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 08:22:07,377 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:22:07,429 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2023-12-16 08:22:07,429 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:22:07,430 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:22:07,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821255236] [2023-12-16 08:22:07,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821255236] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:22:07,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:22:07,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 08:22:07,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186419847] [2023-12-16 08:22:07,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:22:07,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 08:22:07,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:22:07,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 08:22:07,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:22:07,431 INFO L87 Difference]: Start difference. First operand 2353 states and 2567 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 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 08:22:07,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:22:07,774 INFO L93 Difference]: Finished difference Result 4778 states and 5228 transitions. [2023-12-16 08:22:07,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 08:22:07,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 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) Word has length 259 [2023-12-16 08:22:07,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:22:07,779 INFO L225 Difference]: With dead ends: 4778 [2023-12-16 08:22:07,779 INFO L226 Difference]: Without dead ends: 2484 [2023-12-16 08:22:07,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:22:07,782 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 114 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 08:22:07,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 111 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 08:22:07,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2023-12-16 08:22:07,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 2484. [2023-12-16 08:22:07,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2484 states, 2483 states have (on average 1.085783326621023) internal successors, (2696), 2483 states have internal predecessors, (2696), 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 08:22:07,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2484 states to 2484 states and 2696 transitions. [2023-12-16 08:22:07,808 INFO L78 Accepts]: Start accepts. Automaton has 2484 states and 2696 transitions. Word has length 259 [2023-12-16 08:22:07,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:22:07,808 INFO L495 AbstractCegarLoop]: Abstraction has 2484 states and 2696 transitions. [2023-12-16 08:22:07,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 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 08:22:07,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2484 states and 2696 transitions. [2023-12-16 08:22:07,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2023-12-16 08:22:07,812 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:22:07,812 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 08:22:07,831 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 (11)] Ended with exit code 0 [2023-12-16 08:22:08,015 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 08:22:08,015 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:22:08,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:22:08,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1307653741, now seen corresponding path program 1 times [2023-12-16 08:22:08,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:22:08,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [622490870] [2023-12-16 08:22:08,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:22:08,017 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 08:22:08,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:22:08,018 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 08:22:08,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-16 08:22:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:22:08,115 INFO L262 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 08:22:08,117 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:22:08,200 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2023-12-16 08:22:08,200 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:22:08,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:22:08,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [622490870] [2023-12-16 08:22:08,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [622490870] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:22:08,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:22:08,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 08:22:08,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481963264] [2023-12-16 08:22:08,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:22:08,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 08:22:08,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:22:08,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 08:22:08,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 08:22:08,202 INFO L87 Difference]: Start difference. First operand 2484 states and 2696 transitions. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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 08:22:08,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:22:08,715 INFO L93 Difference]: Finished difference Result 5695 states and 6171 transitions. [2023-12-16 08:22:08,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 08:22:08,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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) Word has length 283 [2023-12-16 08:22:08,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:22:08,743 INFO L225 Difference]: With dead ends: 5695 [2023-12-16 08:22:08,743 INFO L226 Difference]: Without dead ends: 3270 [2023-12-16 08:22:08,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 08:22:08,746 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 311 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 08:22:08,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 112 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 08:22:08,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3270 states. [2023-12-16 08:22:08,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3270 to 3008. [2023-12-16 08:22:08,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 3007 states have (on average 1.0794812105088127) internal successors, (3246), 3007 states have internal predecessors, (3246), 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 08:22:08,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 3246 transitions. [2023-12-16 08:22:08,781 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 3246 transitions. Word has length 283 [2023-12-16 08:22:08,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:22:08,782 INFO L495 AbstractCegarLoop]: Abstraction has 3008 states and 3246 transitions. [2023-12-16 08:22:08,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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 08:22:08,782 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 3246 transitions. [2023-12-16 08:22:08,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2023-12-16 08:22:08,786 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:22:08,786 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 08:22:08,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-16 08:22:08,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:22:08,989 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:22:08,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:22:08,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1637464685, now seen corresponding path program 1 times [2023-12-16 08:22:08,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:22:08,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [516211270] [2023-12-16 08:22:08,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:22:08,991 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 08:22:08,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:22:08,992 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 08:22:09,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-16 08:22:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:22:09,086 INFO L262 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 08:22:09,090 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:22:09,998 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2023-12-16 08:22:09,999 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:22:09,999 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:22:09,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [516211270] [2023-12-16 08:22:09,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [516211270] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:22:09,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:22:10,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 08:22:10,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261563248] [2023-12-16 08:22:10,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:22:10,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 08:22:10,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:22:10,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 08:22:10,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-16 08:22:10,001 INFO L87 Difference]: Start difference. First operand 3008 states and 3246 transitions. Second operand has 6 states, 6 states have (on average 32.833333333333336) internal successors, (197), 5 states have internal predecessors, (197), 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 08:22:11,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:22:11,030 INFO L93 Difference]: Finished difference Result 5505 states and 5934 transitions. [2023-12-16 08:22:11,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 08:22:11,031 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 32.833333333333336) internal successors, (197), 5 states have internal predecessors, (197), 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) Word has length 284 [2023-12-16 08:22:11,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:22:11,035 INFO L225 Difference]: With dead ends: 5505 [2023-12-16 08:22:11,035 INFO L226 Difference]: Without dead ends: 1960 [2023-12-16 08:22:11,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-12-16 08:22:11,038 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 584 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-16 08:22:11,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 35 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-16 08:22:11,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1960 states. [2023-12-16 08:22:11,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1960 to 1829. [2023-12-16 08:22:11,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1829 states, 1828 states have (on average 1.0683807439824946) internal successors, (1953), 1828 states have internal predecessors, (1953), 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 08:22:11,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 1953 transitions. [2023-12-16 08:22:11,058 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 1953 transitions. Word has length 284 [2023-12-16 08:22:11,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:22:11,058 INFO L495 AbstractCegarLoop]: Abstraction has 1829 states and 1953 transitions. [2023-12-16 08:22:11,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.833333333333336) internal successors, (197), 5 states have internal predecessors, (197), 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 08:22:11,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 1953 transitions. [2023-12-16 08:22:11,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2023-12-16 08:22:11,063 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:22:11,063 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 08:22:11,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-12-16 08:22:11,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:22:11,266 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:22:11,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:22:11,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1019528315, now seen corresponding path program 1 times [2023-12-16 08:22:11,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:22:11,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [361244154] [2023-12-16 08:22:11,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:22:11,268 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 08:22:11,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:22:11,269 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 08:22:11,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-16 08:22:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:22:11,373 INFO L262 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 08:22:11,377 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:22:11,891 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 342 proven. 44 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2023-12-16 08:22:11,891 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 08:22:12,734 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 342 proven. 44 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2023-12-16 08:22:12,734 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:22:12,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [361244154] [2023-12-16 08:22:12,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [361244154] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 08:22:12,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 08:22:12,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2023-12-16 08:22:12,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896766887] [2023-12-16 08:22:12,734 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 08:22:12,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 08:22:12,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:22:12,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 08:22:12,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 08:22:12,736 INFO L87 Difference]: Start difference. First operand 1829 states and 1953 transitions. Second operand has 8 states, 8 states have (on average 36.0) internal successors, (288), 7 states have internal predecessors, (288), 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 08:22:13,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:22:13,583 INFO L93 Difference]: Finished difference Result 3743 states and 4009 transitions. [2023-12-16 08:22:13,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 08:22:13,584 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 36.0) internal successors, (288), 7 states have internal predecessors, (288), 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) Word has length 304 [2023-12-16 08:22:13,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:22:13,588 INFO L225 Difference]: With dead ends: 3743 [2023-12-16 08:22:13,588 INFO L226 Difference]: Without dead ends: 1973 [2023-12-16 08:22:13,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 609 GetRequests, 600 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2023-12-16 08:22:13,589 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 653 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-16 08:22:13,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 33 Invalid, 1234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-16 08:22:13,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1973 states. [2023-12-16 08:22:13,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1973 to 1960. [2023-12-16 08:22:13,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1960 states, 1959 states have (on average 1.0663603879530372) internal successors, (2089), 1959 states have internal predecessors, (2089), 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 08:22:13,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 2089 transitions. [2023-12-16 08:22:13,610 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 2089 transitions. Word has length 304 [2023-12-16 08:22:13,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:22:13,610 INFO L495 AbstractCegarLoop]: Abstraction has 1960 states and 2089 transitions. [2023-12-16 08:22:13,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 36.0) internal successors, (288), 7 states have internal predecessors, (288), 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 08:22:13,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 2089 transitions. [2023-12-16 08:22:13,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2023-12-16 08:22:13,613 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:22:13,614 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 08:22:13,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-16 08:22:13,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:22:13,817 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:22:13,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:22:13,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1969153069, now seen corresponding path program 1 times [2023-12-16 08:22:13,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:22:13,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1493927366] [2023-12-16 08:22:13,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:22:13,819 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:22:13,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:22:13,820 INFO L229 MonitoredProcess]: Starting monitored process 15 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 08:22:13,821 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 (15)] Waiting until timeout for monitored process [2023-12-16 08:22:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:22:13,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 08:22:13,928 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:22:14,659 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2023-12-16 08:22:14,659 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:22:14,660 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:22:14,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1493927366] [2023-12-16 08:22:14,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1493927366] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:22:14,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:22:14,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 08:22:14,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444739051] [2023-12-16 08:22:14,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:22:14,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 08:22:14,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:22:14,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 08:22:14,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-16 08:22:14,661 INFO L87 Difference]: Start difference. First operand 1960 states and 2089 transitions. Second operand has 6 states, 6 states have (on average 36.166666666666664) internal successors, (217), 5 states have internal predecessors, (217), 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 08:22:15,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:22:15,363 INFO L93 Difference]: Finished difference Result 2161 states and 2294 transitions. [2023-12-16 08:22:15,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 08:22:15,364 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 36.166666666666664) internal successors, (217), 5 states have internal predecessors, (217), 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) Word has length 324 [2023-12-16 08:22:15,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:22:15,364 INFO L225 Difference]: With dead ends: 2161 [2023-12-16 08:22:15,364 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 08:22:15,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-12-16 08:22:15,366 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 444 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 08:22:15,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 30 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-16 08:22:15,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 08:22:15,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 08:22:15,367 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 08:22:15,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 08:22:15,367 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 324 [2023-12-16 08:22:15,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:22:15,367 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 08:22:15,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.166666666666664) internal successors, (217), 5 states have internal predecessors, (217), 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 08:22:15,367 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 08:22:15,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 08:22:15,369 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 08:22:15,375 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 (15)] Forceful destruction successful, exit code 0 [2023-12-16 08:22:15,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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 08:22:15,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 08:22:15,962 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 400) no Hoare annotation was computed. [2023-12-16 08:22:15,962 INFO L899 garLoopResultBuilder]: For program point L598(line 598) no Hoare annotation was computed. [2023-12-16 08:22:15,962 INFO L899 garLoopResultBuilder]: For program point L334(lines 334 400) no Hoare annotation was computed. [2023-12-16 08:22:15,962 INFO L899 garLoopResultBuilder]: For program point L566-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,963 INFO L899 garLoopResultBuilder]: For program point L533-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,963 INFO L899 garLoopResultBuilder]: For program point L500-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,963 INFO L899 garLoopResultBuilder]: For program point L467-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,963 INFO L899 garLoopResultBuilder]: For program point L401(lines 401 403) no Hoare annotation was computed. [2023-12-16 08:22:15,963 INFO L899 garLoopResultBuilder]: For program point L434-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,963 INFO L899 garLoopResultBuilder]: For program point L401-2(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,963 INFO L899 garLoopResultBuilder]: For program point L302(lines 302 400) no Hoare annotation was computed. [2023-12-16 08:22:15,963 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 400) no Hoare annotation was computed. [2023-12-16 08:22:15,963 INFO L899 garLoopResultBuilder]: For program point L204(lines 204 400) no Hoare annotation was computed. [2023-12-16 08:22:15,963 INFO L899 garLoopResultBuilder]: For program point L72(lines 72 400) no Hoare annotation was computed. [2023-12-16 08:22:15,963 INFO L899 garLoopResultBuilder]: For program point L271(lines 271 400) no Hoare annotation was computed. [2023-12-16 08:22:15,963 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 400) no Hoare annotation was computed. [2023-12-16 08:22:15,963 INFO L899 garLoopResultBuilder]: For program point L569-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,963 INFO L899 garLoopResultBuilder]: For program point L536-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,963 INFO L899 garLoopResultBuilder]: For program point L503-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,963 INFO L899 garLoopResultBuilder]: For program point L470-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,963 INFO L899 garLoopResultBuilder]: For program point L437-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,963 INFO L899 garLoopResultBuilder]: For program point L371(lines 371 400) no Hoare annotation was computed. [2023-12-16 08:22:15,963 INFO L899 garLoopResultBuilder]: For program point L404-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,963 INFO L899 garLoopResultBuilder]: For program point L107(lines 107 400) no Hoare annotation was computed. [2023-12-16 08:22:15,964 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 400) no Hoare annotation was computed. [2023-12-16 08:22:15,964 INFO L899 garLoopResultBuilder]: For program point L339(lines 339 400) no Hoare annotation was computed. [2023-12-16 08:22:15,964 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 400) no Hoare annotation was computed. [2023-12-16 08:22:15,965 INFO L899 garLoopResultBuilder]: For program point L75(lines 75 400) no Hoare annotation was computed. [2023-12-16 08:22:15,965 INFO L899 garLoopResultBuilder]: For program point L373(lines 373 400) no Hoare annotation was computed. [2023-12-16 08:22:15,965 INFO L899 garLoopResultBuilder]: For program point L241(lines 241 400) no Hoare annotation was computed. [2023-12-16 08:22:15,965 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 400) no Hoare annotation was computed. [2023-12-16 08:22:15,966 INFO L899 garLoopResultBuilder]: For program point L572-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,966 INFO L899 garLoopResultBuilder]: For program point L539-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,966 INFO L899 garLoopResultBuilder]: For program point L506-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,966 INFO L899 garLoopResultBuilder]: For program point L473-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,966 INFO L899 garLoopResultBuilder]: For program point L440-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,966 INFO L899 garLoopResultBuilder]: For program point L407-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,966 INFO L899 garLoopResultBuilder]: For program point L275(lines 275 400) no Hoare annotation was computed. [2023-12-16 08:22:15,966 INFO L899 garLoopResultBuilder]: For program point L375(lines 375 400) no Hoare annotation was computed. [2023-12-16 08:22:15,966 INFO L899 garLoopResultBuilder]: For program point L309(lines 309 400) no Hoare annotation was computed. [2023-12-16 08:22:15,966 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 400) no Hoare annotation was computed. [2023-12-16 08:22:15,966 INFO L899 garLoopResultBuilder]: For program point L343(lines 343 400) no Hoare annotation was computed. [2023-12-16 08:22:15,966 INFO L899 garLoopResultBuilder]: For program point L112(lines 112 400) no Hoare annotation was computed. [2023-12-16 08:22:15,966 INFO L899 garLoopResultBuilder]: For program point L575-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,967 INFO L899 garLoopResultBuilder]: For program point L542-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,967 INFO L899 garLoopResultBuilder]: For program point L509-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,967 INFO L899 garLoopResultBuilder]: For program point L476-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,967 INFO L899 garLoopResultBuilder]: For program point L443-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,967 INFO L899 garLoopResultBuilder]: For program point L410-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,967 INFO L899 garLoopResultBuilder]: For program point L278(lines 278 400) no Hoare annotation was computed. [2023-12-16 08:22:15,967 INFO L899 garLoopResultBuilder]: For program point L146(lines 146 400) no Hoare annotation was computed. [2023-12-16 08:22:15,967 INFO L899 garLoopResultBuilder]: For program point L213(lines 213 400) no Hoare annotation was computed. [2023-12-16 08:22:15,967 INFO L899 garLoopResultBuilder]: For program point L82(lines 82 400) no Hoare annotation was computed. [2023-12-16 08:22:15,967 INFO L899 garLoopResultBuilder]: For program point L578-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,967 INFO L899 garLoopResultBuilder]: For program point L545-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,967 INFO L899 garLoopResultBuilder]: For program point L512-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,968 INFO L899 garLoopResultBuilder]: For program point L479-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,968 INFO L899 garLoopResultBuilder]: For program point L446-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,968 INFO L899 garLoopResultBuilder]: For program point L413-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,968 INFO L899 garLoopResultBuilder]: For program point L347(lines 347 400) no Hoare annotation was computed. [2023-12-16 08:22:15,968 INFO L899 garLoopResultBuilder]: For program point L248(lines 248 400) no Hoare annotation was computed. [2023-12-16 08:22:15,968 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 400) no Hoare annotation was computed. [2023-12-16 08:22:15,968 INFO L899 garLoopResultBuilder]: For program point L150(lines 150 400) no Hoare annotation was computed. [2023-12-16 08:22:15,968 INFO L899 garLoopResultBuilder]: For program point L382(lines 382 400) no Hoare annotation was computed. [2023-12-16 08:22:15,968 INFO L899 garLoopResultBuilder]: For program point L316(lines 316 400) no Hoare annotation was computed. [2023-12-16 08:22:15,968 INFO L899 garLoopResultBuilder]: For program point L283(lines 283 400) no Hoare annotation was computed. [2023-12-16 08:22:15,968 INFO L899 garLoopResultBuilder]: For program point L118(lines 118 400) no Hoare annotation was computed. [2023-12-16 08:22:15,968 INFO L899 garLoopResultBuilder]: For program point L581-1(lines 581 583) no Hoare annotation was computed. [2023-12-16 08:22:15,968 INFO L899 garLoopResultBuilder]: For program point L548-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,968 INFO L899 garLoopResultBuilder]: For program point L515-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,968 INFO L899 garLoopResultBuilder]: For program point L482-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,968 INFO L899 garLoopResultBuilder]: For program point L449-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,968 INFO L899 garLoopResultBuilder]: For program point L416-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,968 INFO L899 garLoopResultBuilder]: For program point L218(lines 218 400) no Hoare annotation was computed. [2023-12-16 08:22:15,968 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 400) no Hoare annotation was computed. [2023-12-16 08:22:15,968 INFO L899 garLoopResultBuilder]: For program point L154(lines 154 400) no Hoare annotation was computed. [2023-12-16 08:22:15,968 INFO L899 garLoopResultBuilder]: For program point L551-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,969 INFO L899 garLoopResultBuilder]: For program point L518-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,969 INFO L899 garLoopResultBuilder]: For program point L485-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,969 INFO L899 garLoopResultBuilder]: For program point L452-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,969 INFO L899 garLoopResultBuilder]: For program point L419-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,969 INFO L899 garLoopResultBuilder]: For program point L188(lines 188 400) no Hoare annotation was computed. [2023-12-16 08:22:15,969 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 400) no Hoare annotation was computed. [2023-12-16 08:22:15,969 INFO L899 garLoopResultBuilder]: For program point L288(lines 288 400) no Hoare annotation was computed. [2023-12-16 08:22:15,969 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 400) no Hoare annotation was computed. [2023-12-16 08:22:15,970 INFO L899 garLoopResultBuilder]: For program point L90(lines 90 400) no Hoare annotation was computed. [2023-12-16 08:22:15,971 INFO L899 garLoopResultBuilder]: For program point L355(lines 355 400) no Hoare annotation was computed. [2023-12-16 08:22:15,971 INFO L899 garLoopResultBuilder]: For program point L322(lines 322 400) no Hoare annotation was computed. [2023-12-16 08:22:15,971 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 08:22:15,971 INFO L899 garLoopResultBuilder]: For program point L124(lines 124 400) no Hoare annotation was computed. [2023-12-16 08:22:15,971 INFO L899 garLoopResultBuilder]: For program point L587(lines 587 604) no Hoare annotation was computed. [2023-12-16 08:22:15,971 INFO L899 garLoopResultBuilder]: For program point L554-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,971 INFO L899 garLoopResultBuilder]: For program point L521-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,971 INFO L899 garLoopResultBuilder]: For program point L488-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,971 INFO L899 garLoopResultBuilder]: For program point L455-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,971 INFO L899 garLoopResultBuilder]: For program point L422-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,971 INFO L899 garLoopResultBuilder]: For program point L224(lines 224 400) no Hoare annotation was computed. [2023-12-16 08:22:15,971 INFO L899 garLoopResultBuilder]: For program point L158(lines 158 400) no Hoare annotation was computed. [2023-12-16 08:22:15,971 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 400) no Hoare annotation was computed. [2023-12-16 08:22:15,972 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 400) no Hoare annotation was computed. [2023-12-16 08:22:15,972 INFO L899 garLoopResultBuilder]: For program point L557-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,972 INFO L899 garLoopResultBuilder]: For program point L524-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,972 INFO L899 garLoopResultBuilder]: For program point L491-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,972 INFO L899 garLoopResultBuilder]: For program point L458-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,972 INFO L899 garLoopResultBuilder]: For program point L392(lines 392 400) no Hoare annotation was computed. [2023-12-16 08:22:15,972 INFO L899 garLoopResultBuilder]: For program point L425-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,972 INFO L899 garLoopResultBuilder]: For program point L326(lines 326 400) no Hoare annotation was computed. [2023-12-16 08:22:15,972 INFO L899 garLoopResultBuilder]: For program point L260(lines 260 400) no Hoare annotation was computed. [2023-12-16 08:22:15,972 INFO L899 garLoopResultBuilder]: For program point L525(line 525) no Hoare annotation was computed. [2023-12-16 08:22:15,972 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 08:22:15,972 INFO L899 garLoopResultBuilder]: For program point L228(lines 228 400) no Hoare annotation was computed. [2023-12-16 08:22:15,974 INFO L899 garLoopResultBuilder]: For program point L162(lines 162 400) no Hoare annotation was computed. [2023-12-16 08:22:15,974 INFO L899 garLoopResultBuilder]: For program point L129(lines 129 400) no Hoare annotation was computed. [2023-12-16 08:22:15,974 INFO L899 garLoopResultBuilder]: For program point L328(lines 328 400) no Hoare annotation was computed. [2023-12-16 08:22:15,974 INFO L899 garLoopResultBuilder]: For program point L196(lines 196 400) no Hoare annotation was computed. [2023-12-16 08:22:15,974 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 400) no Hoare annotation was computed. [2023-12-16 08:22:15,974 INFO L899 garLoopResultBuilder]: For program point L560-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,975 INFO L895 garLoopResultBuilder]: At program point L593-2(lines 593 603) the Hoare annotation is: (let ((.cse2 (= ~a7~0 (_ bv0 32))) (.cse3 (= (_ bv1 32) ~a17~0)) (.cse0 (= (_ bv1 32) ~a20~0)) (.cse4 (= (_ bv5 32) ~a16~0)) (.cse5 (= (_ bv8 32) ~a12~0)) (.cse6 (= ~a7~0 (_ bv1 32))) (.cse1 (= ~a8~0 (_ bv15 32))) (.cse7 (= (_ bv4 32) ~a16~0)) (.cse8 (= (_ bv0 32) ~a20~0)) (.cse9 (= (_ bv0 32) ~a17~0)) (.cse10 (= (_ bv1 32) ~a21~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 (= (_ bv0 32) ~a21~0)) (and .cse5 .cse6 .cse7 .cse8 .cse9 (= (_ bv14 32) ~a8~0) .cse10) (and .cse5 .cse2 .cse10) (and .cse0 .cse5 .cse6 .cse7 .cse3 (= ~a8~0 (_ bv13 32)) .cse10) (and .cse0 .cse5 .cse6 .cse4 .cse10) (and .cse5 .cse6 .cse8 .cse4 .cse10) (and .cse5 .cse6 .cse1 .cse7 .cse8 .cse9 .cse10))) [2023-12-16 08:22:15,975 INFO L899 garLoopResultBuilder]: For program point L527-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,975 INFO L899 garLoopResultBuilder]: For program point L494-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,975 INFO L899 garLoopResultBuilder]: For program point L461-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,975 INFO L899 garLoopResultBuilder]: For program point L428-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,975 INFO L899 garLoopResultBuilder]: For program point L296(lines 296 400) no Hoare annotation was computed. [2023-12-16 08:22:15,975 INFO L899 garLoopResultBuilder]: For program point calculate_output_returnLabel#1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,975 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 525) no Hoare annotation was computed. [2023-12-16 08:22:15,975 INFO L899 garLoopResultBuilder]: For program point L363(lines 363 400) no Hoare annotation was computed. [2023-12-16 08:22:15,975 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 400) no Hoare annotation was computed. [2023-12-16 08:22:15,975 INFO L899 garLoopResultBuilder]: For program point L563-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,975 INFO L899 garLoopResultBuilder]: For program point L530-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,975 INFO L899 garLoopResultBuilder]: For program point L497-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,975 INFO L899 garLoopResultBuilder]: For program point L464-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,975 INFO L899 garLoopResultBuilder]: For program point L431-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:15,976 INFO L899 garLoopResultBuilder]: For program point L365(lines 365 400) no Hoare annotation was computed. [2023-12-16 08:22:15,976 INFO L899 garLoopResultBuilder]: For program point L266(lines 266 400) no Hoare annotation was computed. [2023-12-16 08:22:15,976 INFO L899 garLoopResultBuilder]: For program point L233(lines 233 400) no Hoare annotation was computed. [2023-12-16 08:22:15,976 INFO L899 garLoopResultBuilder]: For program point L134(lines 134 400) no Hoare annotation was computed. [2023-12-16 08:22:15,979 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 08:22:15,980 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 08:22:15,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 08:22:15 BoogieIcfgContainer [2023-12-16 08:22:15,999 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 08:22:15,999 INFO L158 Benchmark]: Toolchain (without parser) took 30355.99ms. Allocated memory was 169.9MB in the beginning and 661.7MB in the end (delta: 491.8MB). Free memory was 120.7MB in the beginning and 509.5MB in the end (delta: -388.8MB). Peak memory consumption was 386.1MB. Max. memory is 8.0GB. [2023-12-16 08:22:15,999 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 169.9MB. Free memory is still 121.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 08:22:16,000 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.65ms. Allocated memory is still 169.9MB. Free memory was 120.4MB in the beginning and 90.7MB in the end (delta: 29.7MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2023-12-16 08:22:16,000 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.17ms. Allocated memory is still 169.9MB. Free memory was 90.7MB in the beginning and 84.7MB in the end (delta: 6.0MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-16 08:22:16,000 INFO L158 Benchmark]: Boogie Preprocessor took 111.75ms. Allocated memory was 169.9MB in the beginning and 261.1MB in the end (delta: 91.2MB). Free memory was 84.7MB in the beginning and 225.7MB in the end (delta: -140.9MB). Peak memory consumption was 15.6MB. Max. memory is 8.0GB. [2023-12-16 08:22:16,001 INFO L158 Benchmark]: RCFGBuilder took 1059.22ms. Allocated memory is still 261.1MB. Free memory was 225.7MB in the beginning and 179.1MB in the end (delta: 46.6MB). Peak memory consumption was 89.6MB. Max. memory is 8.0GB. [2023-12-16 08:22:16,001 INFO L158 Benchmark]: TraceAbstraction took 28738.25ms. Allocated memory was 261.1MB in the beginning and 661.7MB in the end (delta: 400.6MB). Free memory was 178.0MB in the beginning and 509.5MB in the end (delta: -331.5MB). Peak memory consumption was 351.1MB. Max. memory is 8.0GB. [2023-12-16 08:22:16,002 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.12ms. Allocated memory is still 169.9MB. Free memory is still 121.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 369.65ms. Allocated memory is still 169.9MB. Free memory was 120.4MB in the beginning and 90.7MB in the end (delta: 29.7MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 73.17ms. Allocated memory is still 169.9MB. Free memory was 90.7MB in the beginning and 84.7MB in the end (delta: 6.0MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 111.75ms. Allocated memory was 169.9MB in the beginning and 261.1MB in the end (delta: 91.2MB). Free memory was 84.7MB in the beginning and 225.7MB in the end (delta: -140.9MB). Peak memory consumption was 15.6MB. Max. memory is 8.0GB. * RCFGBuilder took 1059.22ms. Allocated memory is still 261.1MB. Free memory was 225.7MB in the beginning and 179.1MB in the end (delta: 46.6MB). Peak memory consumption was 89.6MB. Max. memory is 8.0GB. * TraceAbstraction took 28738.25ms. Allocated memory was 261.1MB in the beginning and 661.7MB in the end (delta: 400.6MB). Free memory was 178.0MB in the beginning and 509.5MB in the end (delta: -331.5MB). Peak memory consumption was 351.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 525]: 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 1 procedures, 136 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.6s, OverallIterations: 14, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4094 SdHoareTripleChecker+Valid, 9.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4094 mSDsluCounter, 1348 SdHoareTripleChecker+Invalid, 7.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 195 mSDsCounter, 786 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10724 IncrementalHoareTripleChecker+Invalid, 11510 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 786 mSolverCounterUnsat, 1153 mSDtfsCounter, 10724 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3501 GetRequests, 3437 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3008occurred in iteration=11, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 1861 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 26 NumberOfFragments, 135 HoareAnnotationTreeSize, 1 FormulaSimplifications, 3170 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 1 FormulaSimplificationsInter, 751 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 13.2s InterpolantComputationTime, 2966 NumberOfCodeBlocks, 2966 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 3482 ConstructedInterpolants, 0 QuantifiedInterpolants, 22621 SizeOfPredicates, 39 NumberOfNonLiveVariables, 4120 ConjunctsInSsa, 93 ConjunctsInUnsatCore, 16 InterpolantComputations, 12 PerfectInterpolantSequences, 3636/3768 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: 593]: Loop Invariant Derived loop invariant: ((((((((((((1 == a20) && (a8 == 15)) && (a7 == 0)) && (1 == a17)) && (5 == a16)) || (((8 == a12) && (a7 == 1)) && (0 == a21))) || (((((((8 == a12) && (a7 == 1)) && (4 == a16)) && (0 == a20)) && (0 == a17)) && (14 == a8)) && (1 == a21))) || (((8 == a12) && (a7 == 0)) && (1 == a21))) || (((((((1 == a20) && (8 == a12)) && (a7 == 1)) && (4 == a16)) && (1 == a17)) && (a8 == 13)) && (1 == a21))) || (((((1 == a20) && (8 == a12)) && (a7 == 1)) && (5 == a16)) && (1 == a21))) || (((((8 == a12) && (a7 == 1)) && (0 == a20)) && (5 == a16)) && (1 == a21))) || (((((((8 == a12) && (a7 == 1)) && (a8 == 15)) && (4 == a16)) && (0 == a20)) && (0 == a17)) && (1 == a21))) RESULT: Ultimate proved your program to be correct! [2023-12-16 08:22:16,040 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...