/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-15.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 02:20:57,544 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 02:20:57,610 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-21 02:20:57,613 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 02:20:57,614 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 02:20:57,635 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 02:20:57,635 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 02:20:57,635 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 02:20:57,636 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 02:20:57,638 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 02:20:57,638 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 02:20:57,639 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 02:20:57,639 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 02:20:57,640 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 02:20:57,640 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 02:20:57,641 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 02:20:57,641 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 02:20:57,641 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 02:20:57,641 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 02:20:57,641 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 02:20:57,641 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 02:20:57,642 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 02:20:57,642 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 02:20:57,642 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 02:20:57,642 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 02:20:57,642 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 02:20:57,642 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 02:20:57,642 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 02:20:57,643 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 02:20:57,643 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 02:20:57,644 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 02:20:57,644 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 02:20:57,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 02:20:57,644 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 02:20:57,644 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 02:20:57,644 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 02:20:57,644 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 02:20:57,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 02:20:57,644 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 02:20:57,645 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 02:20:57,645 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 02:20:57,645 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 02:20:57,645 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 02:20:57,645 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-21 02:20:57,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 02:20:57,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 02:20:57,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 02:20:57,855 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 02:20:57,855 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 02:20:57,856 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-15.i [2023-12-21 02:20:58,850 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 02:20:59,010 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 02:20:59,010 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-15.i [2023-12-21 02:20:59,018 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f99ef1b6/559196cb76894f139e5c20b52dd7cce4/FLAG02be0d0ba [2023-12-21 02:20:59,030 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f99ef1b6/559196cb76894f139e5c20b52dd7cce4 [2023-12-21 02:20:59,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 02:20:59,033 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 02:20:59,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 02:20:59,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 02:20:59,038 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 02:20:59,038 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:20:59" (1/1) ... [2023-12-21 02:20:59,039 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bb305ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:20:59, skipping insertion in model container [2023-12-21 02:20:59,039 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:20:59" (1/1) ... [2023-12-21 02:20:59,066 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 02:20:59,182 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_variablewrapping_wrapper-s_file-15.i[916,929] [2023-12-21 02:20:59,214 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 02:20:59,227 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 02:20:59,237 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_variablewrapping_wrapper-s_file-15.i[916,929] [2023-12-21 02:20:59,256 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 02:20:59,271 INFO L206 MainTranslator]: Completed translation [2023-12-21 02:20:59,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:20:59 WrapperNode [2023-12-21 02:20:59,271 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 02:20:59,272 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 02:20:59,272 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 02:20:59,272 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 02:20:59,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:20:59" (1/1) ... [2023-12-21 02:20:59,291 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:20:59" (1/1) ... [2023-12-21 02:20:59,314 INFO L138 Inliner]: procedures = 29, calls = 151, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 493 [2023-12-21 02:20:59,319 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 02:20:59,319 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 02:20:59,319 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 02:20:59,320 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 02:20:59,327 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:20:59" (1/1) ... [2023-12-21 02:20:59,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:20:59" (1/1) ... [2023-12-21 02:20:59,338 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:20:59" (1/1) ... [2023-12-21 02:20:59,357 INFO L175 MemorySlicer]: Split 127 memory accesses to 2 slices as follows [2, 125]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 16 writes are split as follows [0, 16]. [2023-12-21 02:20:59,357 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:20:59" (1/1) ... [2023-12-21 02:20:59,357 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:20:59" (1/1) ... [2023-12-21 02:20:59,369 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:20:59" (1/1) ... [2023-12-21 02:20:59,372 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:20:59" (1/1) ... [2023-12-21 02:20:59,373 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:20:59" (1/1) ... [2023-12-21 02:20:59,375 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:20:59" (1/1) ... [2023-12-21 02:20:59,377 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 02:20:59,378 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 02:20:59,378 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 02:20:59,378 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 02:20:59,379 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:20:59" (1/1) ... [2023-12-21 02:20:59,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 02:20:59,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:20:59,418 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-21 02:20:59,435 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-21 02:20:59,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 02:20:59,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-21 02:20:59,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-21 02:20:59,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 02:20:59,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 02:20:59,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-21 02:20:59,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-21 02:20:59,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 02:20:59,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 02:20:59,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-21 02:20:59,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-21 02:20:59,439 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 02:20:59,439 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 02:20:59,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 02:20:59,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 02:20:59,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 02:20:59,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 02:20:59,528 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 02:20:59,530 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 02:20:59,897 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 02:20:59,923 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 02:20:59,923 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 02:20:59,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:20:59 BoogieIcfgContainer [2023-12-21 02:20:59,923 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 02:20:59,925 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 02:20:59,925 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 02:20:59,927 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 02:20:59,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 02:20:59" (1/3) ... [2023-12-21 02:20:59,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3befde9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:20:59, skipping insertion in model container [2023-12-21 02:20:59,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:20:59" (2/3) ... [2023-12-21 02:20:59,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3befde9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:20:59, skipping insertion in model container [2023-12-21 02:20:59,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:20:59" (3/3) ... [2023-12-21 02:20:59,931 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-15.i [2023-12-21 02:20:59,941 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 02:20:59,942 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 02:20:59,974 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 02:20:59,978 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;@108dfaf9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 02:20:59,978 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 02:20:59,981 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 91 states have (on average 1.4835164835164836) internal successors, (135), 92 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 02:20:59,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-21 02:20:59,990 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:20:59,991 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:20:59,991 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:20:59,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:20:59,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1325511482, now seen corresponding path program 1 times [2023-12-21 02:21:00,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:21:00,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322062606] [2023-12-21 02:21:00,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:00,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:21:00,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:00,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:21:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:00,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:21:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:00,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:21:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:00,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:21:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:00,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:21:00,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:00,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:21:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:00,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:21:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:00,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:21:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:00,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:21:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:00,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:21:00,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:00,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:21:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:00,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:21:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:00,272 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:21:00,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:21:00,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322062606] [2023-12-21 02:21:00,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322062606] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:21:00,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:21:00,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 02:21:00,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541565614] [2023-12-21 02:21:00,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:21:00,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 02:21:00,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:21:00,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 02:21:00,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 02:21:00,312 INFO L87 Difference]: Start difference. First operand has 106 states, 91 states have (on average 1.4835164835164836) internal successors, (135), 92 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:21:00,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:21:00,348 INFO L93 Difference]: Finished difference Result 209 states and 328 transitions. [2023-12-21 02:21:00,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 02:21:00,350 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2023-12-21 02:21:00,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:21:00,356 INFO L225 Difference]: With dead ends: 209 [2023-12-21 02:21:00,357 INFO L226 Difference]: Without dead ends: 104 [2023-12-21 02:21:00,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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-21 02:21:00,361 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:21:00,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:21:00,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-21 02:21:00,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2023-12-21 02:21:00,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 90 states have internal predecessors, (128), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 02:21:00,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 152 transitions. [2023-12-21 02:21:00,395 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 152 transitions. Word has length 110 [2023-12-21 02:21:00,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:21:00,396 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 152 transitions. [2023-12-21 02:21:00,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:21:00,396 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 152 transitions. [2023-12-21 02:21:00,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-21 02:21:00,398 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:21:00,398 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:21:00,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 02:21:00,398 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:21:00,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:21:00,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1305745108, now seen corresponding path program 1 times [2023-12-21 02:21:00,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:21:00,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094799938] [2023-12-21 02:21:00,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:00,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:21:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:00,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:21:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:00,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:21:00,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:00,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:21:00,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:00,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:21:00,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:00,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:21:00,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:00,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:21:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:00,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:21:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:00,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:21:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:00,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:21:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:00,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:21:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:00,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:21:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:00,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:21:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:00,604 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:21:00,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:21:00,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094799938] [2023-12-21 02:21:00,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094799938] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:21:00,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:21:00,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 02:21:00,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794391332] [2023-12-21 02:21:00,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:21:00,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 02:21:00,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:21:00,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 02:21:00,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 02:21:00,607 INFO L87 Difference]: Start difference. First operand 104 states and 152 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:21:00,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:21:00,655 INFO L93 Difference]: Finished difference Result 208 states and 305 transitions. [2023-12-21 02:21:00,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 02:21:00,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2023-12-21 02:21:00,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:21:00,660 INFO L225 Difference]: With dead ends: 208 [2023-12-21 02:21:00,660 INFO L226 Difference]: Without dead ends: 105 [2023-12-21 02:21:00,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-21 02:21:00,661 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:21:00,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 289 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:21:00,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-12-21 02:21:00,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2023-12-21 02:21:00,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 02:21:00,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 153 transitions. [2023-12-21 02:21:00,669 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 153 transitions. Word has length 110 [2023-12-21 02:21:00,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:21:00,670 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 153 transitions. [2023-12-21 02:21:00,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:21:00,670 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2023-12-21 02:21:00,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-21 02:21:00,672 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:21:00,674 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:21:00,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 02:21:00,675 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:21:00,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:21:00,676 INFO L85 PathProgramCache]: Analyzing trace with hash 995077482, now seen corresponding path program 1 times [2023-12-21 02:21:00,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:21:00,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887579494] [2023-12-21 02:21:00,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:00,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:21:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:00,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:21:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:00,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:21:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:00,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:21:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:00,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:21:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:00,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:21:00,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:00,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:21:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:00,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:21:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:00,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:21:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:00,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:21:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:00,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:21:00,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:00,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:21:00,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:00,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:21:00,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:00,798 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:21:00,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:21:00,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887579494] [2023-12-21 02:21:00,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887579494] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:21:00,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:21:00,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 02:21:00,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417030114] [2023-12-21 02:21:00,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:21:00,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 02:21:00,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:21:00,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 02:21:00,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 02:21:00,800 INFO L87 Difference]: Start difference. First operand 105 states and 153 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:21:00,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:21:00,817 INFO L93 Difference]: Finished difference Result 233 states and 340 transitions. [2023-12-21 02:21:00,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 02:21:00,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2023-12-21 02:21:00,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:21:00,819 INFO L225 Difference]: With dead ends: 233 [2023-12-21 02:21:00,819 INFO L226 Difference]: Without dead ends: 129 [2023-12-21 02:21:00,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-21 02:21:00,820 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 39 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:21:00,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 316 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:21:00,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-12-21 02:21:00,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 106. [2023-12-21 02:21:00,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 02:21:00,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2023-12-21 02:21:00,827 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 110 [2023-12-21 02:21:00,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:21:00,827 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2023-12-21 02:21:00,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:21:00,828 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2023-12-21 02:21:00,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-21 02:21:00,829 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:21:00,829 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:21:00,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 02:21:00,829 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:21:00,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:21:00,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1696142060, now seen corresponding path program 1 times [2023-12-21 02:21:00,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:21:00,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113175311] [2023-12-21 02:21:00,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:00,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:21:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:01,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:21:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:01,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:21:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:01,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:21:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:01,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:21:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:01,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:21:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:01,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:21:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:01,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:21:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:01,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:21:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:01,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:21:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:01,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:21:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:01,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:21:01,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:01,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:21:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:01,221 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:21:01,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:21:01,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113175311] [2023-12-21 02:21:01,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113175311] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:21:01,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:21:01,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:21:01,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930798317] [2023-12-21 02:21:01,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:21:01,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:21:01,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:21:01,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:21:01,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:21:01,230 INFO L87 Difference]: Start difference. First operand 106 states and 154 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:21:01,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:21:01,449 INFO L93 Difference]: Finished difference Result 288 states and 414 transitions. [2023-12-21 02:21:01,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 02:21:01,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2023-12-21 02:21:01,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:21:01,452 INFO L225 Difference]: With dead ends: 288 [2023-12-21 02:21:01,452 INFO L226 Difference]: Without dead ends: 183 [2023-12-21 02:21:01,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-21 02:21:01,453 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 119 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:21:01,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 550 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:21:01,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-12-21 02:21:01,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 159. [2023-12-21 02:21:01,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 140 states have (on average 1.4) internal successors, (196), 141 states have internal predecessors, (196), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-21 02:21:01,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 228 transitions. [2023-12-21 02:21:01,463 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 228 transitions. Word has length 110 [2023-12-21 02:21:01,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:21:01,464 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 228 transitions. [2023-12-21 02:21:01,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:21:01,464 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 228 transitions. [2023-12-21 02:21:01,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-21 02:21:01,465 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:21:01,465 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:21:01,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 02:21:01,465 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:21:01,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:21:01,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1415952194, now seen corresponding path program 1 times [2023-12-21 02:21:01,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:21:01,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299867406] [2023-12-21 02:21:01,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:01,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:21:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:02,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:21:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:02,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:21:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:02,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:21:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:02,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:21:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:02,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:21:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:02,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:21:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:02,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:21:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:02,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:21:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:02,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:21:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:02,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:21:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:02,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:21:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:02,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:21:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:02,171 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:21:02,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:21:02,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299867406] [2023-12-21 02:21:02,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299867406] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:21:02,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:21:02,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:21:02,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372802230] [2023-12-21 02:21:02,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:21:02,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:21:02,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:21:02,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:21:02,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:21:02,176 INFO L87 Difference]: Start difference. First operand 159 states and 228 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:21:02,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:21:02,365 INFO L93 Difference]: Finished difference Result 517 states and 743 transitions. [2023-12-21 02:21:02,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:21:02,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2023-12-21 02:21:02,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:21:02,370 INFO L225 Difference]: With dead ends: 517 [2023-12-21 02:21:02,370 INFO L226 Difference]: Without dead ends: 359 [2023-12-21 02:21:02,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:21:02,377 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 172 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:21:02,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 254 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:21:02,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2023-12-21 02:21:02,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 309. [2023-12-21 02:21:02,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 272 states have (on average 1.400735294117647) internal successors, (381), 274 states have internal predecessors, (381), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-21 02:21:02,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 445 transitions. [2023-12-21 02:21:02,410 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 445 transitions. Word has length 111 [2023-12-21 02:21:02,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:21:02,411 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 445 transitions. [2023-12-21 02:21:02,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:21:02,411 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 445 transitions. [2023-12-21 02:21:02,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-21 02:21:02,415 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:21:02,415 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:21:02,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 02:21:02,416 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:21:02,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:21:02,416 INFO L85 PathProgramCache]: Analyzing trace with hash -985301160, now seen corresponding path program 1 times [2023-12-21 02:21:02,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:21:02,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176658497] [2023-12-21 02:21:02,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:02,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:21:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:02,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:21:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:02,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:21:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:02,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:21:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:02,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:21:02,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:02,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:21:02,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:02,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:21:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:02,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:21:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:02,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:21:02,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:02,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:21:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:02,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:21:02,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:02,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:21:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:02,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:21:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:02,960 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:21:02,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:21:02,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176658497] [2023-12-21 02:21:02,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176658497] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:21:02,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:21:02,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:21:02,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100092205] [2023-12-21 02:21:02,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:21:02,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:21:02,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:21:02,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:21:02,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:21:02,963 INFO L87 Difference]: Start difference. First operand 309 states and 445 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:21:03,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:21:03,147 INFO L93 Difference]: Finished difference Result 621 states and 893 transitions. [2023-12-21 02:21:03,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:21:03,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2023-12-21 02:21:03,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:21:03,148 INFO L225 Difference]: With dead ends: 621 [2023-12-21 02:21:03,149 INFO L226 Difference]: Without dead ends: 313 [2023-12-21 02:21:03,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:21:03,153 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 100 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:21:03,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 247 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:21:03,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2023-12-21 02:21:03,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 308. [2023-12-21 02:21:03,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 271 states have (on average 1.3985239852398523) internal successors, (379), 273 states have internal predecessors, (379), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-21 02:21:03,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 443 transitions. [2023-12-21 02:21:03,171 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 443 transitions. Word has length 112 [2023-12-21 02:21:03,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:21:03,171 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 443 transitions. [2023-12-21 02:21:03,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:21:03,172 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 443 transitions. [2023-12-21 02:21:03,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-21 02:21:03,173 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:21:03,173 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:21:03,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 02:21:03,174 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:21:03,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:21:03,174 INFO L85 PathProgramCache]: Analyzing trace with hash 335177262, now seen corresponding path program 1 times [2023-12-21 02:21:03,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:21:03,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965678251] [2023-12-21 02:21:03,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:03,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:21:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:03,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:21:03,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:03,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:21:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:03,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:21:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:03,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:21:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:03,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:21:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:03,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:21:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:03,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:21:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:03,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:21:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:03,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:21:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:03,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:21:03,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:03,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:21:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:03,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:21:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:03,427 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:21:03,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:21:03,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965678251] [2023-12-21 02:21:03,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965678251] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:21:03,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:21:03,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 02:21:03,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304382011] [2023-12-21 02:21:03,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:21:03,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 02:21:03,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:21:03,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 02:21:03,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-21 02:21:03,428 INFO L87 Difference]: Start difference. First operand 308 states and 443 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:21:03,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:21:03,769 INFO L93 Difference]: Finished difference Result 867 states and 1251 transitions. [2023-12-21 02:21:03,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-21 02:21:03,770 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2023-12-21 02:21:03,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:21:03,772 INFO L225 Difference]: With dead ends: 867 [2023-12-21 02:21:03,772 INFO L226 Difference]: Without dead ends: 560 [2023-12-21 02:21:03,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2023-12-21 02:21:03,773 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 226 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 02:21:03,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 1139 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 02:21:03,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2023-12-21 02:21:03,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 516. [2023-12-21 02:21:03,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 453 states have (on average 1.3995584988962473) internal successors, (634), 455 states have internal predecessors, (634), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2023-12-21 02:21:03,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 746 transitions. [2023-12-21 02:21:03,791 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 746 transitions. Word has length 113 [2023-12-21 02:21:03,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:21:03,792 INFO L495 AbstractCegarLoop]: Abstraction has 516 states and 746 transitions. [2023-12-21 02:21:03,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:21:03,792 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 746 transitions. [2023-12-21 02:21:03,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-21 02:21:03,793 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:21:03,793 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:21:03,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-21 02:21:03,793 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:21:03,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:21:03,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1612317251, now seen corresponding path program 1 times [2023-12-21 02:21:03,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:21:03,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910319140] [2023-12-21 02:21:03,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:03,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:21:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:04,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:21:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:04,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:21:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:04,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:21:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:04,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:21:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:04,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:21:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:04,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:21:04,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:04,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:21:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:04,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:21:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:04,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:21:04,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:04,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:21:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:04,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:21:04,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:04,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:21:04,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:04,538 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:21:04,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:21:04,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910319140] [2023-12-21 02:21:04,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910319140] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:21:04,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:21:04,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 02:21:04,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307422938] [2023-12-21 02:21:04,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:21:04,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 02:21:04,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:21:04,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 02:21:04,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:21:04,540 INFO L87 Difference]: Start difference. First operand 516 states and 746 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:21:04,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:21:04,795 INFO L93 Difference]: Finished difference Result 1377 states and 1987 transitions. [2023-12-21 02:21:04,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 02:21:04,795 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2023-12-21 02:21:04,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:21:04,798 INFO L225 Difference]: With dead ends: 1377 [2023-12-21 02:21:04,798 INFO L226 Difference]: Without dead ends: 862 [2023-12-21 02:21:04,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:21:04,800 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 134 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:21:04,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 524 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:21:04,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2023-12-21 02:21:04,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 598. [2023-12-21 02:21:04,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 535 states have (on average 1.4093457943925234) internal successors, (754), 537 states have internal predecessors, (754), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2023-12-21 02:21:04,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 866 transitions. [2023-12-21 02:21:04,821 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 866 transitions. Word has length 113 [2023-12-21 02:21:04,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:21:04,822 INFO L495 AbstractCegarLoop]: Abstraction has 598 states and 866 transitions. [2023-12-21 02:21:04,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:21:04,822 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 866 transitions. [2023-12-21 02:21:04,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-21 02:21:04,823 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:21:04,823 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:21:04,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-21 02:21:04,823 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:21:04,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:21:04,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1449365352, now seen corresponding path program 1 times [2023-12-21 02:21:04,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:21:04,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953187662] [2023-12-21 02:21:04,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:04,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:21:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:05,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:21:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:05,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:21:05,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:05,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:21:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:05,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:21:05,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:05,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:21:05,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:05,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:21:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:05,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:21:05,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:05,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:21:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:05,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:21:05,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:05,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:21:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:05,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:21:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:05,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:21:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:05,398 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:21:05,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:21:05,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953187662] [2023-12-21 02:21:05,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953187662] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:21:05,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:21:05,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 02:21:05,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825987488] [2023-12-21 02:21:05,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:21:05,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 02:21:05,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:21:05,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 02:21:05,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:21:05,399 INFO L87 Difference]: Start difference. First operand 598 states and 866 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:21:05,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:21:05,630 INFO L93 Difference]: Finished difference Result 1096 states and 1578 transitions. [2023-12-21 02:21:05,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:21:05,631 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2023-12-21 02:21:05,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:21:05,634 INFO L225 Difference]: With dead ends: 1096 [2023-12-21 02:21:05,634 INFO L226 Difference]: Without dead ends: 788 [2023-12-21 02:21:05,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:21:05,636 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 64 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:21:05,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 573 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:21:05,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2023-12-21 02:21:05,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 594. [2023-12-21 02:21:05,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 531 states have (on average 1.4011299435028248) internal successors, (744), 533 states have internal predecessors, (744), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2023-12-21 02:21:05,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 856 transitions. [2023-12-21 02:21:05,661 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 856 transitions. Word has length 113 [2023-12-21 02:21:05,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:21:05,661 INFO L495 AbstractCegarLoop]: Abstraction has 594 states and 856 transitions. [2023-12-21 02:21:05,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:21:05,661 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 856 transitions. [2023-12-21 02:21:05,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-21 02:21:05,662 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:21:05,662 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:21:05,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-21 02:21:05,662 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:21:05,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:21:05,663 INFO L85 PathProgramCache]: Analyzing trace with hash 512451215, now seen corresponding path program 1 times [2023-12-21 02:21:05,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:21:05,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634123589] [2023-12-21 02:21:05,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:05,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:21:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:06,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:21:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:06,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:21:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:06,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:21:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:06,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:21:06,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:06,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:21:06,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:06,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:21:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:06,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:21:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:06,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:21:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:06,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:21:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:06,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:21:06,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:06,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:21:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:06,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:21:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:06,407 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:21:06,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:21:06,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634123589] [2023-12-21 02:21:06,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634123589] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:21:06,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:21:06,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 02:21:06,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978887871] [2023-12-21 02:21:06,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:21:06,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 02:21:06,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:21:06,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 02:21:06,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:21:06,409 INFO L87 Difference]: Start difference. First operand 594 states and 856 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:21:06,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:21:06,993 INFO L93 Difference]: Finished difference Result 1441 states and 2074 transitions. [2023-12-21 02:21:06,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 02:21:06,993 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-12-21 02:21:06,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:21:06,996 INFO L225 Difference]: With dead ends: 1441 [2023-12-21 02:21:06,996 INFO L226 Difference]: Without dead ends: 848 [2023-12-21 02:21:06,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2023-12-21 02:21:06,997 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 299 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-21 02:21:06,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 620 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-21 02:21:06,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2023-12-21 02:21:07,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 612. [2023-12-21 02:21:07,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 549 states have (on average 1.3970856102003644) internal successors, (767), 551 states have internal predecessors, (767), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2023-12-21 02:21:07,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 879 transitions. [2023-12-21 02:21:07,024 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 879 transitions. Word has length 114 [2023-12-21 02:21:07,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:21:07,024 INFO L495 AbstractCegarLoop]: Abstraction has 612 states and 879 transitions. [2023-12-21 02:21:07,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:21:07,024 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 879 transitions. [2023-12-21 02:21:07,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-21 02:21:07,025 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:21:07,025 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:21:07,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-21 02:21:07,025 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:21:07,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:21:07,026 INFO L85 PathProgramCache]: Analyzing trace with hash -372373443, now seen corresponding path program 1 times [2023-12-21 02:21:07,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:21:07,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860379452] [2023-12-21 02:21:07,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:07,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:21:07,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:07,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:21:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:07,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:21:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:07,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:21:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:07,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:21:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:07,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:21:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:07,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:21:07,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:07,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:21:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:07,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:21:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:07,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:21:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:07,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:21:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:07,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:21:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:07,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:21:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:07,677 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:21:07,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:21:07,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860379452] [2023-12-21 02:21:07,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860379452] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:21:07,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:21:07,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 02:21:07,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579125748] [2023-12-21 02:21:07,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:21:07,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 02:21:07,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:21:07,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 02:21:07,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:21:07,679 INFO L87 Difference]: Start difference. First operand 612 states and 879 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:21:07,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:21:07,917 INFO L93 Difference]: Finished difference Result 1419 states and 2026 transitions. [2023-12-21 02:21:07,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 02:21:07,918 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 114 [2023-12-21 02:21:07,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:21:07,920 INFO L225 Difference]: With dead ends: 1419 [2023-12-21 02:21:07,920 INFO L226 Difference]: Without dead ends: 808 [2023-12-21 02:21:07,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:21:07,922 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 61 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:21:07,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 419 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:21:07,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2023-12-21 02:21:07,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 610. [2023-12-21 02:21:07,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 547 states have (on average 1.3875685557586837) internal successors, (759), 549 states have internal predecessors, (759), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2023-12-21 02:21:07,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 871 transitions. [2023-12-21 02:21:07,948 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 871 transitions. Word has length 114 [2023-12-21 02:21:07,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:21:07,949 INFO L495 AbstractCegarLoop]: Abstraction has 610 states and 871 transitions. [2023-12-21 02:21:07,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:21:07,949 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 871 transitions. [2023-12-21 02:21:07,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-21 02:21:07,950 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:21:07,950 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:21:07,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-21 02:21:07,950 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:21:07,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:21:07,950 INFO L85 PathProgramCache]: Analyzing trace with hash -816995831, now seen corresponding path program 1 times [2023-12-21 02:21:07,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:21:07,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843042055] [2023-12-21 02:21:07,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:07,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:21:07,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:08,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:21:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:08,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:21:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:08,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:21:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:08,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:21:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:08,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:21:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:08,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:21:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:08,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:21:08,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:08,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:21:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:08,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:21:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:08,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:21:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:08,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:21:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:08,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:21:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:08,104 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:21:08,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:21:08,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843042055] [2023-12-21 02:21:08,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843042055] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:21:08,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:21:08,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:21:08,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875496332] [2023-12-21 02:21:08,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:21:08,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:21:08,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:21:08,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:21:08,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:21:08,105 INFO L87 Difference]: Start difference. First operand 610 states and 871 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:21:08,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:21:08,279 INFO L93 Difference]: Finished difference Result 1282 states and 1826 transitions. [2023-12-21 02:21:08,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:21:08,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2023-12-21 02:21:08,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:21:08,282 INFO L225 Difference]: With dead ends: 1282 [2023-12-21 02:21:08,282 INFO L226 Difference]: Without dead ends: 665 [2023-12-21 02:21:08,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:21:08,283 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 60 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:21:08,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 361 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:21:08,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2023-12-21 02:21:08,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 558. [2023-12-21 02:21:08,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 495 states have (on average 1.3797979797979798) internal successors, (683), 497 states have internal predecessors, (683), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2023-12-21 02:21:08,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 795 transitions. [2023-12-21 02:21:08,306 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 795 transitions. Word has length 115 [2023-12-21 02:21:08,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:21:08,306 INFO L495 AbstractCegarLoop]: Abstraction has 558 states and 795 transitions. [2023-12-21 02:21:08,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:21:08,306 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 795 transitions. [2023-12-21 02:21:08,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-21 02:21:08,307 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:21:08,307 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:21:08,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-21 02:21:08,307 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:21:08,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:21:08,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1896916854, now seen corresponding path program 1 times [2023-12-21 02:21:08,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:21:08,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225212156] [2023-12-21 02:21:08,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:08,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:21:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:08,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:21:08,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:08,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:21:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:08,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:21:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:08,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:21:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:08,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:21:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:08,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:21:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:08,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:21:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:08,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:21:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:08,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:21:08,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:08,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:21:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:08,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:21:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:08,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:21:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:08,938 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:21:08,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:21:08,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225212156] [2023-12-21 02:21:08,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225212156] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:21:08,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:21:08,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 02:21:08,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924950799] [2023-12-21 02:21:08,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:21:08,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 02:21:08,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:21:08,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 02:21:08,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:21:08,940 INFO L87 Difference]: Start difference. First operand 558 states and 795 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:21:09,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:21:09,463 INFO L93 Difference]: Finished difference Result 1268 states and 1798 transitions. [2023-12-21 02:21:09,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 02:21:09,464 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2023-12-21 02:21:09,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:21:09,466 INFO L225 Difference]: With dead ends: 1268 [2023-12-21 02:21:09,466 INFO L226 Difference]: Without dead ends: 679 [2023-12-21 02:21:09,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-12-21 02:21:09,467 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 366 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 02:21:09,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 466 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 02:21:09,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2023-12-21 02:21:09,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 575. [2023-12-21 02:21:09,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 512 states have (on average 1.375) internal successors, (704), 514 states have internal predecessors, (704), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2023-12-21 02:21:09,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 816 transitions. [2023-12-21 02:21:09,492 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 816 transitions. Word has length 115 [2023-12-21 02:21:09,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:21:09,492 INFO L495 AbstractCegarLoop]: Abstraction has 575 states and 816 transitions. [2023-12-21 02:21:09,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:21:09,493 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 816 transitions. [2023-12-21 02:21:09,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-21 02:21:09,493 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:21:09,494 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:21:09,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-21 02:21:09,494 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:21:09,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:21:09,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1387443764, now seen corresponding path program 1 times [2023-12-21 02:21:09,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:21:09,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641782565] [2023-12-21 02:21:09,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:09,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:21:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:09,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:21:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:09,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:21:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:09,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:21:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:09,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:21:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:09,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:21:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:09,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:21:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:09,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:21:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:09,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:21:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:09,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:21:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:09,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:21:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:09,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:21:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:09,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:21:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:09,994 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:21:09,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:21:09,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641782565] [2023-12-21 02:21:09,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641782565] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:21:09,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:21:09,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 02:21:09,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166190369] [2023-12-21 02:21:09,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:21:09,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 02:21:09,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:21:09,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 02:21:09,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:21:09,996 INFO L87 Difference]: Start difference. First operand 575 states and 816 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:21:10,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:21:10,234 INFO L93 Difference]: Finished difference Result 1312 states and 1861 transitions. [2023-12-21 02:21:10,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:21:10,234 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2023-12-21 02:21:10,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:21:10,240 INFO L225 Difference]: With dead ends: 1312 [2023-12-21 02:21:10,240 INFO L226 Difference]: Without dead ends: 738 [2023-12-21 02:21:10,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:21:10,242 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 86 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:21:10,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 454 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:21:10,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2023-12-21 02:21:10,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 575. [2023-12-21 02:21:10,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 512 states have (on average 1.359375) internal successors, (696), 514 states have internal predecessors, (696), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2023-12-21 02:21:10,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 808 transitions. [2023-12-21 02:21:10,274 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 808 transitions. Word has length 115 [2023-12-21 02:21:10,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:21:10,275 INFO L495 AbstractCegarLoop]: Abstraction has 575 states and 808 transitions. [2023-12-21 02:21:10,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:21:10,275 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 808 transitions. [2023-12-21 02:21:10,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-21 02:21:10,276 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:21:10,276 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:21:10,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-21 02:21:10,276 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:21:10,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:21:10,276 INFO L85 PathProgramCache]: Analyzing trace with hash 107580086, now seen corresponding path program 1 times [2023-12-21 02:21:10,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:21:10,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830145844] [2023-12-21 02:21:10,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:10,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:21:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:11,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:21:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:11,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:21:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:11,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:21:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:11,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:21:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:11,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:21:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:11,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:21:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:11,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:21:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:11,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:21:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:11,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:21:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:11,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:21:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:11,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:21:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:11,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:21:11,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:11,290 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:21:11,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:21:11,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830145844] [2023-12-21 02:21:11,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830145844] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:21:11,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:21:11,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-21 02:21:11,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530112922] [2023-12-21 02:21:11,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:21:11,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-21 02:21:11,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:21:11,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-21 02:21:11,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-12-21 02:21:11,291 INFO L87 Difference]: Start difference. First operand 575 states and 808 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:21:12,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:21:12,870 INFO L93 Difference]: Finished difference Result 1367 states and 1922 transitions. [2023-12-21 02:21:12,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-21 02:21:12,872 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2023-12-21 02:21:12,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:21:12,874 INFO L225 Difference]: With dead ends: 1367 [2023-12-21 02:21:12,874 INFO L226 Difference]: Without dead ends: 793 [2023-12-21 02:21:12,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2023-12-21 02:21:12,877 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 508 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 1537 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 1644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:21:12,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 1032 Invalid, 1644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1537 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-21 02:21:12,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2023-12-21 02:21:12,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 565. [2023-12-21 02:21:12,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 502 states have (on average 1.3585657370517927) internal successors, (682), 504 states have internal predecessors, (682), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2023-12-21 02:21:12,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 794 transitions. [2023-12-21 02:21:12,905 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 794 transitions. Word has length 115 [2023-12-21 02:21:12,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:21:12,905 INFO L495 AbstractCegarLoop]: Abstraction has 565 states and 794 transitions. [2023-12-21 02:21:12,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:21:12,906 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 794 transitions. [2023-12-21 02:21:12,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-21 02:21:12,906 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:21:12,907 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:21:12,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-21 02:21:12,907 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:21:12,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:21:12,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1125467700, now seen corresponding path program 1 times [2023-12-21 02:21:12,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:21:12,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929679190] [2023-12-21 02:21:12,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:12,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:21:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:14,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:21:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:14,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:21:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:14,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:21:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:14,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:21:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:14,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:21:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:14,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:21:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:14,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:21:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:14,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:21:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:14,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:21:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:14,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:21:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:14,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:21:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:14,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:21:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:14,241 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:21:14,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:21:14,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929679190] [2023-12-21 02:21:14,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929679190] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:21:14,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:21:14,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-21 02:21:14,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901466867] [2023-12-21 02:21:14,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:21:14,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 02:21:14,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:21:14,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 02:21:14,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2023-12-21 02:21:14,243 INFO L87 Difference]: Start difference. First operand 565 states and 794 transitions. Second operand has 16 states, 13 states have (on average 4.538461538461538) internal successors, (59), 16 states have internal predecessors, (59), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 6 states have call successors, (12) [2023-12-21 02:21:17,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:21:17,359 INFO L93 Difference]: Finished difference Result 1531 states and 2146 transitions. [2023-12-21 02:21:17,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-21 02:21:17,360 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 4.538461538461538) internal successors, (59), 16 states have internal predecessors, (59), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 6 states have call successors, (12) Word has length 116 [2023-12-21 02:21:17,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:21:17,363 INFO L225 Difference]: With dead ends: 1531 [2023-12-21 02:21:17,363 INFO L226 Difference]: Without dead ends: 1231 [2023-12-21 02:21:17,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=217, Invalid=1043, Unknown=0, NotChecked=0, Total=1260 [2023-12-21 02:21:17,365 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 977 mSDsluCounter, 1892 mSDsCounter, 0 mSdLazyCounter, 3450 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 2116 SdHoareTripleChecker+Invalid, 3651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 3450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-21 02:21:17,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 2116 Invalid, 3651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 3450 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-21 02:21:17,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2023-12-21 02:21:17,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 607. [2023-12-21 02:21:17,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 544 states have (on average 1.3547794117647058) internal successors, (737), 546 states have internal predecessors, (737), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2023-12-21 02:21:17,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 849 transitions. [2023-12-21 02:21:17,403 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 849 transitions. Word has length 116 [2023-12-21 02:21:17,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:21:17,403 INFO L495 AbstractCegarLoop]: Abstraction has 607 states and 849 transitions. [2023-12-21 02:21:17,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 4.538461538461538) internal successors, (59), 16 states have internal predecessors, (59), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 6 states have call successors, (12) [2023-12-21 02:21:17,403 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 849 transitions. [2023-12-21 02:21:17,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-21 02:21:17,405 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:21:17,405 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:21:17,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-21 02:21:17,405 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:21:17,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:21:17,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1266016310, now seen corresponding path program 1 times [2023-12-21 02:21:17,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:21:17,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024141663] [2023-12-21 02:21:17,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:17,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:21:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:18,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:21:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:18,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:21:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:18,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:21:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:18,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:21:18,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:18,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:21:18,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:18,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:21:18,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:18,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:21:18,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:18,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:21:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:18,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:21:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:18,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:21:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:18,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:21:18,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:18,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:21:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:18,500 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:21:18,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:21:18,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024141663] [2023-12-21 02:21:18,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024141663] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:21:18,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:21:18,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-21 02:21:18,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849928105] [2023-12-21 02:21:18,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:21:18,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 02:21:18,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:21:18,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 02:21:18,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2023-12-21 02:21:18,502 INFO L87 Difference]: Start difference. First operand 607 states and 849 transitions. Second operand has 16 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2023-12-21 02:21:22,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:21:22,394 INFO L93 Difference]: Finished difference Result 1595 states and 2227 transitions. [2023-12-21 02:21:22,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-21 02:21:22,394 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 116 [2023-12-21 02:21:22,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:21:22,398 INFO L225 Difference]: With dead ends: 1595 [2023-12-21 02:21:22,398 INFO L226 Difference]: Without dead ends: 1253 [2023-12-21 02:21:22,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=221, Invalid=969, Unknown=0, NotChecked=0, Total=1190 [2023-12-21 02:21:22,399 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 964 mSDsluCounter, 1819 mSDsCounter, 0 mSdLazyCounter, 3470 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 2031 SdHoareTripleChecker+Invalid, 3664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 3470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-12-21 02:21:22,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [964 Valid, 2031 Invalid, 3664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 3470 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-12-21 02:21:22,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2023-12-21 02:21:22,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 577. [2023-12-21 02:21:22,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 514 states have (on average 1.3560311284046693) internal successors, (697), 516 states have internal predecessors, (697), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2023-12-21 02:21:22,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 809 transitions. [2023-12-21 02:21:22,437 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 809 transitions. Word has length 116 [2023-12-21 02:21:22,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:21:22,437 INFO L495 AbstractCegarLoop]: Abstraction has 577 states and 809 transitions. [2023-12-21 02:21:22,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.214285714285714) internal successors, (59), 15 states have internal predecessors, (59), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2023-12-21 02:21:22,438 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 809 transitions. [2023-12-21 02:21:22,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-21 02:21:22,438 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:21:22,439 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:21:22,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-21 02:21:22,439 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:21:22,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:21:22,439 INFO L85 PathProgramCache]: Analyzing trace with hash 377835489, now seen corresponding path program 1 times [2023-12-21 02:21:22,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:21:22,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221814071] [2023-12-21 02:21:22,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:22,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:21:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:22,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:21:22,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:22,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:21:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:22,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:21:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:22,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:21:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:22,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:21:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:22,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:21:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:22,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:21:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:22,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:21:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:22,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:21:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:22,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:21:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:22,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:21:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:22,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:21:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:22,671 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:21:22,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:21:22,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221814071] [2023-12-21 02:21:22,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221814071] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:21:22,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:21:22,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-21 02:21:22,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031845647] [2023-12-21 02:21:22,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:21:22,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 02:21:22,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:21:22,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 02:21:22,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-21 02:21:22,672 INFO L87 Difference]: Start difference. First operand 577 states and 809 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:21:23,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:21:23,024 INFO L93 Difference]: Finished difference Result 1302 states and 1824 transitions. [2023-12-21 02:21:23,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-21 02:21:23,024 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2023-12-21 02:21:23,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:21:23,027 INFO L225 Difference]: With dead ends: 1302 [2023-12-21 02:21:23,027 INFO L226 Difference]: Without dead ends: 726 [2023-12-21 02:21:23,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=427, Unknown=0, NotChecked=0, Total=552 [2023-12-21 02:21:23,028 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 342 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:21:23,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 1284 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:21:23,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2023-12-21 02:21:23,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 588. [2023-12-21 02:21:23,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 525 states have (on average 1.3466666666666667) internal successors, (707), 527 states have internal predecessors, (707), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2023-12-21 02:21:23,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 819 transitions. [2023-12-21 02:21:23,063 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 819 transitions. Word has length 116 [2023-12-21 02:21:23,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:21:23,063 INFO L495 AbstractCegarLoop]: Abstraction has 588 states and 819 transitions. [2023-12-21 02:21:23,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:21:23,063 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 819 transitions. [2023-12-21 02:21:23,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-21 02:21:23,064 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:21:23,064 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:21:23,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-21 02:21:23,065 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:21:23,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:21:23,065 INFO L85 PathProgramCache]: Analyzing trace with hash 800537315, now seen corresponding path program 1 times [2023-12-21 02:21:23,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:21:23,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037180550] [2023-12-21 02:21:23,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:23,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:21:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:23,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:21:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:23,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:21:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:23,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:21:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:23,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:21:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:23,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:21:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:23,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:21:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:23,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:21:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:23,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:21:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:23,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:21:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:23,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:21:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:23,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:21:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:23,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:21:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:23,437 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:21:23,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:21:23,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037180550] [2023-12-21 02:21:23,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037180550] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:21:23,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:21:23,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 02:21:23,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482504313] [2023-12-21 02:21:23,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:21:23,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 02:21:23,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:21:23,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 02:21:23,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:21:23,439 INFO L87 Difference]: Start difference. First operand 588 states and 819 transitions. Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:21:23,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:21:23,724 INFO L93 Difference]: Finished difference Result 1379 states and 1910 transitions. [2023-12-21 02:21:23,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 02:21:23,724 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2023-12-21 02:21:23,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:21:23,726 INFO L225 Difference]: With dead ends: 1379 [2023-12-21 02:21:23,726 INFO L226 Difference]: Without dead ends: 792 [2023-12-21 02:21:23,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:21:23,728 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 122 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:21:23,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 665 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:21:23,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2023-12-21 02:21:23,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 669. [2023-12-21 02:21:23,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 598 states have (on average 1.339464882943144) internal successors, (801), 602 states have internal predecessors, (801), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-21 02:21:23,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 921 transitions. [2023-12-21 02:21:23,765 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 921 transitions. Word has length 116 [2023-12-21 02:21:23,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:21:23,766 INFO L495 AbstractCegarLoop]: Abstraction has 669 states and 921 transitions. [2023-12-21 02:21:23,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:21:23,766 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 921 transitions. [2023-12-21 02:21:23,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-21 02:21:23,766 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:21:23,766 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:21:23,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-21 02:21:23,767 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:21:23,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:21:23,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1006646020, now seen corresponding path program 1 times [2023-12-21 02:21:23,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:21:23,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356980545] [2023-12-21 02:21:23,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:23,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:21:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:24,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:21:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:24,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:21:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:24,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:21:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:24,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:21:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:24,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:21:24,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:24,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:21:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:24,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:21:24,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:24,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:21:24,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:24,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:21:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:24,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:21:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:24,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:21:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:24,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:21:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:24,533 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:21:24,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:21:24,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356980545] [2023-12-21 02:21:24,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356980545] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:21:24,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:21:24,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-21 02:21:24,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349978415] [2023-12-21 02:21:24,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:21:24,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 02:21:24,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:21:24,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 02:21:24,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-21 02:21:24,534 INFO L87 Difference]: Start difference. First operand 669 states and 921 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:21:26,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:21:26,372 INFO L93 Difference]: Finished difference Result 1386 states and 1912 transitions. [2023-12-21 02:21:26,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 02:21:26,380 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2023-12-21 02:21:26,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:21:26,385 INFO L225 Difference]: With dead ends: 1386 [2023-12-21 02:21:26,386 INFO L226 Difference]: Without dead ends: 1017 [2023-12-21 02:21:26,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2023-12-21 02:21:26,390 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 402 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-21 02:21:26,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 880 Invalid, 1447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1352 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-21 02:21:26,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2023-12-21 02:21:26,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 780. [2023-12-21 02:21:26,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 695 states have (on average 1.3366906474820144) internal successors, (929), 700 states have internal predecessors, (929), 72 states have call successors, (72), 12 states have call predecessors, (72), 12 states have return successors, (72), 67 states have call predecessors, (72), 72 states have call successors, (72) [2023-12-21 02:21:26,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1073 transitions. [2023-12-21 02:21:26,457 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1073 transitions. Word has length 117 [2023-12-21 02:21:26,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:21:26,458 INFO L495 AbstractCegarLoop]: Abstraction has 780 states and 1073 transitions. [2023-12-21 02:21:26,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:21:26,458 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1073 transitions. [2023-12-21 02:21:26,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-21 02:21:26,459 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:21:26,459 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:21:26,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-21 02:21:26,459 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:21:26,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:21:26,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1068685634, now seen corresponding path program 1 times [2023-12-21 02:21:26,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:21:26,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97619458] [2023-12-21 02:21:26,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:26,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:21:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:27,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:21:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:27,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:21:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:27,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:21:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:27,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:21:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:27,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:21:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:27,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:21:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:27,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:21:27,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:27,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:21:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:27,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:21:27,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:27,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:21:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:27,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:21:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:27,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:21:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:27,189 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:21:27,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:21:27,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97619458] [2023-12-21 02:21:27,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97619458] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:21:27,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:21:27,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-21 02:21:27,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195812454] [2023-12-21 02:21:27,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:21:27,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-21 02:21:27,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:21:27,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-21 02:21:27,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-12-21 02:21:27,190 INFO L87 Difference]: Start difference. First operand 780 states and 1073 transitions. Second operand has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-21 02:21:29,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:21:29,253 INFO L93 Difference]: Finished difference Result 1729 states and 2389 transitions. [2023-12-21 02:21:29,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-21 02:21:29,253 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 117 [2023-12-21 02:21:29,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:21:29,256 INFO L225 Difference]: With dead ends: 1729 [2023-12-21 02:21:29,256 INFO L226 Difference]: Without dead ends: 1249 [2023-12-21 02:21:29,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2023-12-21 02:21:29,258 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 457 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 1717 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 1834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-21 02:21:29,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 1080 Invalid, 1834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1717 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-21 02:21:29,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2023-12-21 02:21:29,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 750. [2023-12-21 02:21:29,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 665 states have (on average 1.3383458646616542) internal successors, (890), 670 states have internal predecessors, (890), 72 states have call successors, (72), 12 states have call predecessors, (72), 12 states have return successors, (72), 67 states have call predecessors, (72), 72 states have call successors, (72) [2023-12-21 02:21:29,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1034 transitions. [2023-12-21 02:21:29,325 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1034 transitions. Word has length 117 [2023-12-21 02:21:29,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:21:29,326 INFO L495 AbstractCegarLoop]: Abstraction has 750 states and 1034 transitions. [2023-12-21 02:21:29,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-21 02:21:29,326 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1034 transitions. [2023-12-21 02:21:29,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-21 02:21:29,327 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:21:29,327 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:21:29,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-21 02:21:29,327 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:21:29,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:21:29,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1888205212, now seen corresponding path program 1 times [2023-12-21 02:21:29,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:21:29,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335086415] [2023-12-21 02:21:29,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:29,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:21:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:29,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:21:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:29,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:21:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:29,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:21:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:29,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:21:29,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:29,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:21:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:29,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:21:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:29,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:21:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:29,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:21:29,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:29,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:21:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:29,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:21:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:29,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:21:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:29,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:21:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:29,762 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:21:29,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:21:29,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335086415] [2023-12-21 02:21:29,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335086415] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:21:29,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:21:29,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 02:21:29,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569647844] [2023-12-21 02:21:29,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:21:29,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 02:21:29,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:21:29,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 02:21:29,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:21:29,763 INFO L87 Difference]: Start difference. First operand 750 states and 1034 transitions. Second operand has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:21:30,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:21:30,006 INFO L93 Difference]: Finished difference Result 1695 states and 2349 transitions. [2023-12-21 02:21:30,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 02:21:30,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2023-12-21 02:21:30,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:21:30,010 INFO L225 Difference]: With dead ends: 1695 [2023-12-21 02:21:30,010 INFO L226 Difference]: Without dead ends: 946 [2023-12-21 02:21:30,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:21:30,013 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 118 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:21:30,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 465 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:21:30,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2023-12-21 02:21:30,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 756. [2023-12-21 02:21:30,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 671 states have (on average 1.3293591654247392) internal successors, (892), 676 states have internal predecessors, (892), 72 states have call successors, (72), 12 states have call predecessors, (72), 12 states have return successors, (72), 67 states have call predecessors, (72), 72 states have call successors, (72) [2023-12-21 02:21:30,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1036 transitions. [2023-12-21 02:21:30,084 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1036 transitions. Word has length 117 [2023-12-21 02:21:30,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:21:30,084 INFO L495 AbstractCegarLoop]: Abstraction has 756 states and 1036 transitions. [2023-12-21 02:21:30,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:21:30,085 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1036 transitions. [2023-12-21 02:21:30,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-21 02:21:30,085 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:21:30,085 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:21:30,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-21 02:21:30,085 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:21:30,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:21:30,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1736740787, now seen corresponding path program 1 times [2023-12-21 02:21:30,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:21:30,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444247941] [2023-12-21 02:21:30,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:30,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:21:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:30,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:21:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:30,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:21:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:30,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:21:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:30,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:21:30,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:30,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:21:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:30,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:21:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:30,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:21:30,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:30,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:21:30,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:30,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:21:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:30,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:21:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:30,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:21:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:30,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:21:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:30,734 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:21:30,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:21:30,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444247941] [2023-12-21 02:21:30,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444247941] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:21:30,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:21:30,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-21 02:21:30,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52896676] [2023-12-21 02:21:30,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:21:30,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 02:21:30,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:21:30,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 02:21:30,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-21 02:21:30,735 INFO L87 Difference]: Start difference. First operand 756 states and 1036 transitions. Second operand has 10 states, 8 states have (on average 7.5) internal successors, (60), 10 states have internal predecessors, (60), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2023-12-21 02:21:31,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:21:31,698 INFO L93 Difference]: Finished difference Result 1865 states and 2549 transitions. [2023-12-21 02:21:31,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 02:21:31,699 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.5) internal successors, (60), 10 states have internal predecessors, (60), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) Word has length 117 [2023-12-21 02:21:31,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:21:31,702 INFO L225 Difference]: With dead ends: 1865 [2023-12-21 02:21:31,702 INFO L226 Difference]: Without dead ends: 1110 [2023-12-21 02:21:31,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2023-12-21 02:21:31,703 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 677 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-21 02:21:31,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 484 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-21 02:21:31,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2023-12-21 02:21:31,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 771. [2023-12-21 02:21:31,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 686 states have (on average 1.3265306122448979) internal successors, (910), 691 states have internal predecessors, (910), 72 states have call successors, (72), 12 states have call predecessors, (72), 12 states have return successors, (72), 67 states have call predecessors, (72), 72 states have call successors, (72) [2023-12-21 02:21:31,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1054 transitions. [2023-12-21 02:21:31,777 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1054 transitions. Word has length 117 [2023-12-21 02:21:31,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:21:31,778 INFO L495 AbstractCegarLoop]: Abstraction has 771 states and 1054 transitions. [2023-12-21 02:21:31,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.5) internal successors, (60), 10 states have internal predecessors, (60), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2023-12-21 02:21:31,778 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1054 transitions. [2023-12-21 02:21:31,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-21 02:21:31,779 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:21:31,779 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:21:31,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-21 02:21:31,779 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:21:31,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:21:31,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1343713777, now seen corresponding path program 1 times [2023-12-21 02:21:31,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:21:31,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591937312] [2023-12-21 02:21:31,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:31,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:21:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:32,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:21:32,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:32,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:21:32,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:32,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:21:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:32,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:21:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:32,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:21:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:32,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:21:32,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:32,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:21:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:32,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:21:32,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:32,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:21:32,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:32,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:21:32,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:32,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:21:32,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:32,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:21:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:32,249 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:21:32,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:21:32,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591937312] [2023-12-21 02:21:32,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591937312] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:21:32,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:21:32,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-21 02:21:32,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768565] [2023-12-21 02:21:32,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:21:32,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-21 02:21:32,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:21:32,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-21 02:21:32,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2023-12-21 02:21:32,250 INFO L87 Difference]: Start difference. First operand 771 states and 1054 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:21:33,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:21:33,062 INFO L93 Difference]: Finished difference Result 1797 states and 2452 transitions. [2023-12-21 02:21:33,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-21 02:21:33,063 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2023-12-21 02:21:33,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:21:33,065 INFO L225 Difference]: With dead ends: 1797 [2023-12-21 02:21:33,065 INFO L226 Difference]: Without dead ends: 1027 [2023-12-21 02:21:33,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2023-12-21 02:21:33,067 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 517 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 1326 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 1281 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-21 02:21:33,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 1281 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1326 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-21 02:21:33,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2023-12-21 02:21:33,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 775. [2023-12-21 02:21:33,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 690 states have (on average 1.3246376811594203) internal successors, (914), 695 states have internal predecessors, (914), 72 states have call successors, (72), 12 states have call predecessors, (72), 12 states have return successors, (72), 67 states have call predecessors, (72), 72 states have call successors, (72) [2023-12-21 02:21:33,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1058 transitions. [2023-12-21 02:21:33,172 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1058 transitions. Word has length 117 [2023-12-21 02:21:33,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:21:33,173 INFO L495 AbstractCegarLoop]: Abstraction has 775 states and 1058 transitions. [2023-12-21 02:21:33,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:21:33,173 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1058 transitions. [2023-12-21 02:21:33,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-21 02:21:33,173 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:21:33,174 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:21:33,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-21 02:21:33,174 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:21:33,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:21:33,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1714108533, now seen corresponding path program 1 times [2023-12-21 02:21:33,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:21:33,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110523586] [2023-12-21 02:21:33,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:33,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:21:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:33,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:21:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:33,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:21:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:33,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:21:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:33,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:21:33,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:33,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:21:33,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:33,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:21:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:33,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:21:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:33,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:21:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:33,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:21:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:33,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:21:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:33,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:21:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:33,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:21:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:33,871 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:21:33,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:21:33,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110523586] [2023-12-21 02:21:33,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110523586] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:21:33,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:21:33,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-21 02:21:33,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494440004] [2023-12-21 02:21:33,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:21:33,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-21 02:21:33,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:21:33,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-21 02:21:33,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2023-12-21 02:21:33,873 INFO L87 Difference]: Start difference. First operand 775 states and 1058 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:21:35,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:21:35,813 INFO L93 Difference]: Finished difference Result 1852 states and 2518 transitions. [2023-12-21 02:21:35,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-21 02:21:35,814 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2023-12-21 02:21:35,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:21:35,817 INFO L225 Difference]: With dead ends: 1852 [2023-12-21 02:21:35,817 INFO L226 Difference]: Without dead ends: 1078 [2023-12-21 02:21:35,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=235, Invalid=1025, Unknown=0, NotChecked=0, Total=1260 [2023-12-21 02:21:35,819 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 489 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 1474 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:21:35,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 1121 Invalid, 1554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1474 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-21 02:21:35,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2023-12-21 02:21:35,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 842. [2023-12-21 02:21:35,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 742 states have (on average 1.3113207547169812) internal successors, (973), 749 states have internal predecessors, (973), 84 states have call successors, (84), 15 states have call predecessors, (84), 15 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84) [2023-12-21 02:21:35,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1141 transitions. [2023-12-21 02:21:35,904 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1141 transitions. Word has length 117 [2023-12-21 02:21:35,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:21:35,904 INFO L495 AbstractCegarLoop]: Abstraction has 842 states and 1141 transitions. [2023-12-21 02:21:35,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:21:35,905 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1141 transitions. [2023-12-21 02:21:35,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-21 02:21:35,905 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:21:35,905 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:21:35,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-21 02:21:35,906 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:21:35,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:21:35,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1321081523, now seen corresponding path program 1 times [2023-12-21 02:21:35,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:21:35,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042454238] [2023-12-21 02:21:35,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:35,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:21:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:36,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:21:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:36,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:21:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:36,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:21:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:36,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:21:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:36,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:21:36,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:36,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:21:36,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:36,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:21:36,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:36,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:21:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:36,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:21:36,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:36,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:21:36,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:36,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:21:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:36,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:21:36,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:36,126 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:21:36,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:21:36,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042454238] [2023-12-21 02:21:36,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042454238] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:21:36,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:21:36,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:21:36,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420814274] [2023-12-21 02:21:36,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:21:36,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:21:36,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:21:36,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:21:36,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:21:36,128 INFO L87 Difference]: Start difference. First operand 842 states and 1141 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:21:36,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:21:36,418 INFO L93 Difference]: Finished difference Result 1974 states and 2693 transitions. [2023-12-21 02:21:36,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 02:21:36,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2023-12-21 02:21:36,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:21:36,440 INFO L225 Difference]: With dead ends: 1974 [2023-12-21 02:21:36,440 INFO L226 Difference]: Without dead ends: 1149 [2023-12-21 02:21:36,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:21:36,442 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 99 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:21:36,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 512 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:21:36,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2023-12-21 02:21:36,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 922. [2023-12-21 02:21:36,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 822 states have (on average 1.3102189781021898) internal successors, (1077), 829 states have internal predecessors, (1077), 84 states have call successors, (84), 15 states have call predecessors, (84), 15 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84) [2023-12-21 02:21:36,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1245 transitions. [2023-12-21 02:21:36,519 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1245 transitions. Word has length 117 [2023-12-21 02:21:36,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:21:36,520 INFO L495 AbstractCegarLoop]: Abstraction has 922 states and 1245 transitions. [2023-12-21 02:21:36,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:21:36,520 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1245 transitions. [2023-12-21 02:21:36,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-21 02:21:36,520 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:21:36,520 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:21:36,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-21 02:21:36,521 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:21:36,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:21:36,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1151636880, now seen corresponding path program 1 times [2023-12-21 02:21:36,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:21:36,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061391123] [2023-12-21 02:21:36,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:36,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:21:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:37,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:21:37,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:37,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:21:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:37,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:21:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:37,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:21:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:37,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:21:37,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:37,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:21:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:37,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:21:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:37,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:21:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:37,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:21:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:37,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:21:37,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:37,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:21:37,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:37,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:21:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:37,187 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:21:37,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:21:37,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061391123] [2023-12-21 02:21:37,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061391123] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:21:37,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:21:37,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-21 02:21:37,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506387774] [2023-12-21 02:21:37,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:21:37,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-21 02:21:37,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:21:37,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-21 02:21:37,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2023-12-21 02:21:37,188 INFO L87 Difference]: Start difference. First operand 922 states and 1245 transitions. Second operand has 13 states, 12 states have (on average 5.166666666666667) internal successors, (62), 13 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:21:37,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:21:37,748 INFO L93 Difference]: Finished difference Result 1611 states and 2194 transitions. [2023-12-21 02:21:37,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-21 02:21:37,749 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.166666666666667) internal successors, (62), 13 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2023-12-21 02:21:37,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:21:37,751 INFO L225 Difference]: With dead ends: 1611 [2023-12-21 02:21:37,751 INFO L226 Difference]: Without dead ends: 1051 [2023-12-21 02:21:37,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2023-12-21 02:21:37,753 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 172 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 02:21:37,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1345 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 02:21:37,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2023-12-21 02:21:37,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 934. [2023-12-21 02:21:37,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 834 states have (on average 1.3057553956834533) internal successors, (1089), 841 states have internal predecessors, (1089), 84 states have call successors, (84), 15 states have call predecessors, (84), 15 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84) [2023-12-21 02:21:37,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1257 transitions. [2023-12-21 02:21:37,830 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1257 transitions. Word has length 119 [2023-12-21 02:21:37,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:21:37,830 INFO L495 AbstractCegarLoop]: Abstraction has 934 states and 1257 transitions. [2023-12-21 02:21:37,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.166666666666667) internal successors, (62), 13 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:21:37,831 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1257 transitions. [2023-12-21 02:21:37,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-21 02:21:37,831 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:21:37,831 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:21:37,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-21 02:21:37,831 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:21:37,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:21:37,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1000172455, now seen corresponding path program 1 times [2023-12-21 02:21:37,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:21:37,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703311906] [2023-12-21 02:21:37,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:37,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:21:37,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:38,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:21:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:38,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:21:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:38,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:21:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:38,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:21:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:38,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:21:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:38,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:21:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:38,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:21:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:38,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:21:38,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:38,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:21:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:38,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:21:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:38,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:21:38,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:38,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:21:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:38,322 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:21:38,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:21:38,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703311906] [2023-12-21 02:21:38,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703311906] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:21:38,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:21:38,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 02:21:38,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292160661] [2023-12-21 02:21:38,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:21:38,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 02:21:38,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:21:38,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 02:21:38,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:21:38,323 INFO L87 Difference]: Start difference. First operand 934 states and 1257 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:21:38,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:21:38,599 INFO L93 Difference]: Finished difference Result 1551 states and 2098 transitions. [2023-12-21 02:21:38,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:21:38,599 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2023-12-21 02:21:38,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:21:38,602 INFO L225 Difference]: With dead ends: 1551 [2023-12-21 02:21:38,602 INFO L226 Difference]: Without dead ends: 979 [2023-12-21 02:21:38,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:21:38,603 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 65 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:21:38,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 550 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:21:38,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2023-12-21 02:21:38,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 929. [2023-12-21 02:21:38,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 829 states have (on average 1.3003618817852836) internal successors, (1078), 836 states have internal predecessors, (1078), 84 states have call successors, (84), 15 states have call predecessors, (84), 15 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84) [2023-12-21 02:21:38,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1246 transitions. [2023-12-21 02:21:38,676 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1246 transitions. Word has length 119 [2023-12-21 02:21:38,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:21:38,676 INFO L495 AbstractCegarLoop]: Abstraction has 929 states and 1246 transitions. [2023-12-21 02:21:38,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:21:38,676 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1246 transitions. [2023-12-21 02:21:38,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-21 02:21:38,677 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:21:38,677 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:21:38,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-21 02:21:38,677 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:21:38,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:21:38,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1697668829, now seen corresponding path program 1 times [2023-12-21 02:21:38,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:21:38,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839448689] [2023-12-21 02:21:38,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:38,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:21:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:38,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:21:38,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:38,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:21:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:38,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:21:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:38,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:21:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:38,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:21:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:38,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:21:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:38,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:21:38,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:38,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:21:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:38,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:21:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:38,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:21:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:38,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:21:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:38,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:21:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:38,770 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:21:38,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:21:38,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839448689] [2023-12-21 02:21:38,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839448689] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:21:38,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:21:38,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:21:38,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212462770] [2023-12-21 02:21:38,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:21:38,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:21:38,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:21:38,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:21:38,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:21:38,772 INFO L87 Difference]: Start difference. First operand 929 states and 1246 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:21:38,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:21:38,862 INFO L93 Difference]: Finished difference Result 1941 states and 2610 transitions. [2023-12-21 02:21:38,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:21:38,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2023-12-21 02:21:38,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:21:38,865 INFO L225 Difference]: With dead ends: 1941 [2023-12-21 02:21:38,865 INFO L226 Difference]: Without dead ends: 1029 [2023-12-21 02:21:38,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:21:38,867 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 45 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:21:38,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 560 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:21:38,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2023-12-21 02:21:38,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 959. [2023-12-21 02:21:38,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 859 states have (on average 1.289871944121071) internal successors, (1108), 866 states have internal predecessors, (1108), 84 states have call successors, (84), 15 states have call predecessors, (84), 15 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84) [2023-12-21 02:21:38,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1276 transitions. [2023-12-21 02:21:38,940 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1276 transitions. Word has length 119 [2023-12-21 02:21:38,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:21:38,940 INFO L495 AbstractCegarLoop]: Abstraction has 959 states and 1276 transitions. [2023-12-21 02:21:38,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:21:38,940 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1276 transitions. [2023-12-21 02:21:38,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-21 02:21:38,941 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:21:38,941 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:21:38,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-21 02:21:38,941 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:21:38,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:21:38,941 INFO L85 PathProgramCache]: Analyzing trace with hash -2036580968, now seen corresponding path program 1 times [2023-12-21 02:21:38,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:21:38,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178147355] [2023-12-21 02:21:38,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:38,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:21:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:39,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:21:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:39,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:21:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:39,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:21:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:39,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:21:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:39,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:21:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:39,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:21:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:39,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:21:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:39,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:21:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:39,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:21:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:39,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:21:39,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:39,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:21:39,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:39,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:21:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:39,368 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:21:39,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:21:39,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178147355] [2023-12-21 02:21:39,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178147355] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:21:39,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:21:39,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 02:21:39,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982189769] [2023-12-21 02:21:39,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:21:39,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 02:21:39,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:21:39,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 02:21:39,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:21:39,369 INFO L87 Difference]: Start difference. First operand 959 states and 1276 transitions. Second operand has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:21:39,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:21:39,628 INFO L93 Difference]: Finished difference Result 1979 states and 2638 transitions. [2023-12-21 02:21:39,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 02:21:39,629 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2023-12-21 02:21:39,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:21:39,631 INFO L225 Difference]: With dead ends: 1979 [2023-12-21 02:21:39,631 INFO L226 Difference]: Without dead ends: 1037 [2023-12-21 02:21:39,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:21:39,632 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 72 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:21:39,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 447 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:21:39,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2023-12-21 02:21:39,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 934. [2023-12-21 02:21:39,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 834 states have (on average 1.2781774580335732) internal successors, (1066), 841 states have internal predecessors, (1066), 84 states have call successors, (84), 15 states have call predecessors, (84), 15 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84) [2023-12-21 02:21:39,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1234 transitions. [2023-12-21 02:21:39,708 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1234 transitions. Word has length 121 [2023-12-21 02:21:39,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:21:39,708 INFO L495 AbstractCegarLoop]: Abstraction has 934 states and 1234 transitions. [2023-12-21 02:21:39,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:21:39,708 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1234 transitions. [2023-12-21 02:21:39,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-21 02:21:39,709 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:21:39,709 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:21:39,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-12-21 02:21:39,709 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:21:39,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:21:39,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1432878727, now seen corresponding path program 1 times [2023-12-21 02:21:39,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:21:39,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850787050] [2023-12-21 02:21:39,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:39,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:21:39,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:40,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:21:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:40,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:21:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:40,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:21:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:40,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:21:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:40,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:21:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:40,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:21:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:40,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:21:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:40,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:21:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:40,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:21:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:40,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:21:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:40,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:21:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:40,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:21:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:40,806 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:21:40,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:21:40,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850787050] [2023-12-21 02:21:40,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850787050] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:21:40,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:21:40,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-21 02:21:40,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068450807] [2023-12-21 02:21:40,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:21:40,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 02:21:40,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:21:40,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 02:21:40,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-12-21 02:21:40,808 INFO L87 Difference]: Start difference. First operand 934 states and 1234 transitions. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:21:42,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:21:42,212 INFO L93 Difference]: Finished difference Result 1850 states and 2445 transitions. [2023-12-21 02:21:42,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-21 02:21:42,212 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 123 [2023-12-21 02:21:42,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:21:42,215 INFO L225 Difference]: With dead ends: 1850 [2023-12-21 02:21:42,215 INFO L226 Difference]: Without dead ends: 1268 [2023-12-21 02:21:42,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2023-12-21 02:21:42,220 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 172 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-21 02:21:42,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 1328 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-21 02:21:42,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2023-12-21 02:21:42,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 1132. [2023-12-21 02:21:42,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 1015 states have (on average 1.2679802955665025) internal successors, (1287), 1025 states have internal predecessors, (1287), 96 states have call successors, (96), 20 states have call predecessors, (96), 20 states have return successors, (96), 86 states have call predecessors, (96), 96 states have call successors, (96) [2023-12-21 02:21:42,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1479 transitions. [2023-12-21 02:21:42,341 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1479 transitions. Word has length 123 [2023-12-21 02:21:42,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:21:42,342 INFO L495 AbstractCegarLoop]: Abstraction has 1132 states and 1479 transitions. [2023-12-21 02:21:42,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:21:42,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1479 transitions. [2023-12-21 02:21:42,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-21 02:21:42,343 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:21:42,343 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:21:42,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-21 02:21:42,343 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:21:42,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:21:42,343 INFO L85 PathProgramCache]: Analyzing trace with hash 2052741943, now seen corresponding path program 1 times [2023-12-21 02:21:42,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:21:42,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699030415] [2023-12-21 02:21:42,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:42,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:21:42,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:42,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:21:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:42,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:21:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:42,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:21:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:42,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:21:42,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:42,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:21:42,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:42,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:21:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:42,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:21:42,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:42,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:21:42,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:42,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:21:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:42,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:21:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:42,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:21:42,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:42,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:21:42,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:42,687 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:21:42,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:21:42,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699030415] [2023-12-21 02:21:42,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699030415] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:21:42,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:21:42,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 02:21:42,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385072309] [2023-12-21 02:21:42,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:21:42,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 02:21:42,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:21:42,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 02:21:42,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:21:42,688 INFO L87 Difference]: Start difference. First operand 1132 states and 1479 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:21:42,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:21:42,996 INFO L93 Difference]: Finished difference Result 2013 states and 2636 transitions. [2023-12-21 02:21:42,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 02:21:42,997 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2023-12-21 02:21:42,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:21:43,000 INFO L225 Difference]: With dead ends: 2013 [2023-12-21 02:21:43,000 INFO L226 Difference]: Without dead ends: 1233 [2023-12-21 02:21:43,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-21 02:21:43,002 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 74 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:21:43,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 613 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:21:43,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2023-12-21 02:21:43,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1120. [2023-12-21 02:21:43,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1120 states, 1003 states have (on average 1.2642073778664007) internal successors, (1268), 1013 states have internal predecessors, (1268), 96 states have call successors, (96), 20 states have call predecessors, (96), 20 states have return successors, (96), 86 states have call predecessors, (96), 96 states have call successors, (96) [2023-12-21 02:21:43,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1460 transitions. [2023-12-21 02:21:43,104 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1460 transitions. Word has length 123 [2023-12-21 02:21:43,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:21:43,104 INFO L495 AbstractCegarLoop]: Abstraction has 1120 states and 1460 transitions. [2023-12-21 02:21:43,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 02:21:43,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1460 transitions. [2023-12-21 02:21:43,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-21 02:21:43,105 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:21:43,105 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:21:43,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-21 02:21:43,105 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:21:43,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:21:43,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1158119113, now seen corresponding path program 1 times [2023-12-21 02:21:43,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:21:43,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132515915] [2023-12-21 02:21:43,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:43,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:21:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:43,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:21:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:43,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:21:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:43,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:21:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:43,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:21:43,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:43,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:21:43,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:43,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:21:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:43,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:21:43,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:43,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:21:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:43,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:21:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:43,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:21:43,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:43,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:21:43,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:43,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:21:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:43,454 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:21:43,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:21:43,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132515915] [2023-12-21 02:21:43,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132515915] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:21:43,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:21:43,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:21:43,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493990974] [2023-12-21 02:21:43,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:21:43,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:21:43,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:21:43,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:21:43,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:21:43,456 INFO L87 Difference]: Start difference. First operand 1120 states and 1460 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:21:43,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:21:43,718 INFO L93 Difference]: Finished difference Result 2011 states and 2621 transitions. [2023-12-21 02:21:43,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:21:43,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 123 [2023-12-21 02:21:43,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:21:43,721 INFO L225 Difference]: With dead ends: 2011 [2023-12-21 02:21:43,721 INFO L226 Difference]: Without dead ends: 1243 [2023-12-21 02:21:43,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:21:43,722 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 63 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:21:43,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 479 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:21:43,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2023-12-21 02:21:43,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1104. [2023-12-21 02:21:43,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 991 states have (on average 1.2613521695257315) internal successors, (1250), 1000 states have internal predecessors, (1250), 92 states have call successors, (92), 20 states have call predecessors, (92), 20 states have return successors, (92), 83 states have call predecessors, (92), 92 states have call successors, (92) [2023-12-21 02:21:43,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1434 transitions. [2023-12-21 02:21:43,813 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1434 transitions. Word has length 123 [2023-12-21 02:21:43,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:21:43,813 INFO L495 AbstractCegarLoop]: Abstraction has 1104 states and 1434 transitions. [2023-12-21 02:21:43,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:21:43,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1434 transitions. [2023-12-21 02:21:43,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-21 02:21:43,814 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:21:43,814 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:21:43,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-12-21 02:21:43,814 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:21:43,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:21:43,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1967465739, now seen corresponding path program 1 times [2023-12-21 02:21:43,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:21:43,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239465976] [2023-12-21 02:21:43,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:21:43,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:21:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:21:58,845 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 02:22:08,748 WARN L293 SmtUtils]: Spent 5.88s on a formula simplification. DAG size of input: 32 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 02:22:11,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:22:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:22:11,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:22:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:22:11,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:22:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:22:11,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:22:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:22:11,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:22:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:22:12,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:22:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:22:12,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:22:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:22:12,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:22:12,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:22:12,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 02:22:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:22:12,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:22:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:22:12,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 02:22:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:22:12,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:22:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:22:12,117 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 15 proven. 18 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-12-21 02:22:12,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:22:12,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239465976] [2023-12-21 02:22:12,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239465976] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 02:22:12,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399047670] [2023-12-21 02:22:12,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:22:12,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:22:12,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:22:12,120 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-21 02:22:12,126 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-21 02:22:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:22:12,950 INFO L262 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 99 conjunts are in the unsatisfiable core [2023-12-21 02:22:12,963 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:22:13,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:22:13,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 15 [2023-12-21 02:22:13,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-21 02:22:13,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:22:13,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2023-12-21 02:22:14,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:22:14,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2023-12-21 02:22:14,137 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:22:14,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2023-12-21 02:22:14,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:22:14,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2023-12-21 02:22:14,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:22:14,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 37 [2023-12-21 02:22:14,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 97 [2023-12-21 02:22:14,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 111 [2023-12-21 02:22:14,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 42 [2023-12-21 02:22:16,306 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:22:16,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 77 [2023-12-21 02:22:16,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:22:16,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 93 treesize of output 73 [2023-12-21 02:22:21,058 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:22:21,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 99 treesize of output 47 [2023-12-21 02:22:21,250 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 144 proven. 60 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-21 02:22:21,250 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 02:22:39,493 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-21 02:22:39,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399047670] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 02:22:39,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-21 02:22:39,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [29, 34] total 72 [2023-12-21 02:22:39,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377773429] [2023-12-21 02:22:39,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:22:39,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-21 02:22:39,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:22:39,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-21 02:22:39,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=512, Invalid=4599, Unknown=1, NotChecked=0, Total=5112 [2023-12-21 02:22:39,496 INFO L87 Difference]: Start difference. First operand 1104 states and 1434 transitions. Second operand has 19 states, 19 states have (on average 3.473684210526316) internal successors, (66), 19 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:22:45,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 02:22:56,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 02:22:58,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:22:58,539 INFO L93 Difference]: Finished difference Result 2163 states and 2821 transitions. [2023-12-21 02:22:58,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-12-21 02:22:58,540 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.473684210526316) internal successors, (66), 19 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 123 [2023-12-21 02:22:58,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:22:58,548 INFO L225 Difference]: With dead ends: 2163 [2023-12-21 02:22:58,548 INFO L226 Difference]: Without dead ends: 1415 [2023-12-21 02:22:58,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 229 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2813 ImplicationChecksByTransitivity, 34.1s TimeCoverageRelationStatistics Valid=988, Invalid=8323, Unknown=1, NotChecked=0, Total=9312 [2023-12-21 02:22:58,551 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 339 mSDsluCounter, 1709 mSDsCounter, 0 mSdLazyCounter, 1838 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 1879 SdHoareTripleChecker+Invalid, 1899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2023-12-21 02:22:58,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 1879 Invalid, 1899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1838 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2023-12-21 02:22:58,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2023-12-21 02:22:58,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1129. [2023-12-21 02:22:58,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 1013 states have (on average 1.261599210266535) internal successors, (1278), 1023 states have internal predecessors, (1278), 94 states have call successors, (94), 21 states have call predecessors, (94), 21 states have return successors, (94), 84 states have call predecessors, (94), 94 states have call successors, (94) [2023-12-21 02:22:58,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1466 transitions. [2023-12-21 02:22:58,655 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1466 transitions. Word has length 123 [2023-12-21 02:22:58,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:22:58,655 INFO L495 AbstractCegarLoop]: Abstraction has 1129 states and 1466 transitions. [2023-12-21 02:22:58,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.473684210526316) internal successors, (66), 19 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-21 02:22:58,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1466 transitions. [2023-12-21 02:22:58,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-21 02:22:58,656 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:22:58,656 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 02:22:58,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-21 02:22:58,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-12-21 02:22:58,863 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:22:58,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:22:58,864 INFO L85 PathProgramCache]: Analyzing trace with hash -988106266, now seen corresponding path program 1 times [2023-12-21 02:22:58,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:22:58,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328586576] [2023-12-21 02:22:58,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:22:58,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:22:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 02:22:58,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 02:22:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 02:22:58,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 02:22:58,994 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 02:22:58,994 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 02:22:58,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-12-21 02:22:59,000 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:22:59,002 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 02:22:59,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 02:22:59 BoogieIcfgContainer [2023-12-21 02:22:59,052 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 02:22:59,052 INFO L158 Benchmark]: Toolchain (without parser) took 120019.73ms. Allocated memory was 218.1MB in the beginning and 985.7MB in the end (delta: 767.6MB). Free memory was 168.7MB in the beginning and 924.8MB in the end (delta: -756.1MB). Peak memory consumption was 579.0MB. Max. memory is 8.0GB. [2023-12-21 02:22:59,052 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 175.1MB. Free memory is still 128.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 02:22:59,053 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.83ms. Allocated memory is still 218.1MB. Free memory was 168.3MB in the beginning and 152.9MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-21 02:22:59,053 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.81ms. Allocated memory is still 218.1MB. Free memory was 152.9MB in the beginning and 149.1MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-21 02:22:59,053 INFO L158 Benchmark]: Boogie Preprocessor took 58.15ms. Allocated memory is still 218.1MB. Free memory was 149.1MB in the beginning and 144.6MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-21 02:22:59,053 INFO L158 Benchmark]: RCFGBuilder took 545.26ms. Allocated memory is still 218.1MB. Free memory was 144.6MB in the beginning and 177.8MB in the end (delta: -33.2MB). Peak memory consumption was 28.1MB. Max. memory is 8.0GB. [2023-12-21 02:22:59,053 INFO L158 Benchmark]: TraceAbstraction took 119127.43ms. Allocated memory was 218.1MB in the beginning and 985.7MB in the end (delta: 767.6MB). Free memory was 176.8MB in the beginning and 924.8MB in the end (delta: -748.0MB). Peak memory consumption was 585.6MB. Max. memory is 8.0GB. [2023-12-21 02:22:59,054 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 175.1MB. Free memory is still 128.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 236.83ms. Allocated memory is still 218.1MB. Free memory was 168.3MB in the beginning and 152.9MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.81ms. Allocated memory is still 218.1MB. Free memory was 152.9MB in the beginning and 149.1MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 58.15ms. Allocated memory is still 218.1MB. Free memory was 149.1MB in the beginning and 144.6MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 545.26ms. Allocated memory is still 218.1MB. Free memory was 144.6MB in the beginning and 177.8MB in the end (delta: -33.2MB). Peak memory consumption was 28.1MB. Max. memory is 8.0GB. * TraceAbstraction took 119127.43ms. Allocated memory was 218.1MB in the beginning and 985.7MB in the end (delta: 767.6MB). Free memory was 176.8MB in the beginning and 924.8MB in the end (delta: -748.0MB). Peak memory consumption was 585.6MB. 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryArithmeticDOUBLEoperation at line 108. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -128, 1, 1, 8, 1, 1885310857, -10, 32.6, 9.75, 5.1, 128.1, 63.9 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -128, 1, 1, 8, 1, 1885310857, -10, 32.6, 9.75, 5.1, 128.1, 63.9 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -128, 1, 1, 8, 1, 1885310857, -10, 32.6, 9.75, 5.1, 128.1, 63.9 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -128, 1, 1, 8, 1, 1885310857, -10, 32.6, 9.75, 5.1, 128.1, 63.9 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -128, 1, 1, 8, 1, 1885310857, -10, 32.6, 9.75, 5.1, 128.1, 63.9 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -128, 1, 1, 8, 1, 1885310857, -10, 32.6, 9.75, 5.1, 128.1, 63.9 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -128, 1, 1, 8, 1, 1885310857, -10, 32.6, 9.75, 5.1, 128.1, 63.9 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -128, 1, 1, 8, 1, 1885310857, -10, 32.6, 9.75, 5.1, 128.1, 63.9 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -128, 1, 1, 8, 1, 1885310857, -10, 32.6, 9.75, 5.1, 128.1, 63.9 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -128, 1, 1, 8, 1, 1885310857, -10, 32.6, 9.75, 5.1, 128.1, 63.9 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -128, 1, 1, 8, 1, 1885310857, -10, 32.6, 9.75, 5.1, 128.1, 63.9 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -128, 1, 1, 8, 1, 1885310857, -10, 32.6, 9.75, 5.1, 128.1, 63.9 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -128, 1, 1, 8, 1, 1885310857, -10, 32.6, 9.75, 5.1, 128.1, 63.9 }; [L51] signed long int last_1_WrapperStruct00_var_1_10 = -10; [L112] isInitial = 1 [L113] FCALL initially() [L114] COND TRUE 1 [L115] CALL updateLastVariables() [L105] EXPR WrapperStruct00.var_1_10 [L105] last_1_WrapperStruct00_var_1_10 = WrapperStruct00.var_1_10 [L115] RET updateLastVariables() [L116] CALL updateVariables() [L83] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L84] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L84] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L84] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L85] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L85] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L86] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L87] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L88] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L89] WrapperStruct00.var_1_7 = __VERIFIER_nondet_char() [L90] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L91] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L92] WrapperStruct00.var_1_9 = __VERIFIER_nondet_ulong() [L93] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 1073741824) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 1073741824) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L94] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L95] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L96] EXPR WrapperStruct00.var_1_12 [L96] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L96] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F [L96] EXPR WrapperStruct00.var_1_12 [L96] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L96] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L96] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L96] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L96] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L97] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L98] EXPR WrapperStruct00.var_1_13 [L98] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L98] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F [L98] EXPR WrapperStruct00.var_1_13 [L98] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L98] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L98] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L98] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L98] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L99] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L100] EXPR WrapperStruct00.var_1_14 [L100] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L100] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F [L100] EXPR WrapperStruct00.var_1_14 [L100] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L100] EXPR (WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L100] EXPR (WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L100] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L100] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L101] WrapperStruct00.var_1_15 = __VERIFIER_nondet_double() [L102] EXPR WrapperStruct00.var_1_15 [L102] EXPR WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L102] EXPR WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F [L102] EXPR WrapperStruct00.var_1_15 [L102] EXPR WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L102] EXPR (WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L102] EXPR (WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L102] CALL assume_abort_if_not((WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L102] RET assume_abort_if_not((WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L116] RET updateVariables() [L117] CALL step() [L55] WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L55] COND FALSE !(WrapperStruct00.var_1_2) [L58] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L58] EXPR ((last_1_WrapperStruct00_var_1_10) > (WrapperStruct00.var_1_9)) ? (last_1_WrapperStruct00_var_1_10) : (WrapperStruct00.var_1_9) [L58] EXPR ((last_1_WrapperStruct00_var_1_10) > (WrapperStruct00.var_1_9)) ? (last_1_WrapperStruct00_var_1_10) : (WrapperStruct00.var_1_9) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L58] WrapperStruct00.var_1_8 = ((((last_1_WrapperStruct00_var_1_10) > (WrapperStruct00.var_1_9)) ? (last_1_WrapperStruct00_var_1_10) : (WrapperStruct00.var_1_9))) [L60] WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L60] COND FALSE !(WrapperStruct00.var_1_2) [L63] EXPR WrapperStruct00.var_1_2 [L63] unsigned char stepLocal_1 = WrapperStruct00.var_1_2; [L64] EXPR WrapperStruct00.var_1_10 [L64] signed long int stepLocal_0 = WrapperStruct00.var_1_10; [L65] stepLocal_1 || ((~ WrapperStruct00.var_1_10) >= WrapperStruct00.var_1_10) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10, stepLocal_0=-10, stepLocal_1=0] [L65] stepLocal_1 || ((~ WrapperStruct00.var_1_10) >= WrapperStruct00.var_1_10) [L65] EXPR WrapperStruct00.var_1_10 [L65] EXPR WrapperStruct00.var_1_10 [L65] stepLocal_1 || ((~ WrapperStruct00.var_1_10) >= WrapperStruct00.var_1_10) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10, stepLocal_0=-10, stepLocal_1=0] [L65] COND TRUE stepLocal_1 || ((~ WrapperStruct00.var_1_10) >= WrapperStruct00.var_1_10) [L66] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L66] COND FALSE !(stepLocal_0 < WrapperStruct00.var_1_8) [L71] WrapperStruct00.var_1_1 = 2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L76] EXPR WrapperStruct00.var_1_1 [L76] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L76] COND TRUE WrapperStruct00.var_1_1 >= WrapperStruct00.var_1_1 [L77] EXPR WrapperStruct00.var_1_12 [L77] EXPR WrapperStruct00.var_1_13 [L77] EXPR WrapperStruct00.var_1_14 [L77] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L77] EXPR (((WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_15) [L77] EXPR WrapperStruct00.var_1_13 [L77] EXPR WrapperStruct00.var_1_14 [L77] EXPR (((WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_15) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10, stepLocal_0=-10, stepLocal_1=0] [L77] WrapperStruct00.var_1_11 = (WrapperStruct00.var_1_12 - (((((WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_15)))) [L117] RET step() [L118] CALL, EXPR property() [L108] EXPR WrapperStruct00.var_1_2 [L108] EXPR WrapperStruct00.var_1_2 || ((~ WrapperStruct00.var_1_10) >= WrapperStruct00.var_1_10) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L108] EXPR WrapperStruct00.var_1_2 || ((~ WrapperStruct00.var_1_10) >= WrapperStruct00.var_1_10) [L108] EXPR WrapperStruct00.var_1_10 [L108] EXPR WrapperStruct00.var_1_10 [L108] EXPR WrapperStruct00.var_1_2 || ((~ WrapperStruct00.var_1_10) >= WrapperStruct00.var_1_10) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L108] EXPR (WrapperStruct00.var_1_2 || ((~ WrapperStruct00.var_1_10) >= WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_10 < WrapperStruct00.var_1_8) ? ((! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_1 == ((signed char) 2))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) [L108] EXPR WrapperStruct00.var_1_10 [L108] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L108] EXPR (WrapperStruct00.var_1_10 < WrapperStruct00.var_1_8) ? ((! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_1 == ((signed char) 2)) [L108] EXPR WrapperStruct00.var_1_1 [L108] EXPR (WrapperStruct00.var_1_10 < WrapperStruct00.var_1_8) ? ((! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_1 == ((signed char) 2)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L108] EXPR (WrapperStruct00.var_1_2 || ((~ WrapperStruct00.var_1_10) >= WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_10 < WrapperStruct00.var_1_8) ? ((! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_1 == ((signed char) 2))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L108] EXPR ((WrapperStruct00.var_1_2 || ((~ WrapperStruct00.var_1_10) >= WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_10 < WrapperStruct00.var_1_8) ? ((! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_1 == ((signed char) 2))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_8 == ((unsigned long int) ((1514707036u + ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9)))) - last_1_WrapperStruct00_var_1_10))) : (WrapperStruct00.var_1_8 == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > (WrapperStruct00.var_1_9)) ? (last_1_WrapperStruct00_var_1_10) : (WrapperStruct00.var_1_9)))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L108] EXPR ((WrapperStruct00.var_1_2 || ((~ WrapperStruct00.var_1_10) >= WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_10 < WrapperStruct00.var_1_8) ? ((! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_1 == ((signed char) 2))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_8 == ((unsigned long int) ((1514707036u + ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9)))) - last_1_WrapperStruct00_var_1_10))) : (WrapperStruct00.var_1_8 == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > (WrapperStruct00.var_1_9)) ? (last_1_WrapperStruct00_var_1_10) : (WrapperStruct00.var_1_9)))))) [L108] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L108] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_8 == ((unsigned long int) ((1514707036u + ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9)))) - last_1_WrapperStruct00_var_1_10))) : (WrapperStruct00.var_1_8 == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > (WrapperStruct00.var_1_9)) ? (last_1_WrapperStruct00_var_1_10) : (WrapperStruct00.var_1_9))))) [L108] EXPR WrapperStruct00.var_1_8 [L108] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L108] EXPR ((last_1_WrapperStruct00_var_1_10) > (WrapperStruct00.var_1_9)) ? (last_1_WrapperStruct00_var_1_10) : (WrapperStruct00.var_1_9) [L108] EXPR ((last_1_WrapperStruct00_var_1_10) > (WrapperStruct00.var_1_9)) ? (last_1_WrapperStruct00_var_1_10) : (WrapperStruct00.var_1_9) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L108] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_8 == ((unsigned long int) ((1514707036u + ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9)))) - last_1_WrapperStruct00_var_1_10))) : (WrapperStruct00.var_1_8 == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > (WrapperStruct00.var_1_9)) ? (last_1_WrapperStruct00_var_1_10) : (WrapperStruct00.var_1_9))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L108] EXPR ((WrapperStruct00.var_1_2 || ((~ WrapperStruct00.var_1_10) >= WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_10 < WrapperStruct00.var_1_8) ? ((! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_1 == ((signed char) 2))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_8 == ((unsigned long int) ((1514707036u + ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9)))) - last_1_WrapperStruct00_var_1_10))) : (WrapperStruct00.var_1_8 == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > (WrapperStruct00.var_1_9)) ? (last_1_WrapperStruct00_var_1_10) : (WrapperStruct00.var_1_9)))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L108] EXPR (((WrapperStruct00.var_1_2 || ((~ WrapperStruct00.var_1_10) >= WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_10 < WrapperStruct00.var_1_8) ? ((! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_1 == ((signed char) 2))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_8 == ((unsigned long int) ((1514707036u + ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9)))) - last_1_WrapperStruct00_var_1_10))) : (WrapperStruct00.var_1_8 == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > (WrapperStruct00.var_1_9)) ? (last_1_WrapperStruct00_var_1_10) : (WrapperStruct00.var_1_9))))))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_10 == ((signed long int) (WrapperStruct00.var_1_8 + ((((WrapperStruct00.var_1_7) < 0 ) ? -(WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_7)))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L108] EXPR (((WrapperStruct00.var_1_2 || ((~ WrapperStruct00.var_1_10) >= WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_10 < WrapperStruct00.var_1_8) ? ((! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_1 == ((signed char) 2))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_8 == ((unsigned long int) ((1514707036u + ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9)))) - last_1_WrapperStruct00_var_1_10))) : (WrapperStruct00.var_1_8 == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > (WrapperStruct00.var_1_9)) ? (last_1_WrapperStruct00_var_1_10) : (WrapperStruct00.var_1_9))))))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_10 == ((signed long int) (WrapperStruct00.var_1_8 + ((((WrapperStruct00.var_1_7) < 0 ) ? -(WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_7)))))) : 1) [L108] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L108] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_10 == ((signed long int) (WrapperStruct00.var_1_8 + ((((WrapperStruct00.var_1_7) < 0 ) ? -(WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_7)))))) : 1 [L108] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_10 == ((signed long int) (WrapperStruct00.var_1_8 + ((((WrapperStruct00.var_1_7) < 0 ) ? -(WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_7)))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L108] EXPR (((WrapperStruct00.var_1_2 || ((~ WrapperStruct00.var_1_10) >= WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_10 < WrapperStruct00.var_1_8) ? ((! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_1 == ((signed char) 2))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_8 == ((unsigned long int) ((1514707036u + ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9)))) - last_1_WrapperStruct00_var_1_10))) : (WrapperStruct00.var_1_8 == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > (WrapperStruct00.var_1_9)) ? (last_1_WrapperStruct00_var_1_10) : (WrapperStruct00.var_1_9))))))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_10 == ((signed long int) (WrapperStruct00.var_1_8 + ((((WrapperStruct00.var_1_7) < 0 ) ? -(WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_7)))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L108] EXPR ((((WrapperStruct00.var_1_2 || ((~ WrapperStruct00.var_1_10) >= WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_10 < WrapperStruct00.var_1_8) ? ((! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_1 == ((signed char) 2))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_8 == ((unsigned long int) ((1514707036u + ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9)))) - last_1_WrapperStruct00_var_1_10))) : (WrapperStruct00.var_1_8 == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > (WrapperStruct00.var_1_9)) ? (last_1_WrapperStruct00_var_1_10) : (WrapperStruct00.var_1_9))))))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_10 == ((signed long int) (WrapperStruct00.var_1_8 + ((((WrapperStruct00.var_1_7) < 0 ) ? -(WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_7)))))) : 1)) && ((WrapperStruct00.var_1_1 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_12 - (((((WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_15)))))) : (WrapperStruct00.var_1_11 == ((double) ((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_13)))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L108] EXPR ((((WrapperStruct00.var_1_2 || ((~ WrapperStruct00.var_1_10) >= WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_10 < WrapperStruct00.var_1_8) ? ((! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_1 == ((signed char) 2))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_8 == ((unsigned long int) ((1514707036u + ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9)))) - last_1_WrapperStruct00_var_1_10))) : (WrapperStruct00.var_1_8 == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > (WrapperStruct00.var_1_9)) ? (last_1_WrapperStruct00_var_1_10) : (WrapperStruct00.var_1_9))))))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_10 == ((signed long int) (WrapperStruct00.var_1_8 + ((((WrapperStruct00.var_1_7) < 0 ) ? -(WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_7)))))) : 1)) && ((WrapperStruct00.var_1_1 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_12 - (((((WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_15)))))) : (WrapperStruct00.var_1_11 == ((double) ((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_13)))))) [L108] EXPR WrapperStruct00.var_1_1 [L108] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L108] EXPR (WrapperStruct00.var_1_1 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_12 - (((((WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_15)))))) : (WrapperStruct00.var_1_11 == ((double) ((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_13))))) [L108] EXPR WrapperStruct00.var_1_11 [L108] EXPR WrapperStruct00.var_1_12 [L108] EXPR WrapperStruct00.var_1_13 [L108] EXPR WrapperStruct00.var_1_14 [L108] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L108] EXPR (((WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_15) [L108] EXPR WrapperStruct00.var_1_13 [L108] EXPR WrapperStruct00.var_1_14 [L108] EXPR (((WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_15) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L108] EXPR (WrapperStruct00.var_1_1 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_12 - (((((WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_15)))))) : (WrapperStruct00.var_1_11 == ((double) ((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_13))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L108] EXPR ((((WrapperStruct00.var_1_2 || ((~ WrapperStruct00.var_1_10) >= WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_10 < WrapperStruct00.var_1_8) ? ((! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_1 == ((signed char) 2))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_8 == ((unsigned long int) ((1514707036u + ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9)))) - last_1_WrapperStruct00_var_1_10))) : (WrapperStruct00.var_1_8 == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > (WrapperStruct00.var_1_9)) ? (last_1_WrapperStruct00_var_1_10) : (WrapperStruct00.var_1_9))))))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_10 == ((signed long int) (WrapperStruct00.var_1_8 + ((((WrapperStruct00.var_1_7) < 0 ) ? -(WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_7)))))) : 1)) && ((WrapperStruct00.var_1_1 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_12 - (((((WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_15)))))) : (WrapperStruct00.var_1_11 == ((double) ((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_13)))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L108-L109] return ((((WrapperStruct00.var_1_2 || ((~ WrapperStruct00.var_1_10) >= WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_10 < WrapperStruct00.var_1_8) ? ((! WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : 1) : (WrapperStruct00.var_1_1 == ((signed char) 2))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_8 == ((unsigned long int) ((1514707036u + ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9)))) - last_1_WrapperStruct00_var_1_10))) : (WrapperStruct00.var_1_8 == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > (WrapperStruct00.var_1_9)) ? (last_1_WrapperStruct00_var_1_10) : (WrapperStruct00.var_1_9))))))) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_10 == ((signed long int) (WrapperStruct00.var_1_8 + ((((WrapperStruct00.var_1_7) < 0 ) ? -(WrapperStruct00.var_1_7) : (WrapperStruct00.var_1_7)))))) : 1)) && ((WrapperStruct00.var_1_1 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_11 == ((double) (WrapperStruct00.var_1_12 - (((((WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)) > (WrapperStruct00.var_1_15)) ? ((WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_15)))))) : (WrapperStruct00.var_1_11 == ((double) ((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_13)))))) ; [L118] RET, EXPR property() [L118] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L19] reach_error() VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 106 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 119.0s, OverallIterations: 35, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 43.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8411 SdHoareTripleChecker+Valid, 25.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8400 mSDsluCounter, 26512 SdHoareTripleChecker+Invalid, 23.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21380 mSDsCounter, 1280 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26046 IncrementalHoareTripleChecker+Invalid, 27326 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1280 mSolverCounterUnsat, 5132 mSDtfsCounter, 26046 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1837 GetRequests, 1359 SyntacticMatches, 2 SemanticMatches, 476 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4004 ImplicationChecksByTransitivity, 39.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1132occurred in iteration=31, InterpolantAutomatonStates: 395, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 34 MinimizatonAttempts, 6195 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 71.6s InterpolantComputationTime, 4189 NumberOfCodeBlocks, 4189 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 4153 ConstructedInterpolants, 0 QuantifiedInterpolants, 49433 SizeOfPredicates, 29 NumberOfNonLiveVariables, 424 ConjunctsInSsa, 99 ConjunctsInUnsatCore, 36 InterpolantComputations, 34 PerfectInterpolantSequences, 9426/9504 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-21 02:22:59,084 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...