/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_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-31.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 03:56:12,667 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 03:56:12,732 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 03:56:12,736 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 03:56:12,737 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 03:56:12,764 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 03:56:12,765 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 03:56:12,765 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 03:56:12,765 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 03:56:12,768 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 03:56:12,768 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 03:56:12,769 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 03:56:12,769 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 03:56:12,770 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 03:56:12,770 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 03:56:12,771 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 03:56:12,771 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 03:56:12,771 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 03:56:12,771 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 03:56:12,771 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 03:56:12,771 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 03:56:12,772 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 03:56:12,772 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 03:56:12,772 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 03:56:12,772 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 03:56:12,772 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 03:56:12,772 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 03:56:12,773 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 03:56:12,773 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 03:56:12,773 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 03:56:12,774 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 03:56:12,774 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 03:56:12,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:56:12,774 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 03:56:12,774 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 03:56:12,775 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 03:56:12,775 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 03:56:12,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 03:56:12,775 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 03:56:12,775 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 03:56:12,775 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 03:56:12,775 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 03:56:12,775 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 03:56:12,776 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-16 03:56:12,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 03:56:12,959 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 03:56:12,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 03:56:12,961 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 03:56:12,961 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 03:56:12,962 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-31.i [2023-12-16 03:56:14,009 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 03:56:14,188 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 03:56:14,189 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-31.i [2023-12-16 03:56:14,197 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/762962eb4/16ff7ab3bdd04f28a3ecf7cbbd326152/FLAG97ae904ac [2023-12-16 03:56:14,212 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/762962eb4/16ff7ab3bdd04f28a3ecf7cbbd326152 [2023-12-16 03:56:14,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 03:56:14,216 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 03:56:14,218 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 03:56:14,218 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 03:56:14,222 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 03:56:14,222 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:56:14" (1/1) ... [2023-12-16 03:56:14,223 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aa3960a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:14, skipping insertion in model container [2023-12-16 03:56:14,223 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:56:14" (1/1) ... [2023-12-16 03:56:14,242 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 03:56:14,377 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-31.i[915,928] [2023-12-16 03:56:14,417 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:56:14,429 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 03:56:14,442 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-31.i[915,928] [2023-12-16 03:56:14,455 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:56:14,465 INFO L206 MainTranslator]: Completed translation [2023-12-16 03:56:14,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:14 WrapperNode [2023-12-16 03:56:14,466 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 03:56:14,467 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 03:56:14,467 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 03:56:14,467 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 03:56:14,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:14" (1/1) ... [2023-12-16 03:56:14,477 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:14" (1/1) ... [2023-12-16 03:56:14,492 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 90 [2023-12-16 03:56:14,493 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 03:56:14,493 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 03:56:14,493 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 03:56:14,493 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 03:56:14,502 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:14" (1/1) ... [2023-12-16 03:56:14,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:14" (1/1) ... [2023-12-16 03:56:14,506 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:14" (1/1) ... [2023-12-16 03:56:14,516 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 03:56:14,516 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:14" (1/1) ... [2023-12-16 03:56:14,516 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:14" (1/1) ... [2023-12-16 03:56:14,519 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:14" (1/1) ... [2023-12-16 03:56:14,521 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:14" (1/1) ... [2023-12-16 03:56:14,522 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:14" (1/1) ... [2023-12-16 03:56:14,523 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:14" (1/1) ... [2023-12-16 03:56:14,524 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 03:56:14,525 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 03:56:14,525 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 03:56:14,525 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 03:56:14,525 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:14" (1/1) ... [2023-12-16 03:56:14,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:56:14,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:56:14,560 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 03:56:14,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 03:56:14,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 03:56:14,584 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 03:56:14,584 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 03:56:14,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 03:56:14,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 03:56:14,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 03:56:14,642 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 03:56:14,644 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 03:56:14,789 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 03:56:14,809 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 03:56:14,810 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 03:56:14,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:56:14 BoogieIcfgContainer [2023-12-16 03:56:14,810 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 03:56:14,812 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 03:56:14,812 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 03:56:14,814 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 03:56:14,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 03:56:14" (1/3) ... [2023-12-16 03:56:14,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63873ecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:56:14, skipping insertion in model container [2023-12-16 03:56:14,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:14" (2/3) ... [2023-12-16 03:56:14,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63873ecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:56:14, skipping insertion in model container [2023-12-16 03:56:14,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:56:14" (3/3) ... [2023-12-16 03:56:14,816 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-31.i [2023-12-16 03:56:14,828 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 03:56:14,828 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 03:56:14,867 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 03:56:14,874 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;@28469729, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 03:56:14,875 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 03:56:14,878 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 03:56:14,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-16 03:56:14,886 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:56:14,887 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:56:14,887 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:56:14,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:56:14,893 INFO L85 PathProgramCache]: Analyzing trace with hash 944822025, now seen corresponding path program 1 times [2023-12-16 03:56:14,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:56:14,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593992698] [2023-12-16 03:56:14,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:56:14,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:56:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:15,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:56:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:15,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:56:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:15,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:56:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:15,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:56:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:15,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:56:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:15,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:56:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:15,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:56:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:15,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:56:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:15,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:56:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:15,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:56:15,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:15,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:56:15,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:15,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:56:15,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:15,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:56:15,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:15,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:56:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:15,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:56:15,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:15,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:56:15,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:15,162 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 03:56:15,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:56:15,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593992698] [2023-12-16 03:56:15,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593992698] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:56:15,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:56:15,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 03:56:15,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303870162] [2023-12-16 03:56:15,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:56:15,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 03:56:15,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:56:15,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 03:56:15,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 03:56:15,221 INFO L87 Difference]: Start difference. First operand has 40 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-16 03:56:15,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:56:15,268 INFO L93 Difference]: Finished difference Result 77 states and 136 transitions. [2023-12-16 03:56:15,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 03:56:15,272 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 95 [2023-12-16 03:56:15,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:56:15,280 INFO L225 Difference]: With dead ends: 77 [2023-12-16 03:56:15,280 INFO L226 Difference]: Without dead ends: 38 [2023-12-16 03:56:15,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 03:56:15,287 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 03:56:15,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:56:15,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-16 03:56:15,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-12-16 03:56:15,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 03:56:15,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 56 transitions. [2023-12-16 03:56:15,321 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 56 transitions. Word has length 95 [2023-12-16 03:56:15,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:56:15,322 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 56 transitions. [2023-12-16 03:56:15,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-16 03:56:15,323 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 56 transitions. [2023-12-16 03:56:15,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-16 03:56:15,342 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:56:15,342 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:56:15,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 03:56:15,342 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:56:15,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:56:15,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1456977673, now seen corresponding path program 1 times [2023-12-16 03:56:15,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:56:15,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330093801] [2023-12-16 03:56:15,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:56:15,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:56:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:15,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:56:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:15,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:56:15,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:15,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:56:15,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:15,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:56:15,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:15,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:56:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:15,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:56:15,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:15,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:56:15,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:15,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:56:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:15,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:56:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:15,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:56:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:15,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:56:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:15,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:56:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:15,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:56:15,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:15,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:56:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:15,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:56:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:15,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:56:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:15,813 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 03:56:15,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:56:15,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330093801] [2023-12-16 03:56:15,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330093801] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:56:15,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:56:15,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 03:56:15,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125393967] [2023-12-16 03:56:15,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:56:15,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 03:56:15,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:56:15,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 03:56:15,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 03:56:15,827 INFO L87 Difference]: Start difference. First operand 38 states and 56 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 03:56:15,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:56:15,905 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2023-12-16 03:56:15,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 03:56:15,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 95 [2023-12-16 03:56:15,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:56:15,909 INFO L225 Difference]: With dead ends: 50 [2023-12-16 03:56:15,909 INFO L226 Difference]: Without dead ends: 48 [2023-12-16 03:56:15,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 03:56:15,911 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 13 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 03:56:15,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 148 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:56:15,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-16 03:56:15,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2023-12-16 03:56:15,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 03:56:15,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2023-12-16 03:56:15,926 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 95 [2023-12-16 03:56:15,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:56:15,928 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2023-12-16 03:56:15,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 03:56:15,928 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2023-12-16 03:56:15,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-16 03:56:15,929 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:56:15,929 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:56:15,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 03:56:15,929 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:56:15,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:56:15,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1457037255, now seen corresponding path program 1 times [2023-12-16 03:56:15,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:56:15,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417253766] [2023-12-16 03:56:15,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:56:15,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:56:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:16,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:56:16,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:16,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:56:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:16,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:56:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:16,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:56:16,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:16,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:56:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:16,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:56:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:16,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:56:16,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:16,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:56:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:16,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:56:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:16,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:56:16,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:16,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:56:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:16,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:56:16,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:16,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:56:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:16,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:56:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:16,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:56:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:16,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:56:16,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:16,152 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 03:56:16,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:56:16,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417253766] [2023-12-16 03:56:16,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417253766] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:56:16,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:56:16,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 03:56:16,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456113523] [2023-12-16 03:56:16,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:56:16,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 03:56:16,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:56:16,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 03:56:16,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 03:56:16,157 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 03:56:16,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:56:16,223 INFO L93 Difference]: Finished difference Result 48 states and 66 transitions. [2023-12-16 03:56:16,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 03:56:16,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 95 [2023-12-16 03:56:16,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:56:16,226 INFO L225 Difference]: With dead ends: 48 [2023-12-16 03:56:16,226 INFO L226 Difference]: Without dead ends: 46 [2023-12-16 03:56:16,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 03:56:16,231 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 8 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 03:56:16,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 148 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:56:16,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-16 03:56:16,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2023-12-16 03:56:16,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 03:56:16,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2023-12-16 03:56:16,243 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 95 [2023-12-16 03:56:16,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:56:16,244 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2023-12-16 03:56:16,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 03:56:16,245 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2023-12-16 03:56:16,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-16 03:56:16,249 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:56:16,249 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:56:16,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 03:56:16,250 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:56:16,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:56:16,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1449410759, now seen corresponding path program 1 times [2023-12-16 03:56:16,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:56:16,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59094615] [2023-12-16 03:56:16,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:56:16,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:56:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:16,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:56:16,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:16,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:56:16,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:16,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:56:16,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:16,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:56:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:16,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:56:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:16,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:56:16,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:16,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:56:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:16,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:56:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:16,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:56:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:16,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:56:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:16,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:56:16,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:16,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:56:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:16,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:56:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:16,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:56:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:16,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:56:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:16,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:56:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:16,493 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 03:56:16,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:56:16,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59094615] [2023-12-16 03:56:16,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59094615] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:56:16,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:56:16,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 03:56:16,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257822794] [2023-12-16 03:56:16,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:56:16,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 03:56:16,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:56:16,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 03:56:16,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 03:56:16,495 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 03:56:16,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:56:16,595 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2023-12-16 03:56:16,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 03:56:16,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 95 [2023-12-16 03:56:16,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:56:16,598 INFO L225 Difference]: With dead ends: 65 [2023-12-16 03:56:16,599 INFO L226 Difference]: Without dead ends: 63 [2023-12-16 03:56:16,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 03:56:16,601 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 30 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 03:56:16,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 207 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 03:56:16,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-12-16 03:56:16,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2023-12-16 03:56:16,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 37 states have internal predecessors, (39), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-16 03:56:16,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 83 transitions. [2023-12-16 03:56:16,610 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 83 transitions. Word has length 95 [2023-12-16 03:56:16,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:56:16,610 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 83 transitions. [2023-12-16 03:56:16,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 03:56:16,611 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2023-12-16 03:56:16,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-16 03:56:16,611 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:56:16,612 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:56:16,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 03:56:16,614 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:56:16,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:56:16,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1449351177, now seen corresponding path program 1 times [2023-12-16 03:56:16,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:56:16,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131540101] [2023-12-16 03:56:16,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:56:16,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:56:16,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:17,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:56:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:17,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:56:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:17,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:56:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:17,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:56:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:17,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:56:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:17,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:56:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:17,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:56:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:17,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:56:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:17,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:56:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:17,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:56:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:17,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:56:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:17,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:56:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:17,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:56:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:17,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:56:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:17,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:56:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:17,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:56:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:56:17,097 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-16 03:56:17,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:56:17,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131540101] [2023-12-16 03:56:17,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131540101] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:56:17,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:56:17,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 03:56:17,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824822216] [2023-12-16 03:56:17,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:56:17,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 03:56:17,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:56:17,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 03:56:17,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 03:56:17,100 INFO L87 Difference]: Start difference. First operand 61 states and 83 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 03:56:17,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:56:17,221 INFO L93 Difference]: Finished difference Result 62 states and 84 transitions. [2023-12-16 03:56:17,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 03:56:17,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 95 [2023-12-16 03:56:17,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:56:17,222 INFO L225 Difference]: With dead ends: 62 [2023-12-16 03:56:17,222 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 03:56:17,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 03:56:17,225 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 8 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 03:56:17,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 143 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:56:17,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 03:56:17,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 03:56:17,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 03:56:17,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 03:56:17,225 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2023-12-16 03:56:17,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:56:17,226 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 03:56:17,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-16 03:56:17,226 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 03:56:17,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 03:56:17,227 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 03:56:17,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 03:56:17,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 03:56:17,250 INFO L902 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: true [2023-12-16 03:56:17,250 INFO L902 garLoopResultBuilder]: At program point L64-1(line 64) the Hoare annotation is: true [2023-12-16 03:56:17,250 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2023-12-16 03:56:17,251 INFO L902 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: true [2023-12-16 03:56:17,251 INFO L902 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: true [2023-12-16 03:56:17,251 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-16 03:56:17,251 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-16 03:56:17,251 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-16 03:56:17,251 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2023-12-16 03:56:17,251 INFO L902 garLoopResultBuilder]: At program point L61(line 61) the Hoare annotation is: true [2023-12-16 03:56:17,251 INFO L902 garLoopResultBuilder]: At program point L61-1(line 61) the Hoare annotation is: true [2023-12-16 03:56:17,251 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-16 03:56:17,251 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2023-12-16 03:56:17,251 INFO L902 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: true [2023-12-16 03:56:17,251 INFO L902 garLoopResultBuilder]: At program point L49-1(line 49) the Hoare annotation is: true [2023-12-16 03:56:17,251 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 03:56:17,251 INFO L899 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2023-12-16 03:56:17,251 INFO L902 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: true [2023-12-16 03:56:17,251 INFO L902 garLoopResultBuilder]: At program point L58-1(line 58) the Hoare annotation is: true [2023-12-16 03:56:17,251 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2023-12-16 03:56:17,252 INFO L902 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: true [2023-12-16 03:56:17,252 INFO L902 garLoopResultBuilder]: At program point L46-1(line 46) the Hoare annotation is: true [2023-12-16 03:56:17,252 INFO L902 garLoopResultBuilder]: At program point L79-2(lines 79 85) the Hoare annotation is: true [2023-12-16 03:56:17,252 INFO L899 garLoopResultBuilder]: For program point L79-3(lines 79 85) no Hoare annotation was computed. [2023-12-16 03:56:17,252 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 03:56:17,252 INFO L902 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: true [2023-12-16 03:56:17,252 INFO L902 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: true [2023-12-16 03:56:17,252 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 42) no Hoare annotation was computed. [2023-12-16 03:56:17,252 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2023-12-16 03:56:17,252 INFO L902 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: true [2023-12-16 03:56:17,252 INFO L902 garLoopResultBuilder]: At program point L55-1(line 55) the Hoare annotation is: true [2023-12-16 03:56:17,252 INFO L899 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2023-12-16 03:56:17,252 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 41) no Hoare annotation was computed. [2023-12-16 03:56:17,252 INFO L899 garLoopResultBuilder]: For program point L39-2(lines 33 43) no Hoare annotation was computed. [2023-12-16 03:56:17,252 INFO L899 garLoopResultBuilder]: For program point L68(lines 44 69) no Hoare annotation was computed. [2023-12-16 03:56:17,253 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 37) no Hoare annotation was computed. [2023-12-16 03:56:17,253 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-16 03:56:17,253 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-16 03:56:17,253 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-16 03:56:17,253 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-16 03:56:17,255 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-16 03:56:17,257 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 03:56:17,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 03:56:17 BoogieIcfgContainer [2023-12-16 03:56:17,264 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 03:56:17,264 INFO L158 Benchmark]: Toolchain (without parser) took 3048.62ms. Allocated memory was 206.6MB in the beginning and 297.8MB in the end (delta: 91.2MB). Free memory was 161.9MB in the beginning and 253.0MB in the end (delta: -91.2MB). Peak memory consumption was 1.6MB. Max. memory is 8.0GB. [2023-12-16 03:56:17,264 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 206.6MB. Free memory is still 163.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 03:56:17,265 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.48ms. Allocated memory is still 206.6MB. Free memory was 161.9MB in the beginning and 150.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 03:56:17,265 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.84ms. Allocated memory is still 206.6MB. Free memory was 150.4MB in the beginning and 148.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 03:56:17,265 INFO L158 Benchmark]: Boogie Preprocessor took 31.06ms. Allocated memory is still 206.6MB. Free memory was 148.3MB in the beginning and 146.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 03:56:17,265 INFO L158 Benchmark]: RCFGBuilder took 285.36ms. Allocated memory is still 206.6MB. Free memory was 146.2MB in the beginning and 131.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-16 03:56:17,265 INFO L158 Benchmark]: TraceAbstraction took 2452.25ms. Allocated memory was 206.6MB in the beginning and 297.8MB in the end (delta: 91.2MB). Free memory was 130.9MB in the beginning and 253.0MB in the end (delta: -122.1MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 03:56:17,267 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.10ms. Allocated memory is still 206.6MB. Free memory is still 163.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 248.48ms. Allocated memory is still 206.6MB. Free memory was 161.9MB in the beginning and 150.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.84ms. Allocated memory is still 206.6MB. Free memory was 150.4MB in the beginning and 148.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.06ms. Allocated memory is still 206.6MB. Free memory was 148.3MB in the beginning and 146.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 285.36ms. Allocated memory is still 206.6MB. Free memory was 146.2MB in the beginning and 131.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 2452.25ms. Allocated memory was 206.6MB in the beginning and 297.8MB in the end (delta: 91.2MB). Free memory was 130.9MB in the beginning and 253.0MB in the end (delta: -122.1MB). There was no memory consumed. 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: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 59 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 59 mSDsluCounter, 699 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 424 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 146 IncrementalHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 275 mSDtfsCounter, 146 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=4, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 55 PreInvPairs, 81 NumberOfFragments, 18 HoareAnnotationTreeSize, 55 FormulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FormulaSimplificationsInter, 94 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 475 NumberOfCodeBlocks, 475 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 470 ConstructedInterpolants, 0 QuantifiedInterpolants, 898 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 2400/2400 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: 79]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-12-16 03:56:17,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...