/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 true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 13:27:23,762 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 13:27:23,827 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-19 13:27:23,832 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 13:27:23,833 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 13:27:23,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 13:27:23,854 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 13:27:23,855 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 13:27:23,855 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 13:27:23,858 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 13:27:23,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 13:27:23,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 13:27:23,859 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 13:27:23,860 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 13:27:23,860 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 13:27:23,860 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 13:27:23,860 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 13:27:23,860 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 13:27:23,860 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 13:27:23,860 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 13:27:23,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 13:27:23,861 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 13:27:23,862 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 13:27:23,862 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 13:27:23,862 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 13:27:23,862 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 13:27:23,862 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 13:27:23,862 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 13:27:23,863 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 13:27:23,863 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 13:27:23,864 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 13:27:23,864 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 13:27:23,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 13:27:23,864 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 13:27:23,864 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 13:27:23,864 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 13:27:23,864 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 13:27:23,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 13:27:23,864 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 13:27:23,865 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 13:27:23,865 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 13:27:23,865 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 13:27:23,865 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 13:27:23,865 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 -> true [2023-12-19 13:27:24,045 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 13:27:24,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 13:27:24,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 13:27:24,063 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 13:27:24,064 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 13:27:24,064 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-5.i [2023-12-19 13:27:25,047 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 13:27:25,192 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 13:27:25,192 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-5.i [2023-12-19 13:27:25,199 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/965f8beaf/9ef71917ca814c63a42ae4977c485f4b/FLAG8511d8095 [2023-12-19 13:27:25,220 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/965f8beaf/9ef71917ca814c63a42ae4977c485f4b [2023-12-19 13:27:25,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 13:27:25,223 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 13:27:25,226 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 13:27:25,226 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 13:27:25,229 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 13:27:25,230 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:27:25" (1/1) ... [2023-12-19 13:27:25,231 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a886a02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:27:25, skipping insertion in model container [2023-12-19 13:27:25,231 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:27:25" (1/1) ... [2023-12-19 13:27:25,258 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 13:27:25,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_amount25_file-5.i[914,927] [2023-12-19 13:27:25,429 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 13:27:25,442 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 13:27:25,451 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_amount25_file-5.i[914,927] [2023-12-19 13:27:25,485 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 13:27:25,496 INFO L206 MainTranslator]: Completed translation [2023-12-19 13:27:25,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:27:25 WrapperNode [2023-12-19 13:27:25,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 13:27:25,497 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 13:27:25,498 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 13:27:25,498 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 13:27:25,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:27:25" (1/1) ... [2023-12-19 13:27:25,513 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:27:25" (1/1) ... [2023-12-19 13:27:25,540 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2023-12-19 13:27:25,541 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 13:27:25,541 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 13:27:25,541 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 13:27:25,541 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 13:27:25,548 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:27:25" (1/1) ... [2023-12-19 13:27:25,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:27:25" (1/1) ... [2023-12-19 13:27:25,550 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:27:25" (1/1) ... [2023-12-19 13:27:25,567 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-19 13:27:25,567 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:27:25" (1/1) ... [2023-12-19 13:27:25,567 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:27:25" (1/1) ... [2023-12-19 13:27:25,571 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:27:25" (1/1) ... [2023-12-19 13:27:25,573 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:27:25" (1/1) ... [2023-12-19 13:27:25,574 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:27:25" (1/1) ... [2023-12-19 13:27:25,575 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:27:25" (1/1) ... [2023-12-19 13:27:25,577 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 13:27:25,578 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 13:27:25,578 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 13:27:25,578 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 13:27:25,578 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:27:25" (1/1) ... [2023-12-19 13:27:25,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 13:27:25,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 13:27:25,602 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-19 13:27:25,619 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-19 13:27:25,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 13:27:25,624 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 13:27:25,624 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 13:27:25,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 13:27:25,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 13:27:25,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 13:27:25,675 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 13:27:25,676 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 13:27:25,876 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 13:27:25,898 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 13:27:25,898 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 13:27:25,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:27:25 BoogieIcfgContainer [2023-12-19 13:27:25,898 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 13:27:25,900 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 13:27:25,900 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 13:27:25,902 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 13:27:25,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 01:27:25" (1/3) ... [2023-12-19 13:27:25,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2803a9fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:27:25, skipping insertion in model container [2023-12-19 13:27:25,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:27:25" (2/3) ... [2023-12-19 13:27:25,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2803a9fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:27:25, skipping insertion in model container [2023-12-19 13:27:25,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:27:25" (3/3) ... [2023-12-19 13:27:25,904 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-5.i [2023-12-19 13:27:25,915 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 13:27:25,916 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 13:27:25,956 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 13:27:25,961 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;@6b7a8b9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 13:27:25,962 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 13:27:25,968 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-19 13:27:25,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-19 13:27:25,977 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 13:27:25,978 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 13:27:25,978 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 13:27:25,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 13:27:25,984 INFO L85 PathProgramCache]: Analyzing trace with hash 603172873, now seen corresponding path program 1 times [2023-12-19 13:27:25,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 13:27:25,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176779667] [2023-12-19 13:27:25,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:27:25,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 13:27:26,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:26,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 13:27:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:26,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 13:27:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:26,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 13:27:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:26,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 13:27:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:26,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 13:27:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:26,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 13:27:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:26,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 13:27:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:26,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 13:27:26,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:26,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 13:27:26,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:26,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 13:27:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:26,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 13:27:26,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:26,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 13:27:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:26,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 13:27:26,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:26,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 13:27:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:26,280 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-19 13:27:26,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 13:27:26,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176779667] [2023-12-19 13:27:26,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176779667] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 13:27:26,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 13:27:26,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 13:27:26,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560585003] [2023-12-19 13:27:26,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 13:27:26,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 13:27:26,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 13:27:26,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 13:27:26,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 13:27:26,314 INFO L87 Difference]: Start difference. First operand has 43 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-19 13:27:26,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 13:27:26,360 INFO L93 Difference]: Finished difference Result 83 states and 142 transitions. [2023-12-19 13:27:26,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 13:27:26,365 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 89 [2023-12-19 13:27:26,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 13:27:26,370 INFO L225 Difference]: With dead ends: 83 [2023-12-19 13:27:26,370 INFO L226 Difference]: Without dead ends: 41 [2023-12-19 13:27:26,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-19 13:27:26,375 INFO L413 NwaCegarLoop]: 57 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, 57 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-19 13:27:26,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 13:27:26,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-19 13:27:26,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-12-19 13:27:26,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-19 13:27:26,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 60 transitions. [2023-12-19 13:27:26,405 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 60 transitions. Word has length 89 [2023-12-19 13:27:26,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 13:27:26,405 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 60 transitions. [2023-12-19 13:27:26,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-19 13:27:26,405 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 60 transitions. [2023-12-19 13:27:26,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-19 13:27:26,408 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 13:27:26,408 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 13:27:26,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 13:27:26,408 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 13:27:26,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 13:27:26,409 INFO L85 PathProgramCache]: Analyzing trace with hash 425733833, now seen corresponding path program 1 times [2023-12-19 13:27:26,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 13:27:26,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876720356] [2023-12-19 13:27:26,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:27:26,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 13:27:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:27,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 13:27:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:27,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 13:27:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:27,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 13:27:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:27,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 13:27:27,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:27,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 13:27:27,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:27,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 13:27:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:27,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 13:27:27,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:27,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 13:27:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:27,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 13:27:27,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:27,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 13:27:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:27,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 13:27:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:27,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 13:27:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:27,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 13:27:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:27,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 13:27:27,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:27,228 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-19 13:27:27,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 13:27:27,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876720356] [2023-12-19 13:27:27,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876720356] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 13:27:27,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 13:27:27,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 13:27:27,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301431469] [2023-12-19 13:27:27,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 13:27:27,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 13:27:27,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 13:27:27,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 13:27:27,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-19 13:27:27,234 INFO L87 Difference]: Start difference. First operand 41 states and 60 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 13:27:27,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 13:27:27,350 INFO L93 Difference]: Finished difference Result 110 states and 159 transitions. [2023-12-19 13:27:27,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 13:27:27,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 89 [2023-12-19 13:27:27,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 13:27:27,359 INFO L225 Difference]: With dead ends: 110 [2023-12-19 13:27:27,359 INFO L226 Difference]: Without dead ends: 70 [2023-12-19 13:27:27,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-19 13:27:27,361 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 36 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 13:27:27,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 144 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 13:27:27,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-19 13:27:27,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2023-12-19 13:27:27,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 40 states have (on average 1.225) internal successors, (49), 41 states have internal predecessors, (49), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-19 13:27:27,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 97 transitions. [2023-12-19 13:27:27,388 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 97 transitions. Word has length 89 [2023-12-19 13:27:27,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 13:27:27,389 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 97 transitions. [2023-12-19 13:27:27,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 13:27:27,390 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 97 transitions. [2023-12-19 13:27:27,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-19 13:27:27,393 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 13:27:27,394 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 13:27:27,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 13:27:27,394 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 13:27:27,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 13:27:27,394 INFO L85 PathProgramCache]: Analyzing trace with hash 425793415, now seen corresponding path program 1 times [2023-12-19 13:27:27,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 13:27:27,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552081008] [2023-12-19 13:27:27,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:27:27,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 13:27:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:28,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 13:27:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:28,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 13:27:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:28,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 13:27:28,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:28,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 13:27:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:28,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 13:27:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:28,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 13:27:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:28,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 13:27:28,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:28,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 13:27:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:28,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 13:27:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:28,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 13:27:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:28,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 13:27:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:28,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 13:27:28,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:28,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 13:27:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:28,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 13:27:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:28,360 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-19 13:27:28,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 13:27:28,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552081008] [2023-12-19 13:27:28,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552081008] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 13:27:28,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 13:27:28,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 13:27:28,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707126291] [2023-12-19 13:27:28,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 13:27:28,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 13:27:28,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 13:27:28,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 13:27:28,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-19 13:27:28,364 INFO L87 Difference]: Start difference. First operand 67 states and 97 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 13:27:28,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 13:27:28,765 INFO L93 Difference]: Finished difference Result 161 states and 221 transitions. [2023-12-19 13:27:28,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-19 13:27:28,765 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 89 [2023-12-19 13:27:28,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 13:27:28,770 INFO L225 Difference]: With dead ends: 161 [2023-12-19 13:27:28,771 INFO L226 Difference]: Without dead ends: 159 [2023-12-19 13:27:28,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2023-12-19 13:27:28,774 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 81 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 13:27:28,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 285 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 13:27:28,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-12-19 13:27:28,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 141. [2023-12-19 13:27:28,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 86 states have (on average 1.186046511627907) internal successors, (102), 88 states have internal predecessors, (102), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-19 13:27:28,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 198 transitions. [2023-12-19 13:27:28,805 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 198 transitions. Word has length 89 [2023-12-19 13:27:28,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 13:27:28,806 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 198 transitions. [2023-12-19 13:27:28,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 13:27:28,806 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 198 transitions. [2023-12-19 13:27:28,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-19 13:27:28,807 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 13:27:28,807 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 13:27:28,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 13:27:28,808 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 13:27:28,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 13:27:28,808 INFO L85 PathProgramCache]: Analyzing trace with hash 483051717, now seen corresponding path program 1 times [2023-12-19 13:27:28,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 13:27:28,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576743984] [2023-12-19 13:27:28,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:27:28,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 13:27:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:28,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 13:27:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:28,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 13:27:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:28,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 13:27:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:28,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 13:27:28,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:28,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 13:27:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:28,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 13:27:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:28,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 13:27:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:28,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 13:27:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:28,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 13:27:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:28,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 13:27:28,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:28,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 13:27:28,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:28,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 13:27:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:28,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 13:27:28,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:28,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 13:27:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:28,873 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-19 13:27:28,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 13:27:28,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576743984] [2023-12-19 13:27:28,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576743984] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 13:27:28,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 13:27:28,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 13:27:28,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799112743] [2023-12-19 13:27:28,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 13:27:28,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 13:27:28,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 13:27:28,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 13:27:28,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 13:27:28,876 INFO L87 Difference]: Start difference. First operand 141 states and 198 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 13:27:28,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 13:27:28,918 INFO L93 Difference]: Finished difference Result 277 states and 390 transitions. [2023-12-19 13:27:28,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 13:27:28,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 89 [2023-12-19 13:27:28,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 13:27:28,920 INFO L225 Difference]: With dead ends: 277 [2023-12-19 13:27:28,920 INFO L226 Difference]: Without dead ends: 137 [2023-12-19 13:27:28,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 13:27:28,922 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 13:27:28,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 105 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 13:27:28,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-12-19 13:27:28,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2023-12-19 13:27:28,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 84 states have internal predecessors, (93), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-19 13:27:28,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 189 transitions. [2023-12-19 13:27:28,943 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 189 transitions. Word has length 89 [2023-12-19 13:27:28,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 13:27:28,944 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 189 transitions. [2023-12-19 13:27:28,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 13:27:28,944 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 189 transitions. [2023-12-19 13:27:28,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-19 13:27:28,945 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 13:27:28,945 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 13:27:28,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 13:27:28,945 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 13:27:28,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 13:27:28,945 INFO L85 PathProgramCache]: Analyzing trace with hash -383612793, now seen corresponding path program 1 times [2023-12-19 13:27:28,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 13:27:28,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948833268] [2023-12-19 13:27:28,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:27:28,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 13:27:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:28,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 13:27:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:28,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 13:27:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:28,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 13:27:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:28,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 13:27:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:28,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 13:27:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:28,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 13:27:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:28,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 13:27:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:29,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 13:27:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:29,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 13:27:29,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:29,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 13:27:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:29,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 13:27:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:29,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 13:27:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:29,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 13:27:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:29,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 13:27:29,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:29,010 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-19 13:27:29,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 13:27:29,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948833268] [2023-12-19 13:27:29,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948833268] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 13:27:29,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 13:27:29,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 13:27:29,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271562240] [2023-12-19 13:27:29,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 13:27:29,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 13:27:29,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 13:27:29,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 13:27:29,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 13:27:29,011 INFO L87 Difference]: Start difference. First operand 137 states and 189 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 13:27:29,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 13:27:29,034 INFO L93 Difference]: Finished difference Result 244 states and 334 transitions. [2023-12-19 13:27:29,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 13:27:29,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 89 [2023-12-19 13:27:29,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 13:27:29,036 INFO L225 Difference]: With dead ends: 244 [2023-12-19 13:27:29,036 INFO L226 Difference]: Without dead ends: 108 [2023-12-19 13:27:29,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 13:27:29,037 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 5 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 13:27:29,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 100 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 13:27:29,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-12-19 13:27:29,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2023-12-19 13:27:29,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 64 states have internal predecessors, (68), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-19 13:27:29,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 144 transitions. [2023-12-19 13:27:29,055 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 144 transitions. Word has length 89 [2023-12-19 13:27:29,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 13:27:29,056 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 144 transitions. [2023-12-19 13:27:29,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 13:27:29,056 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 144 transitions. [2023-12-19 13:27:29,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-19 13:27:29,057 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 13:27:29,057 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 13:27:29,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 13:27:29,057 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 13:27:29,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 13:27:29,057 INFO L85 PathProgramCache]: Analyzing trace with hash 647397850, now seen corresponding path program 1 times [2023-12-19 13:27:29,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 13:27:29,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782063106] [2023-12-19 13:27:29,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:27:29,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 13:27:29,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:31,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 13:27:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:31,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 13:27:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:31,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 13:27:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:31,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 13:27:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:31,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 13:27:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:31,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 13:27:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:31,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 13:27:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:31,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 13:27:31,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:31,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 13:27:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:31,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 13:27:31,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:31,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 13:27:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:31,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 13:27:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:31,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 13:27:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:31,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 13:27:31,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:31,340 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-19 13:27:31,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 13:27:31,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782063106] [2023-12-19 13:27:31,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782063106] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 13:27:31,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 13:27:31,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 13:27:31,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430713721] [2023-12-19 13:27:31,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 13:27:31,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 13:27:31,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 13:27:31,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 13:27:31,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-19 13:27:31,342 INFO L87 Difference]: Start difference. First operand 108 states and 144 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 13:27:31,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 13:27:31,532 INFO L93 Difference]: Finished difference Result 127 states and 163 transitions. [2023-12-19 13:27:31,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 13:27:31,534 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 90 [2023-12-19 13:27:31,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 13:27:31,536 INFO L225 Difference]: With dead ends: 127 [2023-12-19 13:27:31,536 INFO L226 Difference]: Without dead ends: 125 [2023-12-19 13:27:31,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-19 13:27:31,537 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 29 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 13:27:31,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 224 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 13:27:31,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-12-19 13:27:31,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 116. [2023-12-19 13:27:31,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 72 states have internal predecessors, (76), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-19 13:27:31,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 152 transitions. [2023-12-19 13:27:31,553 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 152 transitions. Word has length 90 [2023-12-19 13:27:31,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 13:27:31,554 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 152 transitions. [2023-12-19 13:27:31,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 13:27:31,554 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 152 transitions. [2023-12-19 13:27:31,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-19 13:27:31,555 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 13:27:31,555 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 13:27:31,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 13:27:31,556 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 13:27:31,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 13:27:31,556 INFO L85 PathProgramCache]: Analyzing trace with hash 2012962002, now seen corresponding path program 1 times [2023-12-19 13:27:31,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 13:27:31,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317597358] [2023-12-19 13:27:31,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:27:31,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 13:27:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:32,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 13:27:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:32,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 13:27:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:32,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 13:27:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:32,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 13:27:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:32,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 13:27:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:32,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 13:27:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:32,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 13:27:32,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:32,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 13:27:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:32,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 13:27:32,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:32,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 13:27:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:32,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 13:27:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:32,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 13:27:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:32,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 13:27:32,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:32,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 13:27:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:32,950 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-19 13:27:32,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 13:27:32,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317597358] [2023-12-19 13:27:32,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317597358] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 13:27:32,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 13:27:32,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 13:27:32,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543073698] [2023-12-19 13:27:32,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 13:27:32,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 13:27:32,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 13:27:32,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 13:27:32,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-12-19 13:27:32,952 INFO L87 Difference]: Start difference. First operand 116 states and 152 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 13:27:33,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 13:27:33,141 INFO L93 Difference]: Finished difference Result 138 states and 174 transitions. [2023-12-19 13:27:33,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 13:27:33,142 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 91 [2023-12-19 13:27:33,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 13:27:33,142 INFO L225 Difference]: With dead ends: 138 [2023-12-19 13:27:33,143 INFO L226 Difference]: Without dead ends: 136 [2023-12-19 13:27:33,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2023-12-19 13:27:33,143 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 35 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 13:27:33,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 237 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 13:27:33,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-12-19 13:27:33,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 116. [2023-12-19 13:27:33,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 72 states have internal predecessors, (76), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-19 13:27:33,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 152 transitions. [2023-12-19 13:27:33,157 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 152 transitions. Word has length 91 [2023-12-19 13:27:33,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 13:27:33,157 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 152 transitions. [2023-12-19 13:27:33,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 13:27:33,157 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 152 transitions. [2023-12-19 13:27:33,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2023-12-19 13:27:33,158 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 13:27:33,158 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 13:27:33,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 13:27:33,159 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 13:27:33,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 13:27:33,159 INFO L85 PathProgramCache]: Analyzing trace with hash -678138280, now seen corresponding path program 1 times [2023-12-19 13:27:33,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 13:27:33,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935363212] [2023-12-19 13:27:33,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:27:33,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 13:27:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:34,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 13:27:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:34,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 13:27:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:34,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 13:27:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:34,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 13:27:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:34,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 13:27:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:34,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 13:27:34,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:34,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 13:27:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:34,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 13:27:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:34,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 13:27:34,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:34,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 13:27:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:34,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 13:27:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:34,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 13:27:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:34,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 13:27:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:34,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-19 13:27:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:34,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-19 13:27:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:34,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-19 13:27:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:34,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-19 13:27:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:34,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-19 13:27:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:34,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 13:27:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:34,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-19 13:27:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:34,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-19 13:27:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:34,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-19 13:27:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:34,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-19 13:27:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:34,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-19 13:27:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:34,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-19 13:27:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:34,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-12-19 13:27:34,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:34,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-12-19 13:27:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:34,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2023-12-19 13:27:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:34,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1543 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1535 trivial. 0 not checked. [2023-12-19 13:27:34,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 13:27:34,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935363212] [2023-12-19 13:27:34,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935363212] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 13:27:34,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323345468] [2023-12-19 13:27:34,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:27:34,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 13:27:34,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 13:27:34,467 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 13:27:34,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-19 13:27:34,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:27:34,563 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-19 13:27:34,582 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 13:27:55,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1543 backedges. 180 proven. 538 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2023-12-19 13:27:55,095 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 13:27:58,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1543 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1535 trivial. 0 not checked. [2023-12-19 13:27:58,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323345468] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-19 13:27:58,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-19 13:27:58,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7, 14] total 25 [2023-12-19 13:27:58,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556595976] [2023-12-19 13:27:58,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 13:27:58,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 13:27:58,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 13:27:58,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 13:27:58,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2023-12-19 13:27:58,934 INFO L87 Difference]: Start difference. First operand 116 states and 152 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 13:27:59,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 13:27:59,122 INFO L93 Difference]: Finished difference Result 128 states and 167 transitions. [2023-12-19 13:27:59,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 13:27:59,122 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 178 [2023-12-19 13:27:59,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 13:27:59,124 INFO L225 Difference]: With dead ends: 128 [2023-12-19 13:27:59,124 INFO L226 Difference]: Without dead ends: 0 [2023-12-19 13:27:59,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=665, Unknown=0, NotChecked=0, Total=812 [2023-12-19 13:27:59,126 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 52 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 13:27:59,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 234 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 13:27:59,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-19 13:27:59,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-19 13:27:59,127 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-19 13:27:59,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-19 13:27:59,127 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 178 [2023-12-19 13:27:59,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 13:27:59,127 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-19 13:27:59,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-19 13:27:59,127 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-19 13:27:59,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-19 13:27:59,129 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 13:27:59,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-19 13:27:59,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 13:27:59,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-19 13:27:59,929 INFO L895 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (let ((.cse3 (div ~var_1_8~0 256))) (let ((.cse0 (* .cse3 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= 0 .cse3) (<= ~var_1_8~0 10) (= (* (div ~var_1_9~0 256) 256) ~var_1_9~0)) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)))))) [2023-12-19 13:27:59,929 INFO L895 garLoopResultBuilder]: At program point L64-1(line 64) the Hoare annotation is: (let ((.cse3 (div ~var_1_8~0 256))) (let ((.cse0 (* .cse3 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= 0 .cse3) (<= ~var_1_8~0 10) (= (* (div ~var_1_9~0 256) 256) ~var_1_9~0)) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)))))) [2023-12-19 13:27:59,929 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-19 13:27:59,929 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-19 13:27:59,929 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-19 13:27:59,929 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-12-19 13:27:59,929 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (let ((.cse3 (div ~var_1_8~0 256))) (let ((.cse0 (* .cse3 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)) (and (<= 0 .cse3) (<= ~var_1_8~0 10)))))) [2023-12-19 13:27:59,929 INFO L895 garLoopResultBuilder]: At program point L73-1(line 73) the Hoare annotation is: (let ((.cse3 (div ~var_1_8~0 256))) (let ((.cse0 (* .cse3 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)) (and (<= 0 .cse3) (<= ~var_1_8~0 10)))))) [2023-12-19 13:27:59,929 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 44) no Hoare annotation was computed. [2023-12-19 13:27:59,929 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 61) no Hoare annotation was computed. [2023-12-19 13:27:59,930 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2023-12-19 13:27:59,930 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-19 13:27:59,930 INFO L902 garLoopResultBuilder]: At program point L82(line 82) the Hoare annotation is: true [2023-12-19 13:27:59,930 INFO L902 garLoopResultBuilder]: At program point L82-1(line 82) the Hoare annotation is: true [2023-12-19 13:27:59,930 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-12-19 13:27:59,930 INFO L895 garLoopResultBuilder]: At program point L70(line 70) the Hoare annotation is: (let ((.cse3 (div ~var_1_8~0 256))) (let ((.cse0 (* .cse3 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)) (and (<= 0 .cse3) (<= ~var_1_8~0 10)))))) [2023-12-19 13:27:59,930 INFO L895 garLoopResultBuilder]: At program point L70-1(line 70) the Hoare annotation is: (let ((.cse3 (div ~var_1_8~0 256))) (let ((.cse0 (* .cse3 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)) (and (<= 0 .cse3) (<= ~var_1_8~0 10)))))) [2023-12-19 13:27:59,930 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-19 13:27:59,930 INFO L895 garLoopResultBuilder]: At program point L95-2(lines 95 101) the Hoare annotation is: (let ((.cse3 (div ~var_1_8~0 256))) (let ((.cse0 (* .cse3 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= 0 .cse3) (<= ~var_1_8~0 10) (= (* (div ~var_1_9~0 256) 256) ~var_1_9~0)) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)))))) [2023-12-19 13:27:59,930 INFO L899 garLoopResultBuilder]: For program point L95-3(lines 95 101) no Hoare annotation was computed. [2023-12-19 13:27:59,930 INFO L899 garLoopResultBuilder]: For program point L58(lines 58 60) no Hoare annotation was computed. [2023-12-19 13:27:59,930 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 56) no Hoare annotation was computed. [2023-12-19 13:27:59,930 INFO L899 garLoopResultBuilder]: For program point L54-2(lines 54 56) no Hoare annotation was computed. [2023-12-19 13:27:59,930 INFO L899 garLoopResultBuilder]: For program point L83(lines 62 84) no Hoare annotation was computed. [2023-12-19 13:27:59,931 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 52) no Hoare annotation was computed. [2023-12-19 13:27:59,931 INFO L899 garLoopResultBuilder]: For program point L50-2(lines 50 52) no Hoare annotation was computed. [2023-12-19 13:27:59,931 INFO L902 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: true [2023-12-19 13:27:59,931 INFO L902 garLoopResultBuilder]: At program point L79-1(line 79) the Hoare annotation is: true [2023-12-19 13:27:59,931 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-19 13:27:59,931 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2023-12-19 13:27:59,931 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 48) no Hoare annotation was computed. [2023-12-19 13:27:59,931 INFO L899 garLoopResultBuilder]: For program point L38-1(lines 38 48) no Hoare annotation was computed. [2023-12-19 13:27:59,931 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (let ((.cse3 (div ~var_1_8~0 256))) (let ((.cse0 (* .cse3 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= 0 .cse3) (<= ~var_1_8~0 10) (= (* (div ~var_1_9~0 256) 256) ~var_1_9~0)) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)))))) [2023-12-19 13:27:59,931 INFO L895 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (let ((.cse3 (div ~var_1_8~0 256))) (let ((.cse0 (* .cse3 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= 0 .cse3) (<= ~var_1_8~0 10) (= (* (div ~var_1_9~0 256) 256) ~var_1_9~0)) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)))))) [2023-12-19 13:27:59,931 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2023-12-19 13:27:59,931 INFO L895 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (let ((.cse3 (div ~var_1_8~0 256))) (let ((.cse0 (* .cse3 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)) (and (<= 0 .cse3) (<= ~var_1_8~0 10)))))) [2023-12-19 13:27:59,931 INFO L895 garLoopResultBuilder]: At program point L76-1(line 76) the Hoare annotation is: (let ((.cse3 (div ~var_1_8~0 256))) (let ((.cse0 (* .cse3 256))) (let ((.cse1 (+ .cse0 ~var_1_12~0)) (.cse2 (* 256 (div ~var_1_12~0 256)))) (or (and (= (+ .cse0 ~var_1_15~0) ~var_1_8~0) (<= .cse1 (+ .cse2 ~var_1_8~0))) (and (<= (+ .cse2 ~var_1_8~0 1) .cse1) (= (+ .cse2 ~var_1_15~0) ~var_1_12~0)) (and (<= 0 .cse3) (<= ~var_1_8~0 10)))))) [2023-12-19 13:27:59,931 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 47) no Hoare annotation was computed. [2023-12-19 13:27:59,931 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2023-12-19 13:27:59,932 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-19 13:27:59,932 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-19 13:27:59,932 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-19 13:27:59,932 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-19 13:27:59,934 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 13:27:59,935 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 13:27:59,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 01:27:59 BoogieIcfgContainer [2023-12-19 13:27:59,944 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 13:27:59,944 INFO L158 Benchmark]: Toolchain (without parser) took 34720.66ms. Allocated memory was 201.3MB in the beginning and 798.0MB in the end (delta: 596.6MB). Free memory was 163.5MB in the beginning and 452.7MB in the end (delta: -289.1MB). Peak memory consumption was 308.5MB. Max. memory is 8.0GB. [2023-12-19 13:27:59,944 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 201.3MB. Free memory is still 156.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 13:27:59,944 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.23ms. Allocated memory is still 201.3MB. Free memory was 163.1MB in the beginning and 150.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-19 13:27:59,944 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.18ms. Allocated memory is still 201.3MB. Free memory was 150.5MB in the beginning and 147.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 13:27:59,945 INFO L158 Benchmark]: Boogie Preprocessor took 36.02ms. Allocated memory is still 201.3MB. Free memory was 147.4MB in the beginning and 143.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-19 13:27:59,945 INFO L158 Benchmark]: RCFGBuilder took 320.88ms. Allocated memory is still 201.3MB. Free memory was 143.2MB in the beginning and 125.0MB in the end (delta: 18.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-19 13:27:59,945 INFO L158 Benchmark]: TraceAbstraction took 34043.70ms. Allocated memory was 201.3MB in the beginning and 798.0MB in the end (delta: 596.6MB). Free memory was 123.9MB in the beginning and 452.7MB in the end (delta: -328.8MB). Peak memory consumption was 268.7MB. Max. memory is 8.0GB. [2023-12-19 13:27:59,946 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.48ms. Allocated memory is still 201.3MB. Free memory is still 156.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 271.23ms. Allocated memory is still 201.3MB. Free memory was 163.1MB in the beginning and 150.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.18ms. Allocated memory is still 201.3MB. Free memory was 150.5MB in the beginning and 147.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.02ms. Allocated memory is still 201.3MB. Free memory was 147.4MB in the beginning and 143.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 320.88ms. Allocated memory is still 201.3MB. Free memory was 143.2MB in the beginning and 125.0MB in the end (delta: 18.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 34043.70ms. Allocated memory was 201.3MB in the beginning and 798.0MB in the end (delta: 596.6MB). Free memory was 123.9MB in the beginning and 452.7MB in the end (delta: -328.8MB). Peak memory consumption was 268.7MB. 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, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.0s, OverallIterations: 8, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 242 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 242 mSDsluCounter, 1386 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 886 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 549 IncrementalHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 500 mSDtfsCounter, 549 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 701 GetRequests, 632 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=3, InterpolantAutomatonStates: 56, 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, 8 MinimizatonAttempts, 50 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 181 PreInvPairs, 227 NumberOfFragments, 711 HoareAnnotationTreeSize, 181 FormulaSimplifications, 386 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 16 FormulaSimplificationsInter, 3482 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 31.2s InterpolantComputationTime, 982 NumberOfCodeBlocks, 982 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1150 ConstructedInterpolants, 0 QuantifiedInterpolants, 5766 SizeOfPredicates, 40 NumberOfNonLiveVariables, 385 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 6638/7177 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: 95]: Loop Invariant Derived loop invariant: (((((((var_1_8 / 256) * 256) + var_1_15) == var_1_8) && ((((var_1_8 / 256) * 256) + var_1_12) <= ((256 * (var_1_12 / 256)) + var_1_8))) || (((0 <= (var_1_8 / 256)) && (var_1_8 <= 10)) && (((var_1_9 / 256) * 256) == var_1_9))) || (((((256 * (var_1_12 / 256)) + var_1_8) + 1) <= (((var_1_8 / 256) * 256) + var_1_12)) && (((256 * (var_1_12 / 256)) + var_1_15) == var_1_12))) RESULT: Ultimate proved your program to be correct! [2023-12-19 13:27:59,964 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...