/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/loops-crafted-1/sumt9.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 23:54:39,290 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 23:54:39,325 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-24 23:54:39,327 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 23:54:39,328 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 23:54:39,342 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 23:54:39,342 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 23:54:39,342 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 23:54:39,343 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 23:54:39,344 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 23:54:39,344 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 23:54:39,344 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 23:54:39,344 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 23:54:39,345 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 23:54:39,345 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 23:54:39,345 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 23:54:39,345 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 23:54:39,345 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 23:54:39,346 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 23:54:39,346 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 23:54:39,346 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 23:54:39,349 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 23:54:39,349 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 23:54:39,349 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 23:54:39,349 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 23:54:39,350 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 23:54:39,350 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 23:54:39,350 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 23:54:39,350 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 23:54:39,350 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 23:54:39,351 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 23:54:39,351 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 23:54:39,351 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 23:54:39,351 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 23:54:39,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 23:54:39,351 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 23:54:39,351 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 23:54:39,351 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 23:54:39,352 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 23:54:39,352 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 23:54:39,352 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 23:54:39,352 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 23:54:39,352 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 23:54:39,352 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 23:54:39,352 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 23:54:39,353 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 23:54:39,353 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-24 23:54:39,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 23:54:39,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 23:54:39,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 23:54:39,520 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 23:54:39,521 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 23:54:39,522 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt9.c [2023-12-24 23:54:40,498 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 23:54:40,658 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 23:54:40,658 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt9.c [2023-12-24 23:54:40,663 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f28f820c4/a9dcacca2f5f4d74a7d32c5212b91e27/FLAG842cb9d94 [2023-12-24 23:54:40,675 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f28f820c4/a9dcacca2f5f4d74a7d32c5212b91e27 [2023-12-24 23:54:40,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 23:54:40,679 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 23:54:40,681 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 23:54:40,681 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 23:54:40,685 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 23:54:40,685 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 11:54:40" (1/1) ... [2023-12-24 23:54:40,686 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51c15d1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:54:40, skipping insertion in model container [2023-12-24 23:54:40,686 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 11:54:40" (1/1) ... [2023-12-24 23:54:40,700 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 23:54:40,800 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt9.c[403,416] [2023-12-24 23:54:40,820 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 23:54:40,828 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 23:54:40,837 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt9.c[403,416] [2023-12-24 23:54:40,842 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 23:54:40,851 INFO L206 MainTranslator]: Completed translation [2023-12-24 23:54:40,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:54:40 WrapperNode [2023-12-24 23:54:40,851 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 23:54:40,852 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 23:54:40,852 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 23:54:40,852 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 23:54:40,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:54:40" (1/1) ... [2023-12-24 23:54:40,876 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:54:40" (1/1) ... [2023-12-24 23:54:40,889 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 66 [2023-12-24 23:54:40,889 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 23:54:40,889 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 23:54:40,890 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 23:54:40,890 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 23:54:40,898 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:54:40" (1/1) ... [2023-12-24 23:54:40,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:54:40" (1/1) ... [2023-12-24 23:54:40,913 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:54:40" (1/1) ... [2023-12-24 23:54:40,928 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2023-12-24 23:54:40,928 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:54:40" (1/1) ... [2023-12-24 23:54:40,928 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:54:40" (1/1) ... [2023-12-24 23:54:40,941 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:54:40" (1/1) ... [2023-12-24 23:54:40,944 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:54:40" (1/1) ... [2023-12-24 23:54:40,944 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:54:40" (1/1) ... [2023-12-24 23:54:40,945 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:54:40" (1/1) ... [2023-12-24 23:54:40,946 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 23:54:40,947 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 23:54:40,947 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 23:54:40,947 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 23:54:40,948 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:54:40" (1/1) ... [2023-12-24 23:54:40,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 23:54:40,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 23:54:40,978 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-24 23:54:40,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-24 23:54:41,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 23:54:41,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 23:54:41,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 23:54:41,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 23:54:41,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 23:54:41,059 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 23:54:41,062 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 23:54:41,355 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 23:54:41,374 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 23:54:41,374 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 23:54:41,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 11:54:41 BoogieIcfgContainer [2023-12-24 23:54:41,374 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 23:54:41,376 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 23:54:41,376 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 23:54:41,378 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 23:54:41,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 11:54:40" (1/3) ... [2023-12-24 23:54:41,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c31ede3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 11:54:41, skipping insertion in model container [2023-12-24 23:54:41,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:54:40" (2/3) ... [2023-12-24 23:54:41,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c31ede3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 11:54:41, skipping insertion in model container [2023-12-24 23:54:41,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 11:54:41" (3/3) ... [2023-12-24 23:54:41,380 INFO L112 eAbstractionObserver]: Analyzing ICFG sumt9.c [2023-12-24 23:54:41,391 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 23:54:41,391 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 23:54:41,418 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 23:54:41,422 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;@bdadc19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 23:54:41,422 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 23:54:41,425 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:54:41,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-24 23:54:41,429 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:54:41,430 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-24 23:54:41,430 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:54:41,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:54:41,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1576921150, now seen corresponding path program 1 times [2023-12-24 23:54:41,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:54:41,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2032316612] [2023-12-24 23:54:41,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:54:41,444 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 23:54:41,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:54:41,447 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 23:54:41,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-24 23:54:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:54:41,531 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 23:54:41,535 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:54:41,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:54:41,889 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 23:54:41,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:54:41,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2032316612] [2023-12-24 23:54:41,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2032316612] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 23:54:41,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 23:54:41,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 23:54:41,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501527814] [2023-12-24 23:54:41,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 23:54:41,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 23:54:41,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:54:41,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 23:54:41,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 23:54:41,921 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 18 states have internal predecessors, (30), 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 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:54:42,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:54:42,211 INFO L93 Difference]: Finished difference Result 43 states and 68 transitions. [2023-12-24 23:54:42,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 23:54:42,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2023-12-24 23:54:42,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:54:42,218 INFO L225 Difference]: With dead ends: 43 [2023-12-24 23:54:42,218 INFO L226 Difference]: Without dead ends: 21 [2023-12-24 23:54:42,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 23:54:42,221 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 23:54:42,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 50 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 23:54:42,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-24 23:54:42,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2023-12-24 23:54:42,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:54:42,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2023-12-24 23:54:42,244 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 7 [2023-12-24 23:54:42,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:54:42,245 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2023-12-24 23:54:42,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:54:42,245 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2023-12-24 23:54:42,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-24 23:54:42,246 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:54:42,246 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-12-24 23:54:42,251 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-24 23:54:42,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 23:54:42,451 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:54:42,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:54:42,452 INFO L85 PathProgramCache]: Analyzing trace with hash 971425530, now seen corresponding path program 1 times [2023-12-24 23:54:42,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:54:42,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1601334649] [2023-12-24 23:54:42,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:54:42,453 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 23:54:42,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:54:42,454 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 23:54:42,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-24 23:54:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:54:42,502 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 23:54:42,502 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:54:42,520 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:54:42,520 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:54:42,891 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:54:42,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:54:42,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1601334649] [2023-12-24 23:54:42,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1601334649] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:54:42,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:54:42,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-24 23:54:42,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115170308] [2023-12-24 23:54:42,892 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:54:42,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 23:54:42,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:54:42,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 23:54:42,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 23:54:42,893 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:54:47,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.34s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:54:49,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:54:50,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:54:50,566 INFO L93 Difference]: Finished difference Result 66 states and 99 transitions. [2023-12-24 23:54:50,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 23:54:50,571 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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 12 [2023-12-24 23:54:50,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:54:50,572 INFO L225 Difference]: With dead ends: 66 [2023-12-24 23:54:50,572 INFO L226 Difference]: Without dead ends: 52 [2023-12-24 23:54:50,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-24 23:54:50,573 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 77 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2023-12-24 23:54:50,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 22 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2023-12-24 23:54:50,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-12-24 23:54:50,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2023-12-24 23:54:50,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.391304347826087) internal successors, (64), 46 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:54:50,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2023-12-24 23:54:50,579 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 12 [2023-12-24 23:54:50,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:54:50,580 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2023-12-24 23:54:50,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:54:50,580 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2023-12-24 23:54:50,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-24 23:54:50,580 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:54:50,580 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 23:54:50,585 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 (3)] Ended with exit code 0 [2023-12-24 23:54:50,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 23:54:50,783 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:54:50,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:54:50,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1475199337, now seen corresponding path program 1 times [2023-12-24 23:54:50,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:54:50,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1474656678] [2023-12-24 23:54:50,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:54:50,786 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 23:54:50,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:54:50,787 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 23:54:50,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-24 23:54:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:54:50,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-24 23:54:50,902 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:54:51,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:54:51,536 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:54:51,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-24 23:54:51,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:54:51,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1474656678] [2023-12-24 23:54:51,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1474656678] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:54:51,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:54:51,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2023-12-24 23:54:51,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337201412] [2023-12-24 23:54:51,958 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:54:51,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 23:54:51,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:54:51,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 23:54:51,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-24 23:54:51,960 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:54:56,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:55:00,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:55:04,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:55:08,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:55:12,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:55:16,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:55:20,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:55:21,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:55:21,027 INFO L93 Difference]: Finished difference Result 66 states and 92 transitions. [2023-12-24 23:55:21,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-24 23:55:21,031 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 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 19 [2023-12-24 23:55:21,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:55:21,032 INFO L225 Difference]: With dead ends: 66 [2023-12-24 23:55:21,032 INFO L226 Difference]: Without dead ends: 64 [2023-12-24 23:55:21,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-12-24 23:55:21,033 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 3 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.0s IncrementalHoareTripleChecker+Time [2023-12-24 23:55:21,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 25 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 170 Invalid, 7 Unknown, 0 Unchecked, 29.0s Time] [2023-12-24 23:55:21,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-12-24 23:55:21,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-12-24 23:55:21,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 63 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:55:21,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2023-12-24 23:55:21,041 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 88 transitions. Word has length 19 [2023-12-24 23:55:21,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:55:21,042 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 88 transitions. [2023-12-24 23:55:21,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:55:21,042 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 88 transitions. [2023-12-24 23:55:21,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-24 23:55:21,042 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:55:21,042 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 23:55:21,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-24 23:55:21,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 23:55:21,252 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:55:21,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:55:21,253 INFO L85 PathProgramCache]: Analyzing trace with hash 704984833, now seen corresponding path program 1 times [2023-12-24 23:55:21,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:55:21,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [590208325] [2023-12-24 23:55:21,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:55:21,253 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 23:55:21,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:55:21,254 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 23:55:21,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-24 23:55:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:55:21,362 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 23:55:21,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:55:21,401 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:55:21,401 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:55:21,465 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:55:21,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:55:21,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [590208325] [2023-12-24 23:55:21,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [590208325] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:55:21,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:55:21,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-24 23:55:21,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165236188] [2023-12-24 23:55:21,466 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:55:21,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 23:55:21,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:55:21,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 23:55:21,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-24 23:55:21,467 INFO L87 Difference]: Start difference. First operand 64 states and 88 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:55:22,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:55:22,292 INFO L93 Difference]: Finished difference Result 140 states and 194 transitions. [2023-12-24 23:55:22,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-24 23:55:22,293 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 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 25 [2023-12-24 23:55:22,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:55:22,294 INFO L225 Difference]: With dead ends: 140 [2023-12-24 23:55:22,294 INFO L226 Difference]: Without dead ends: 104 [2023-12-24 23:55:22,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2023-12-24 23:55:22,295 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 92 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-24 23:55:22,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 40 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-24 23:55:22,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-24 23:55:22,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 93. [2023-12-24 23:55:22,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.3478260869565217) internal successors, (124), 92 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:55:22,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2023-12-24 23:55:22,303 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 25 [2023-12-24 23:55:22,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:55:22,303 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2023-12-24 23:55:22,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:55:22,303 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2023-12-24 23:55:22,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-24 23:55:22,304 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:55:22,304 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 23:55:22,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-24 23:55:22,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 23:55:22,509 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:55:22,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:55:22,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1675751090, now seen corresponding path program 1 times [2023-12-24 23:55:22,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:55:22,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1258740193] [2023-12-24 23:55:22,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:55:22,510 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 23:55:22,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:55:22,511 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 23:55:22,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-24 23:55:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:55:22,657 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-24 23:55:22,659 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:55:23,557 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:55:23,557 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:55:24,170 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-24 23:55:24,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:55:24,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1258740193] [2023-12-24 23:55:24,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1258740193] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:55:24,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:55:24,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 11 [2023-12-24 23:55:24,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049738415] [2023-12-24 23:55:24,171 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:55:24,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 23:55:24,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:55:24,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 23:55:24,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-12-24 23:55:24,172 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:55:28,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:55:32,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:55:36,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:55:40,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:55:44,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:55:49,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:55:49,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:55:49,370 INFO L93 Difference]: Finished difference Result 136 states and 188 transitions. [2023-12-24 23:55:49,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 23:55:49,371 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 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 31 [2023-12-24 23:55:49,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:55:49,372 INFO L225 Difference]: With dead ends: 136 [2023-12-24 23:55:49,372 INFO L226 Difference]: Without dead ends: 134 [2023-12-24 23:55:49,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2023-12-24 23:55:49,373 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 3 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 4 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.0s IncrementalHoareTripleChecker+Time [2023-12-24 23:55:49,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 36 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 265 Invalid, 6 Unknown, 0 Unchecked, 25.0s Time] [2023-12-24 23:55:49,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-12-24 23:55:49,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2023-12-24 23:55:49,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.3609022556390977) internal successors, (181), 133 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:55:49,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 181 transitions. [2023-12-24 23:55:49,382 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 181 transitions. Word has length 31 [2023-12-24 23:55:49,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:55:49,382 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 181 transitions. [2023-12-24 23:55:49,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:55:49,383 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 181 transitions. [2023-12-24 23:55:49,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-24 23:55:49,383 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:55:49,383 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 23:55:49,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-24 23:55:49,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 23:55:49,591 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:55:49,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:55:49,592 INFO L85 PathProgramCache]: Analyzing trace with hash 127576481, now seen corresponding path program 1 times [2023-12-24 23:55:49,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:55:49,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [190498761] [2023-12-24 23:55:49,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:55:49,592 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 23:55:49,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:55:49,593 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 23:55:49,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-24 23:55:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:55:49,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 23:55:49,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:55:49,826 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:55:49,827 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:55:51,593 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:55:51,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:55:51,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [190498761] [2023-12-24 23:55:51,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [190498761] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:55:51,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:55:51,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-24 23:55:51,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623489775] [2023-12-24 23:55:51,594 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:55:51,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 23:55:51,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:55:51,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 23:55:51,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-24 23:55:51,595 INFO L87 Difference]: Start difference. First operand 134 states and 181 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:55:57,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:55:59,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:56:01,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:56:01,126 INFO L93 Difference]: Finished difference Result 303 states and 427 transitions. [2023-12-24 23:56:01,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-24 23:56:01,137 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 9 states have internal predecessors, (73), 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 38 [2023-12-24 23:56:01,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:56:01,138 INFO L225 Difference]: With dead ends: 303 [2023-12-24 23:56:01,138 INFO L226 Difference]: Without dead ends: 208 [2023-12-24 23:56:01,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2023-12-24 23:56:01,139 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 87 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2023-12-24 23:56:01,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 49 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2023-12-24 23:56:01,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2023-12-24 23:56:01,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 199. [2023-12-24 23:56:01,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 198 states have (on average 1.378787878787879) internal successors, (273), 198 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:56:01,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 273 transitions. [2023-12-24 23:56:01,148 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 273 transitions. Word has length 38 [2023-12-24 23:56:01,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:56:01,148 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 273 transitions. [2023-12-24 23:56:01,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:56:01,148 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 273 transitions. [2023-12-24 23:56:01,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-24 23:56:01,149 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:56:01,149 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 23:56:01,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-24 23:56:01,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 23:56:01,358 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:56:01,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:56:01,358 INFO L85 PathProgramCache]: Analyzing trace with hash 570089175, now seen corresponding path program 1 times [2023-12-24 23:56:01,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:56:01,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865743064] [2023-12-24 23:56:01,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:56:01,359 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 23:56:01,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:56:01,359 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 23:56:01,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-24 23:56:01,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:56:01,552 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-24 23:56:01,553 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:56:02,806 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:56:02,807 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:56:03,619 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-12-24 23:56:03,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:56:03,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865743064] [2023-12-24 23:56:03,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1865743064] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:56:03,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:56:03,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4] total 13 [2023-12-24 23:56:03,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668421324] [2023-12-24 23:56:03,619 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:56:03,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-24 23:56:03,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:56:03,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-24 23:56:03,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-12-24 23:56:03,620 INFO L87 Difference]: Start difference. First operand 199 states and 273 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 13 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:56:08,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:56:12,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:56:16,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:56:20,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:56:25,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:56:25,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:56:25,052 INFO L93 Difference]: Finished difference Result 312 states and 436 transitions. [2023-12-24 23:56:25,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-24 23:56:25,056 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 13 states have internal predecessors, (61), 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 42 [2023-12-24 23:56:25,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:56:25,057 INFO L225 Difference]: With dead ends: 312 [2023-12-24 23:56:25,057 INFO L226 Difference]: Without dead ends: 310 [2023-12-24 23:56:25,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2023-12-24 23:56:25,058 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 5 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.2s IncrementalHoareTripleChecker+Time [2023-12-24 23:56:25,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 56 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 415 Invalid, 5 Unknown, 0 Unchecked, 21.2s Time] [2023-12-24 23:56:25,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2023-12-24 23:56:25,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2023-12-24 23:56:25,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 1.3559870550161812) internal successors, (419), 309 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:56:25,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 419 transitions. [2023-12-24 23:56:25,075 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 419 transitions. Word has length 42 [2023-12-24 23:56:25,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:56:25,075 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 419 transitions. [2023-12-24 23:56:25,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 13 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:56:25,075 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 419 transitions. [2023-12-24 23:56:25,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-24 23:56:25,076 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:56:25,076 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 23:56:25,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-24 23:56:25,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 23:56:25,277 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:56:25,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:56:25,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1478967172, now seen corresponding path program 1 times [2023-12-24 23:56:25,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:56:25,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [872644819] [2023-12-24 23:56:25,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:56:25,277 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 23:56:25,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:56:25,278 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 23:56:25,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-24 23:56:25,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:56:25,526 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 23:56:25,528 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:56:25,612 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:56:25,612 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:56:27,928 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:56:27,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:56:27,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [872644819] [2023-12-24 23:56:27,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [872644819] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:56:27,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:56:27,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-12-24 23:56:27,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883020014] [2023-12-24 23:56:27,929 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:56:27,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 23:56:27,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:56:27,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 23:56:27,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-12-24 23:56:27,930 INFO L87 Difference]: Start difference. First operand 310 states and 419 transitions. Second operand has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:56:33,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:56:37,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:56:41,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:56:45,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:56:49,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:56:52,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:56:56,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:57:02,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:57:06,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:57:10,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:57:14,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:57:18,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:57:22,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:57:24,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:57:29,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:57:33,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:57:37,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:57:41,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:57:45,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:57:49,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:57:52,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:57:57,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:58:01,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:58:05,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:58:07,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:58:11,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:58:15,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:58:19,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:58:24,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:58:28,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:58:32,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:58:36,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:58:40,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:58:44,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:58:48,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:58:52,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:58:59,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:59:02,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:59:04,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:59:07,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:59:09,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:59:14,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:59:18,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:59:22,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:59:26,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:59:30,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:59:34,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:59:36,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:59:40,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.79s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:59:42,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:59:44,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:59:49,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:59:53,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 23:59:57,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:00:01,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:00:05,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:00:09,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:00:10,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:00:14,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:00:18,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:00:19,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:00:20,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:00:20,036 INFO L93 Difference]: Finished difference Result 1048 states and 1488 transitions. [2023-12-25 00:00:20,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-25 00:00:20,054 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 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 50 [2023-12-25 00:00:20,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:00:20,057 INFO L225 Difference]: With dead ends: 1048 [2023-12-25 00:00:20,057 INFO L226 Difference]: Without dead ends: 787 [2023-12-25 00:00:20,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2023-12-25 00:00:20,059 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 193 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 57 mSolverCounterUnsat, 43 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 219.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 43 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 220.9s IncrementalHoareTripleChecker+Time [2023-12-25 00:00:20,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 80 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 297 Invalid, 43 Unknown, 0 Unchecked, 220.9s Time] [2023-12-25 00:00:20,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2023-12-25 00:00:20,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 755. [2023-12-25 00:00:20,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 754 states have (on average 1.4217506631299734) internal successors, (1072), 754 states have internal predecessors, (1072), 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-25 00:00:20,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1072 transitions. [2023-12-25 00:00:20,142 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1072 transitions. Word has length 50 [2023-12-25 00:00:20,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:00:20,142 INFO L495 AbstractCegarLoop]: Abstraction has 755 states and 1072 transitions. [2023-12-25 00:00:20,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 11 states have internal predecessors, (97), 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-25 00:00:20,142 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1072 transitions. [2023-12-25 00:00:20,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-25 00:00:20,145 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:00:20,145 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:00:20,163 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-25 00:00:20,360 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-25 00:00:20,360 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:00:20,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:00:20,361 INFO L85 PathProgramCache]: Analyzing trace with hash 387771831, now seen corresponding path program 1 times [2023-12-25 00:00:20,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:00:20,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [199822140] [2023-12-25 00:00:20,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:00:20,361 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-25 00:00:20,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:00:20,377 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-25 00:00:20,411 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-25 00:00:20,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:00:20,758 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-25 00:00:20,760 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:00:23,007 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:00:23,007 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:00:24,341 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-12-25 00:00:24,341 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:00:24,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [199822140] [2023-12-25 00:00:24,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [199822140] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:00:24,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:00:24,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4] total 15 [2023-12-25 00:00:24,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963298616] [2023-12-25 00:00:24,341 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:00:24,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 00:00:24,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:00:24,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 00:00:24,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2023-12-25 00:00:24,342 INFO L87 Difference]: Start difference. First operand 755 states and 1072 transitions. Second operand has 16 states, 16 states have (on average 4.5) internal successors, (72), 15 states have internal predecessors, (72), 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-25 00:00:29,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:00:34,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:00:38,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:00:42,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:00:42,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:00:42,692 INFO L93 Difference]: Finished difference Result 974 states and 1393 transitions. [2023-12-25 00:00:42,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-25 00:00:42,713 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 15 states have internal predecessors, (72), 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 52 [2023-12-25 00:00:42,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:00:42,717 INFO L225 Difference]: With dead ends: 974 [2023-12-25 00:00:42,717 INFO L226 Difference]: Without dead ends: 972 [2023-12-25 00:00:42,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2023-12-25 00:00:42,720 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 6 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.0s IncrementalHoareTripleChecker+Time [2023-12-25 00:00:42,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 89 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 635 Invalid, 4 Unknown, 0 Unchecked, 18.0s Time] [2023-12-25 00:00:42,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2023-12-25 00:00:42,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 972. [2023-12-25 00:00:42,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 971 states have (on average 1.403707518022657) internal successors, (1363), 971 states have internal predecessors, (1363), 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-25 00:00:42,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1363 transitions. [2023-12-25 00:00:42,755 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1363 transitions. Word has length 52 [2023-12-25 00:00:42,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:00:42,757 INFO L495 AbstractCegarLoop]: Abstraction has 972 states and 1363 transitions. [2023-12-25 00:00:42,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 15 states have internal predecessors, (72), 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-25 00:00:42,757 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1363 transitions. [2023-12-25 00:00:42,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-25 00:00:42,761 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:00:42,761 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:00:42,795 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-25 00:00:42,976 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-25 00:00:42,976 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:00:42,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:00:42,977 INFO L85 PathProgramCache]: Analyzing trace with hash -924615465, now seen corresponding path program 1 times [2023-12-25 00:00:42,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:00:42,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [354347076] [2023-12-25 00:00:42,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:00:42,978 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-25 00:00:42,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:00:42,979 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-25 00:00:43,060 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-25 00:00:43,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:00:43,447 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-25 00:00:43,449 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:00:45,736 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:00:45,736 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:00:47,194 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2023-12-25 00:00:47,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:00:47,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [354347076] [2023-12-25 00:00:47,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [354347076] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:00:47,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:00:47,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 4] total 17 [2023-12-25 00:00:47,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282947117] [2023-12-25 00:00:47,194 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:00:47,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 00:00:47,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:00:47,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 00:00:47,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2023-12-25 00:00:47,195 INFO L87 Difference]: Start difference. First operand 972 states and 1363 transitions. Second operand has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 17 states have internal predecessors, (82), 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-25 00:00:52,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:00:56,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:01:00,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:01:01,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:01:01,495 INFO L93 Difference]: Finished difference Result 1902 states and 2725 transitions. [2023-12-25 00:01:01,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-25 00:01:01,508 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 17 states have internal predecessors, (82), 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 61 [2023-12-25 00:01:01,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:01:01,511 INFO L225 Difference]: With dead ends: 1902 [2023-12-25 00:01:01,511 INFO L226 Difference]: Without dead ends: 996 [2023-12-25 00:01:01,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2023-12-25 00:01:01,513 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 9 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2023-12-25 00:01:01,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 88 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 722 Invalid, 3 Unknown, 0 Unchecked, 13.8s Time] [2023-12-25 00:01:01,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2023-12-25 00:01:01,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 996. [2023-12-25 00:01:01,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 995 states have (on average 1.4050251256281407) internal successors, (1398), 995 states have internal predecessors, (1398), 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-25 00:01:01,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1398 transitions. [2023-12-25 00:01:01,575 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1398 transitions. Word has length 61 [2023-12-25 00:01:01,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:01:01,575 INFO L495 AbstractCegarLoop]: Abstraction has 996 states and 1398 transitions. [2023-12-25 00:01:01,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 17 states have internal predecessors, (82), 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-25 00:01:01,575 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1398 transitions. [2023-12-25 00:01:01,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-25 00:01:01,577 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:01:01,577 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:01:01,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-25 00:01:01,793 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-25 00:01:01,794 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:01:01,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:01:01,794 INFO L85 PathProgramCache]: Analyzing trace with hash 591617660, now seen corresponding path program 1 times [2023-12-25 00:01:01,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:01:01,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1106099135] [2023-12-25 00:01:01,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:01:01,794 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-25 00:01:01,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:01:01,796 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-25 00:01:01,852 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-25 00:01:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:01:02,237 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-25 00:01:02,239 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:01:04,749 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:01:04,749 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:01:06,258 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2023-12-25 00:01:06,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:01:06,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1106099135] [2023-12-25 00:01:06,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1106099135] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:01:06,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:01:06,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 4] total 19 [2023-12-25 00:01:06,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305025033] [2023-12-25 00:01:06,259 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:01:06,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-25 00:01:06,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:01:06,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-25 00:01:06,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2023-12-25 00:01:06,260 INFO L87 Difference]: Start difference. First operand 996 states and 1398 transitions. Second operand has 20 states, 20 states have (on average 4.55) internal successors, (91), 19 states have internal predecessors, (91), 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-25 00:01:11,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:01:15,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:01:16,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:01:16,180 INFO L93 Difference]: Finished difference Result 1927 states and 2761 transitions. [2023-12-25 00:01:16,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-25 00:01:16,185 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.55) internal successors, (91), 19 states have internal predecessors, (91), 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 69 [2023-12-25 00:01:16,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:01:16,187 INFO L225 Difference]: With dead ends: 1927 [2023-12-25 00:01:16,187 INFO L226 Difference]: Without dead ends: 997 [2023-12-25 00:01:16,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2023-12-25 00:01:16,189 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 10 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2023-12-25 00:01:16,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 77 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 670 Invalid, 2 Unknown, 0 Unchecked, 9.5s Time] [2023-12-25 00:01:16,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2023-12-25 00:01:16,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 996. [2023-12-25 00:01:16,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 995 states have (on average 1.4030150753768844) internal successors, (1396), 995 states have internal predecessors, (1396), 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-25 00:01:16,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1396 transitions. [2023-12-25 00:01:16,217 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1396 transitions. Word has length 69 [2023-12-25 00:01:16,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:01:16,217 INFO L495 AbstractCegarLoop]: Abstraction has 996 states and 1396 transitions. [2023-12-25 00:01:16,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.55) internal successors, (91), 19 states have internal predecessors, (91), 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-25 00:01:16,217 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1396 transitions. [2023-12-25 00:01:16,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-25 00:01:16,218 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:01:16,218 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:01:16,239 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-25 00:01:16,428 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-25 00:01:16,428 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:01:16,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:01:16,429 INFO L85 PathProgramCache]: Analyzing trace with hash 54248087, now seen corresponding path program 1 times [2023-12-25 00:01:16,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:01:16,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [3884489] [2023-12-25 00:01:16,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:01:16,429 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-25 00:01:16,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:01:16,430 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-25 00:01:16,468 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-25 00:01:16,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:01:16,866 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-25 00:01:16,868 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:01:19,674 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:01:19,674 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:01:21,348 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2023-12-25 00:01:21,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:01:21,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [3884489] [2023-12-25 00:01:21,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [3884489] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:01:21,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:01:21,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 4] total 21 [2023-12-25 00:01:21,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733322749] [2023-12-25 00:01:21,349 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:01:21,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-25 00:01:21,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:01:21,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-25 00:01:21,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2023-12-25 00:01:21,350 INFO L87 Difference]: Start difference. First operand 996 states and 1396 transitions. Second operand has 22 states, 22 states have (on average 4.5) internal successors, (99), 21 states have internal predecessors, (99), 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-25 00:01:27,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:01:27,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:01:27,673 INFO L93 Difference]: Finished difference Result 2358 states and 3372 transitions. [2023-12-25 00:01:27,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-25 00:01:27,679 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.5) internal successors, (99), 21 states have internal predecessors, (99), 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 76 [2023-12-25 00:01:27,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:01:27,690 INFO L225 Difference]: With dead ends: 2358 [2023-12-25 00:01:27,691 INFO L226 Difference]: Without dead ends: 1428 [2023-12-25 00:01:27,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2023-12-25 00:01:27,693 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 8 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2023-12-25 00:01:27,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 108 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 890 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2023-12-25 00:01:27,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2023-12-25 00:01:27,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1427. [2023-12-25 00:01:27,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 1426 states have (on average 1.3688639551192145) internal successors, (1952), 1426 states have internal predecessors, (1952), 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-25 00:01:27,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 1952 transitions. [2023-12-25 00:01:27,822 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 1952 transitions. Word has length 76 [2023-12-25 00:01:27,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:01:27,822 INFO L495 AbstractCegarLoop]: Abstraction has 1427 states and 1952 transitions. [2023-12-25 00:01:27,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.5) internal successors, (99), 21 states have internal predecessors, (99), 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-25 00:01:27,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1952 transitions. [2023-12-25 00:01:27,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-12-25 00:01:27,822 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:01:27,822 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:01:27,870 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 (13)] Forceful destruction successful, exit code 0 [2023-12-25 00:01:28,023 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-25 00:01:28,023 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:01:28,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:01:28,025 INFO L85 PathProgramCache]: Analyzing trace with hash 2029763329, now seen corresponding path program 1 times [2023-12-25 00:01:28,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:01:28,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1281361186] [2023-12-25 00:01:28,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:01:28,025 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-25 00:01:28,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:01:28,026 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-25 00:01:28,052 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-25 00:01:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:01:28,488 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-25 00:01:28,490 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:01:31,536 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 00:01:31,536 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:01:33,298 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2023-12-25 00:01:33,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:01:33,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1281361186] [2023-12-25 00:01:33,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1281361186] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:01:33,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:01:33,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 4] total 23 [2023-12-25 00:01:33,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463028093] [2023-12-25 00:01:33,299 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:01:33,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-25 00:01:33,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:01:33,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-25 00:01:33,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2023-12-25 00:01:33,300 INFO L87 Difference]: Start difference. First operand 1427 states and 1952 transitions. Second operand has 24 states, 24 states have (on average 4.416666666666667) internal successors, (106), 23 states have internal predecessors, (106), 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-25 00:01:35,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:01:35,099 INFO L93 Difference]: Finished difference Result 2110 states and 2944 transitions. [2023-12-25 00:01:35,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-25 00:01:35,105 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.416666666666667) internal successors, (106), 23 states have internal predecessors, (106), 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 82 [2023-12-25 00:01:35,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:01:35,109 INFO L225 Difference]: With dead ends: 2110 [2023-12-25 00:01:35,109 INFO L226 Difference]: Without dead ends: 0 [2023-12-25 00:01:35,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=125, Invalid=931, Unknown=0, NotChecked=0, Total=1056 [2023-12-25 00:01:35,118 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 18 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-25 00:01:35,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 91 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-25 00:01:35,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-25 00:01:35,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-25 00:01:35,136 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-25 00:01:35,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-25 00:01:35,137 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 82 [2023-12-25 00:01:35,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:01:35,137 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-25 00:01:35,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.416666666666667) internal successors, (106), 23 states have internal predecessors, (106), 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-25 00:01:35,137 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-25 00:01:35,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-25 00:01:35,139 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 00:01:35,163 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-25 00:01:35,340 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-25 00:01:35,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-25 00:01:35,602 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 40) no Hoare annotation was computed. [2023-12-25 00:01:35,602 INFO L899 garLoopResultBuilder]: For program point L27(lines 27 40) no Hoare annotation was computed. [2023-12-25 00:01:35,602 INFO L899 garLoopResultBuilder]: For program point L23(lines 23 40) no Hoare annotation was computed. [2023-12-25 00:01:35,602 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 16 45) no Hoare annotation was computed. [2023-12-25 00:01:35,602 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2023-12-25 00:01:35,602 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-25 00:01:35,602 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 40) no Hoare annotation was computed. [2023-12-25 00:01:35,602 INFO L899 garLoopResultBuilder]: For program point L37-2(lines 23 40) no Hoare annotation was computed. [2023-12-25 00:01:35,602 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 40) no Hoare annotation was computed. [2023-12-25 00:01:35,602 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-25 00:01:35,602 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 40) no Hoare annotation was computed. [2023-12-25 00:01:35,602 INFO L899 garLoopResultBuilder]: For program point L25(lines 25 40) no Hoare annotation was computed. [2023-12-25 00:01:35,603 INFO L895 garLoopResultBuilder]: At program point L21-2(lines 21 43) the Hoare annotation is: (= |ULTIMATE.start_main_~l~0#1| (bvadd |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~v6~0#1| |ULTIMATE.start_main_~v5~0#1| |ULTIMATE.start_main_~v4~0#1| |ULTIMATE.start_main_~v3~0#1| |ULTIMATE.start_main_~v2~0#1| |ULTIMATE.start_main_~v1~0#1|)) [2023-12-25 00:01:35,603 INFO L899 garLoopResultBuilder]: For program point L21-3(lines 21 43) no Hoare annotation was computed. [2023-12-25 00:01:35,603 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-25 00:01:35,603 INFO L899 garLoopResultBuilder]: For program point L9(lines 9 11) no Hoare annotation was computed. [2023-12-25 00:01:35,603 INFO L899 garLoopResultBuilder]: For program point L9-2(lines 8 13) no Hoare annotation was computed. [2023-12-25 00:01:35,603 INFO L899 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2023-12-25 00:01:35,603 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 40) no Hoare annotation was computed. [2023-12-25 00:01:35,606 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:01:35,607 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 00:01:35,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 12:01:35 BoogieIcfgContainer [2023-12-25 00:01:35,616 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 00:01:35,616 INFO L158 Benchmark]: Toolchain (without parser) took 414936.98ms. Allocated memory is still 244.3MB. Free memory was 192.4MB in the beginning and 191.3MB in the end (delta: 1.1MB). Peak memory consumption was 128.5MB. Max. memory is 8.0GB. [2023-12-25 00:01:35,616 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 203.4MB. Free memory is still 150.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 00:01:35,616 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.60ms. Allocated memory is still 244.3MB. Free memory was 192.4MB in the beginning and 180.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 00:01:35,617 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.23ms. Allocated memory is still 244.3MB. Free memory was 180.9MB in the beginning and 178.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 00:01:35,617 INFO L158 Benchmark]: Boogie Preprocessor took 56.84ms. Allocated memory is still 244.3MB. Free memory was 178.8MB in the beginning and 177.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 00:01:35,617 INFO L158 Benchmark]: RCFGBuilder took 427.74ms. Allocated memory is still 244.3MB. Free memory was 177.2MB in the beginning and 162.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-25 00:01:35,617 INFO L158 Benchmark]: TraceAbstraction took 414239.79ms. Allocated memory is still 244.3MB. Free memory was 162.0MB in the beginning and 191.3MB in the end (delta: -29.3MB). Peak memory consumption was 98.1MB. Max. memory is 8.0GB. [2023-12-25 00:01:35,618 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.41ms. Allocated memory is still 203.4MB. Free memory is still 150.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 170.60ms. Allocated memory is still 244.3MB. Free memory was 192.4MB in the beginning and 180.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.23ms. Allocated memory is still 244.3MB. Free memory was 180.9MB in the beginning and 178.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.84ms. Allocated memory is still 244.3MB. Free memory was 178.8MB in the beginning and 177.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 427.74ms. Allocated memory is still 244.3MB. Free memory was 177.2MB in the beginning and 162.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 414239.79ms. Allocated memory is still 244.3MB. Free memory was 162.0MB in the beginning and 191.3MB in the end (delta: -29.3MB). Peak memory consumption was 98.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: 10]: 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, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 414.2s, OverallIterations: 13, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 377.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 71 mSolverCounterUnknown, 511 SdHoareTripleChecker+Valid, 360.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 511 mSDsluCounter, 811 SdHoareTripleChecker+Invalid, 356.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 689 mSDsCounter, 152 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5403 IncrementalHoareTripleChecker+Invalid, 5626 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 152 mSolverCounterUnsat, 122 mSDtfsCounter, 5403 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1160 GetRequests, 945 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 23.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1427occurred in iteration=12, InterpolantAutomatonStates: 225, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 60 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 98 NumberOfFragments, 12 HoareAnnotationTreeSize, 1 FormulaSimplifications, 4139 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 1 FormulaSimplificationsInter, 280 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 30.6s InterpolantComputationTime, 564 NumberOfCodeBlocks, 564 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1096 ConstructedInterpolants, 0 QuantifiedInterpolants, 19011 SizeOfPredicates, 99 NumberOfNonLiveVariables, 1131 ConjunctsInSsa, 225 ConjunctsInUnsatCore, 25 InterpolantComputations, 1 PerfectInterpolantSequences, 904/2060 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: 21]: Loop Invariant Derived loop invariant: (l == ((k + j) % 4294967296)) RESULT: Ultimate proved your program to be correct! [2023-12-25 00:01:35,651 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...