/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-97.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 02:29:51,586 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 02:29:51,625 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:29:51,628 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 02:29:51,629 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 02:29:51,642 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 02:29:51,643 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 02:29:51,643 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 02:29:51,643 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 02:29:51,648 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 02:29:51,648 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 02:29:51,649 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 02:29:51,649 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 02:29:51,652 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 02:29:51,652 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 02:29:51,653 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 02:29:51,653 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 02:29:51,654 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 02:29:51,654 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 02:29:51,655 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 02:29:51,655 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 02:29:51,655 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 02:29:51,656 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 02:29:51,656 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 02:29:51,656 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 02:29:51,656 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 02:29:51,656 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 02:29:51,656 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 02:29:51,657 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 02:29:51,657 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 02:29:51,658 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 02:29:51,658 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 02:29:51,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 02:29:51,658 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 02:29:51,658 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 02:29:51,658 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 02:29:51,659 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 02:29:51,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 02:29:51,659 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 02:29:51,659 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 02:29:51,659 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 02:29:51,659 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 02:29:51,659 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 02:29:51,660 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:29:51,840 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 02:29:51,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 02:29:51,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 02:29:51,862 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 02:29:51,863 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 02:29:51,864 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-97.i [2023-12-21 02:29:52,940 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 02:29:53,158 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 02:29:53,159 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-97.i [2023-12-21 02:29:53,168 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed2f10e9d/18b56419fc3a42adb13750dd9d022279/FLAG27c44ceff [2023-12-21 02:29:53,181 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed2f10e9d/18b56419fc3a42adb13750dd9d022279 [2023-12-21 02:29:53,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 02:29:53,185 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 02:29:53,193 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 02:29:53,201 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 02:29:53,205 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 02:29:53,205 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:29:53" (1/1) ... [2023-12-21 02:29:53,206 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@301bcec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:29:53, skipping insertion in model container [2023-12-21 02:29:53,206 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:29:53" (1/1) ... [2023-12-21 02:29:53,223 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 02:29:53,321 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-97.i[916,929] [2023-12-21 02:29:53,361 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 02:29:53,373 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 02:29:53,381 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-97.i[916,929] [2023-12-21 02:29:53,404 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 02:29:53,419 INFO L206 MainTranslator]: Completed translation [2023-12-21 02:29:53,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:29:53 WrapperNode [2023-12-21 02:29:53,420 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 02:29:53,421 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 02:29:53,421 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 02:29:53,421 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 02:29:53,425 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:29:53" (1/1) ... [2023-12-21 02:29:53,434 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:29:53" (1/1) ... [2023-12-21 02:29:53,459 INFO L138 Inliner]: procedures = 29, calls = 145, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 418 [2023-12-21 02:29:53,459 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 02:29:53,460 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 02:29:53,460 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 02:29:53,460 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 02:29:53,474 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:29:53" (1/1) ... [2023-12-21 02:29:53,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:29:53" (1/1) ... [2023-12-21 02:29:53,482 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:29:53" (1/1) ... [2023-12-21 02:29:53,500 INFO L175 MemorySlicer]: Split 116 memory accesses to 2 slices as follows [2, 114]. 98 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 15]. The 19 writes are split as follows [0, 19]. [2023-12-21 02:29:53,501 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:29:53" (1/1) ... [2023-12-21 02:29:53,501 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:29:53" (1/1) ... [2023-12-21 02:29:53,520 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:29:53" (1/1) ... [2023-12-21 02:29:53,523 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:29:53" (1/1) ... [2023-12-21 02:29:53,524 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:29:53" (1/1) ... [2023-12-21 02:29:53,525 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:29:53" (1/1) ... [2023-12-21 02:29:53,534 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 02:29:53,535 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 02:29:53,535 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 02:29:53,535 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 02:29:53,536 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:29:53" (1/1) ... [2023-12-21 02:29:53,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 02:29:53,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:29:53,568 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:29:53,604 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:29:53,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 02:29:53,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-21 02:29:53,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-21 02:29:53,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 02:29:53,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 02:29:53,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-21 02:29:53,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-21 02:29:53,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 02:29:53,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 02:29:53,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-21 02:29:53,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-21 02:29:53,626 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 02:29:53,626 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 02:29:53,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 02:29:53,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 02:29:53,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 02:29:53,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 02:29:53,712 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 02:29:53,714 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 02:29:54,112 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 02:29:54,164 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 02:29:54,164 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 02:29:54,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:29:54 BoogieIcfgContainer [2023-12-21 02:29:54,164 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 02:29:54,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 02:29:54,166 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 02:29:54,169 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 02:29:54,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 02:29:53" (1/3) ... [2023-12-21 02:29:54,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bab223a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:29:54, skipping insertion in model container [2023-12-21 02:29:54,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:29:53" (2/3) ... [2023-12-21 02:29:54,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bab223a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:29:54, skipping insertion in model container [2023-12-21 02:29:54,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:29:54" (3/3) ... [2023-12-21 02:29:54,171 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-97.i [2023-12-21 02:29:54,184 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 02:29:54,185 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 02:29:54,234 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 02:29:54,241 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;@7228ce7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 02:29:54,241 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 02:29:54,253 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 74 states have internal predecessors, (104), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 02:29:54,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-21 02:29:54,271 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:29:54,272 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:54,272 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:29:54,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:29:54,281 INFO L85 PathProgramCache]: Analyzing trace with hash 474665468, now seen corresponding path program 1 times [2023-12-21 02:29:54,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:29:54,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897733318] [2023-12-21 02:29:54,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:29:54,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:29:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:54,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:29:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:54,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:29:54,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:54,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:29:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:54,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:29:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:54,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:29:54,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:54,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:29:54,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:54,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:29:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:54,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:29:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:54,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:29:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:54,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:29:54,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:54,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:29:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:54,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:29:54,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:54,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:29:54,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:54,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:29:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:54,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 02:29:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:54,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 02:29:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:54,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:29:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:54,636 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:29:54,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:29:54,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897733318] [2023-12-21 02:29:54,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897733318] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:29:54,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:29:54,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 02:29:54,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496822543] [2023-12-21 02:29:54,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:29:54,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 02:29:54,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:29:54,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 02:29:54,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 02:29:54,675 INFO L87 Difference]: Start difference. First operand has 93 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 74 states have internal predecessors, (104), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-21 02:29:54,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:29:54,727 INFO L93 Difference]: Finished difference Result 183 states and 291 transitions. [2023-12-21 02:29:54,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 02:29:54,729 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 129 [2023-12-21 02:29:54,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:29:54,735 INFO L225 Difference]: With dead ends: 183 [2023-12-21 02:29:54,735 INFO L226 Difference]: Without dead ends: 91 [2023-12-21 02:29:54,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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:29:54,743 INFO L413 NwaCegarLoop]: 129 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, 129 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:29:54,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:29:54,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-12-21 02:29:54,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-12-21 02:29:54,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 72 states have (on average 1.375) internal successors, (99), 72 states have internal predecessors, (99), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 02:29:54,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 133 transitions. [2023-12-21 02:29:54,802 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 133 transitions. Word has length 129 [2023-12-21 02:29:54,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:29:54,803 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 133 transitions. [2023-12-21 02:29:54,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-21 02:29:54,804 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 133 transitions. [2023-12-21 02:29:54,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-21 02:29:54,811 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:29:54,811 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:54,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 02:29:54,812 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:29:54,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:29:54,812 INFO L85 PathProgramCache]: Analyzing trace with hash 631241818, now seen corresponding path program 1 times [2023-12-21 02:29:54,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:29:54,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624111785] [2023-12-21 02:29:54,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:29:54,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:29:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:29:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:29:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:29:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:29:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:29:55,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:29:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:29:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:29:55,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:29:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:29:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:29:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:29:55,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:29:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:29:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 02:29:55,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 02:29:55,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:29:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,225 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:29:55,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:29:55,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624111785] [2023-12-21 02:29:55,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624111785] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:29:55,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:29:55,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:29:55,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498558100] [2023-12-21 02:29:55,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:29:55,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:29:55,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:29:55,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:29:55,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:29:55,232 INFO L87 Difference]: Start difference. First operand 91 states and 133 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:29:55,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:29:55,307 INFO L93 Difference]: Finished difference Result 204 states and 299 transitions. [2023-12-21 02:29:55,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:29:55,308 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 129 [2023-12-21 02:29:55,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:29:55,311 INFO L225 Difference]: With dead ends: 204 [2023-12-21 02:29:55,311 INFO L226 Difference]: Without dead ends: 114 [2023-12-21 02:29:55,314 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:29:55,315 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 49 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:29:55,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 408 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:29:55,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-12-21 02:29:55,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 93. [2023-12-21 02:29:55,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 74 states have (on average 1.364864864864865) internal successors, (101), 74 states have internal predecessors, (101), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 02:29:55,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2023-12-21 02:29:55,331 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 129 [2023-12-21 02:29:55,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:29:55,334 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2023-12-21 02:29:55,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:29:55,334 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2023-12-21 02:29:55,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-21 02:29:55,336 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:29:55,337 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:55,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 02:29:55,337 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:29:55,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:29:55,337 INFO L85 PathProgramCache]: Analyzing trace with hash 776918632, now seen corresponding path program 1 times [2023-12-21 02:29:55,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:29:55,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261677519] [2023-12-21 02:29:55,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:29:55,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:29:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:29:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:29:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:29:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:29:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:29:55,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:29:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:29:55,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:29:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:29:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:29:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:29:55,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:29:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:29:55,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:29:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 02:29:55,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 02:29:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:29:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,524 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:29:55,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:29:55,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261677519] [2023-12-21 02:29:55,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261677519] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:29:55,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:29:55,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:29:55,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296201871] [2023-12-21 02:29:55,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:29:55,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:29:55,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:29:55,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:29:55,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:29:55,528 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:29:55,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:29:55,598 INFO L93 Difference]: Finished difference Result 197 states and 286 transitions. [2023-12-21 02:29:55,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:29:55,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2023-12-21 02:29:55,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:29:55,599 INFO L225 Difference]: With dead ends: 197 [2023-12-21 02:29:55,599 INFO L226 Difference]: Without dead ends: 105 [2023-12-21 02:29:55,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 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:29:55,600 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 21 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:29:55,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 378 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:29:55,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-12-21 02:29:55,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 95. [2023-12-21 02:29:55,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 76 states have (on average 1.355263157894737) internal successors, (103), 76 states have internal predecessors, (103), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 02:29:55,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2023-12-21 02:29:55,606 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 131 [2023-12-21 02:29:55,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:29:55,606 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2023-12-21 02:29:55,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:29:55,607 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2023-12-21 02:29:55,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-21 02:29:55,607 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:29:55,608 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:55,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 02:29:55,608 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:29:55,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:29:55,608 INFO L85 PathProgramCache]: Analyzing trace with hash -32427994, now seen corresponding path program 1 times [2023-12-21 02:29:55,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:29:55,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100525447] [2023-12-21 02:29:55,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:29:55,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:29:55,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:29:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:29:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:29:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:29:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:29:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:29:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:29:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:29:55,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:29:55,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:29:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:29:55,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:29:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:29:55,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:29:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 02:29:55,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 02:29:55,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:29:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,717 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:29:55,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:29:55,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100525447] [2023-12-21 02:29:55,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100525447] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:29:55,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:29:55,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:29:55,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185475979] [2023-12-21 02:29:55,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:29:55,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:29:55,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:29:55,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:29:55,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:29:55,720 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:29:55,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:29:55,755 INFO L93 Difference]: Finished difference Result 197 states and 284 transitions. [2023-12-21 02:29:55,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:29:55,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2023-12-21 02:29:55,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:29:55,757 INFO L225 Difference]: With dead ends: 197 [2023-12-21 02:29:55,757 INFO L226 Difference]: Without dead ends: 103 [2023-12-21 02:29:55,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 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:29:55,762 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 12 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:29:55,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 376 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:29:55,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-12-21 02:29:55,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 97. [2023-12-21 02:29:55,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 78 states have (on average 1.3461538461538463) internal successors, (105), 78 states have internal predecessors, (105), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 02:29:55,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2023-12-21 02:29:55,775 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 131 [2023-12-21 02:29:55,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:29:55,775 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2023-12-21 02:29:55,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:29:55,776 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2023-12-21 02:29:55,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-21 02:29:55,776 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:29:55,777 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:55,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 02:29:55,777 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:29:55,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:29:55,777 INFO L85 PathProgramCache]: Analyzing trace with hash 24830308, now seen corresponding path program 1 times [2023-12-21 02:29:55,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:29:55,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383354440] [2023-12-21 02:29:55,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:29:55,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:29:55,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:29:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:29:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:29:55,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:29:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:29:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:29:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:29:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:29:55,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:29:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:29:55,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:29:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:29:55,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:29:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:29:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 02:29:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 02:29:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:29:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:55,896 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:29:55,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:29:55,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383354440] [2023-12-21 02:29:55,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383354440] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:29:55,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:29:55,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:29:55,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447902144] [2023-12-21 02:29:55,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:29:55,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:29:55,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:29:55,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:29:55,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:29:55,898 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:29:55,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:29:55,928 INFO L93 Difference]: Finished difference Result 197 states and 282 transitions. [2023-12-21 02:29:55,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:29:55,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2023-12-21 02:29:55,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:29:55,931 INFO L225 Difference]: With dead ends: 197 [2023-12-21 02:29:55,931 INFO L226 Difference]: Without dead ends: 101 [2023-12-21 02:29:55,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 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:29:55,932 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 3 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:29:55,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 376 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:29:55,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-12-21 02:29:55,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2023-12-21 02:29:55,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.3375) internal successors, (107), 80 states have internal predecessors, (107), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 02:29:55,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2023-12-21 02:29:55,947 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 131 [2023-12-21 02:29:55,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:29:55,948 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2023-12-21 02:29:55,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:29:55,948 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2023-12-21 02:29:55,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-21 02:29:55,949 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:29:55,949 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:55,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 02:29:55,949 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:29:55,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:29:55,950 INFO L85 PathProgramCache]: Analyzing trace with hash 24889890, now seen corresponding path program 1 times [2023-12-21 02:29:55,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:29:55,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55635733] [2023-12-21 02:29:55,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:29:55,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:29:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:56,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:29:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:56,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:29:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:56,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:29:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:56,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:29:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:56,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:29:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:56,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:29:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:56,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:29:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:56,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:29:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:56,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:29:56,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:56,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:29:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:56,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:29:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:56,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:29:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:56,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:29:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:56,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:29:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:56,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 02:29:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:56,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 02:29:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:56,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:29:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:56,495 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:29:56,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:29:56,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55635733] [2023-12-21 02:29:56,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55635733] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:29:56,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:29:56,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 02:29:56,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777712115] [2023-12-21 02:29:56,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:29:56,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 02:29:56,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:29:56,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 02:29:56,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:29:56,496 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:29:56,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:29:56,955 INFO L93 Difference]: Finished difference Result 281 states and 398 transitions. [2023-12-21 02:29:56,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:29:56,955 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2023-12-21 02:29:56,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:29:56,957 INFO L225 Difference]: With dead ends: 281 [2023-12-21 02:29:56,957 INFO L226 Difference]: Without dead ends: 183 [2023-12-21 02:29:56,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-21 02:29:56,959 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 244 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 02:29:56,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 319 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 02:29:56,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-12-21 02:29:56,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 101. [2023-12-21 02:29:56,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 82 states have (on average 1.329268292682927) internal successors, (109), 82 states have internal predecessors, (109), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 02:29:56,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2023-12-21 02:29:56,967 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 131 [2023-12-21 02:29:56,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:29:56,967 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2023-12-21 02:29:56,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:29:56,968 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2023-12-21 02:29:56,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-21 02:29:56,969 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:29:56,969 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:56,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 02:29:56,969 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:29:56,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:29:56,970 INFO L85 PathProgramCache]: Analyzing trace with hash -360872647, now seen corresponding path program 1 times [2023-12-21 02:29:56,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:29:56,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347795815] [2023-12-21 02:29:56,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:29:56,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:29:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:57,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:29:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:57,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:29:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:57,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:29:57,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:57,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:29:57,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:57,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:29:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:57,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:29:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:57,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:29:57,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:57,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:29:57,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:57,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:29:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:57,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:29:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:57,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:29:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:57,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:29:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:57,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:29:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:57,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:29:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:57,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 02:29:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:57,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 02:29:57,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:57,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:29:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:57,986 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-21 02:29:57,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:29:57,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347795815] [2023-12-21 02:29:57,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347795815] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 02:29:57,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607759618] [2023-12-21 02:29:57,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:29:57,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:29:57,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:29:58,000 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:29:58,016 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:29:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:29:58,307 INFO L262 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-21 02:29:58,319 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:29:58,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:29:58,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2023-12-21 02:29:58,454 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 43 treesize of output 21 [2023-12-21 02:29:58,490 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 43 treesize of output 21 [2023-12-21 02:29:58,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:29:58,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 39 [2023-12-21 02:29:58,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:29:58,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 51 [2023-12-21 02:29:58,656 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 159 treesize of output 121 [2023-12-21 02:29:58,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:29:58,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 121 treesize of output 169 [2023-12-21 02:29:58,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 83 [2023-12-21 02:29:58,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:29:58,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 201 treesize of output 75 [2023-12-21 02:29:58,896 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 232 proven. 12 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2023-12-21 02:29:58,897 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 02:29:59,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 35 treesize of output 17 [2023-12-21 02:29:59,208 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-21 02:29:59,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607759618] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 02:29:59,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 02:29:59,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 19 [2023-12-21 02:29:59,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503080538] [2023-12-21 02:29:59,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 02:29:59,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-21 02:29:59,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:29:59,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-21 02:29:59,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2023-12-21 02:29:59,211 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 19 states, 17 states have (on average 4.235294117647059) internal successors, (72), 19 states have internal predecessors, (72), 4 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (22), 2 states have call predecessors, (22), 4 states have call successors, (22) [2023-12-21 02:30:00,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:30:00,808 INFO L93 Difference]: Finished difference Result 408 states and 564 transitions. [2023-12-21 02:30:00,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-21 02:30:00,808 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 4.235294117647059) internal successors, (72), 19 states have internal predecessors, (72), 4 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (22), 2 states have call predecessors, (22), 4 states have call successors, (22) Word has length 131 [2023-12-21 02:30:00,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:30:00,810 INFO L225 Difference]: With dead ends: 408 [2023-12-21 02:30:00,810 INFO L226 Difference]: Without dead ends: 308 [2023-12-21 02:30:00,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 284 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=349, Invalid=1291, Unknown=0, NotChecked=0, Total=1640 [2023-12-21 02:30:00,811 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 435 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 1719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:30:00,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 742 Invalid, 1719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1502 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-21 02:30:00,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2023-12-21 02:30:00,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 291. [2023-12-21 02:30:00,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 231 states have (on average 1.29004329004329) internal successors, (298), 234 states have internal predecessors, (298), 52 states have call successors, (52), 7 states have call predecessors, (52), 7 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-21 02:30:00,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 402 transitions. [2023-12-21 02:30:00,856 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 402 transitions. Word has length 131 [2023-12-21 02:30:00,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:30:00,857 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 402 transitions. [2023-12-21 02:30:00,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 4.235294117647059) internal successors, (72), 19 states have internal predecessors, (72), 4 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (22), 2 states have call predecessors, (22), 4 states have call successors, (22) [2023-12-21 02:30:00,857 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 402 transitions. [2023-12-21 02:30:00,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-21 02:30:00,858 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:30:00,858 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:00,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-21 02:30:01,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:30:01,073 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:30:01,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:30:01,073 INFO L85 PathProgramCache]: Analyzing trace with hash 2128656315, now seen corresponding path program 1 times [2023-12-21 02:30:01,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:30:01,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284009011] [2023-12-21 02:30:01,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:30:01,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:30:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:01,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:30:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:01,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:30:01,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:01,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:30:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:01,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:30:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:01,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:30:01,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:01,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:30:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:01,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:30:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:01,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:30:01,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:01,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:30:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:01,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:30:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:01,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:30:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:01,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:30:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:01,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:30:01,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:01,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:30:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:01,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 02:30:01,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:01,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 02:30:01,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:01,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:30:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:01,686 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-21 02:30:01,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:30:01,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284009011] [2023-12-21 02:30:01,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284009011] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 02:30:01,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456588187] [2023-12-21 02:30:01,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:30:01,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:30:01,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:30:01,705 INFO L229 MonitoredProcess]: Starting monitored process 3 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:30:01,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-21 02:30:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:01,873 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-21 02:30:01,882 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:30:01,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:30:01,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 10 [2023-12-21 02:30:01,918 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 43 treesize of output 21 [2023-12-21 02:30:01,943 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 43 treesize of output 21 [2023-12-21 02:30:01,967 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 43 treesize of output 21 [2023-12-21 02:30:01,990 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:30:01,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 39 [2023-12-21 02:30:02,011 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:30:02,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 32 [2023-12-21 02:30:02,021 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 276 proven. 18 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2023-12-21 02:30:02,021 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 02:30:02,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 35 treesize of output 17 [2023-12-21 02:30:02,152 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-21 02:30:02,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456588187] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 02:30:02,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 02:30:02,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 12 [2023-12-21 02:30:02,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190629720] [2023-12-21 02:30:02,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 02:30:02,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 02:30:02,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:30:02,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 02:30:02,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-12-21 02:30:02,154 INFO L87 Difference]: Start difference. First operand 291 states and 402 transitions. Second operand has 12 states, 9 states have (on average 6.888888888888889) internal successors, (62), 12 states have internal predecessors, (62), 5 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 5 states have call successors, (25) [2023-12-21 02:30:02,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:30:02,599 INFO L93 Difference]: Finished difference Result 580 states and 785 transitions. [2023-12-21 02:30:02,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-21 02:30:02,608 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 6.888888888888889) internal successors, (62), 12 states have internal predecessors, (62), 5 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 5 states have call successors, (25) Word has length 131 [2023-12-21 02:30:02,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:30:02,612 INFO L225 Difference]: With dead ends: 580 [2023-12-21 02:30:02,612 INFO L226 Difference]: Without dead ends: 314 [2023-12-21 02:30:02,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 290 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2023-12-21 02:30:02,613 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 153 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 02:30:02,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 373 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 02:30:02,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2023-12-21 02:30:02,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 310. [2023-12-21 02:30:02,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 245 states have (on average 1.2693877551020407) internal successors, (311), 248 states have internal predecessors, (311), 52 states have call successors, (52), 12 states have call predecessors, (52), 12 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-21 02:30:02,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 415 transitions. [2023-12-21 02:30:02,657 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 415 transitions. Word has length 131 [2023-12-21 02:30:02,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:30:02,657 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 415 transitions. [2023-12-21 02:30:02,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 6.888888888888889) internal successors, (62), 12 states have internal predecessors, (62), 5 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 5 states have call successors, (25) [2023-12-21 02:30:02,657 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 415 transitions. [2023-12-21 02:30:02,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-21 02:30:02,658 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:30:02,658 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:02,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-21 02:30:02,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-12-21 02:30:02,865 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:30:02,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:30:02,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1319063438, now seen corresponding path program 1 times [2023-12-21 02:30:02,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:30:02,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73408531] [2023-12-21 02:30:02,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:30:02,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:30:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:03,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:30:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:03,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:30:03,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:03,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:30:03,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:03,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:30:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:03,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:30:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:03,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:30:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:03,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:30:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:03,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:30:03,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:03,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:30:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:03,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:30:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:03,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:30:03,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:03,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:30:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:03,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:30:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:03,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:30:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:03,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 02:30:03,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:03,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 02:30:03,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:03,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:30:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:03,502 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-21 02:30:03,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:30:03,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73408531] [2023-12-21 02:30:03,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73408531] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 02:30:03,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118512634] [2023-12-21 02:30:03,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:30:03,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:30:03,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:30:03,510 INFO L229 MonitoredProcess]: Starting monitored process 4 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:30:03,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-21 02:30:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:03,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-21 02:30:03,727 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:30:03,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:30:03,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 10 [2023-12-21 02:30:03,759 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 43 treesize of output 21 [2023-12-21 02:30:03,777 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 43 treesize of output 21 [2023-12-21 02:30:03,798 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 43 treesize of output 21 [2023-12-21 02:30:03,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:30:03,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 39 [2023-12-21 02:30:03,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:30:03,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 51 [2023-12-21 02:30:03,893 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 159 treesize of output 121 [2023-12-21 02:30:03,898 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:30:03,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 121 treesize of output 169 [2023-12-21 02:30:03,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 82 [2023-12-21 02:30:04,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:30:04,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 201 treesize of output 75 [2023-12-21 02:30:04,025 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 276 proven. 18 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2023-12-21 02:30:04,025 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 02:30:04,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 35 treesize of output 17 [2023-12-21 02:30:04,233 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-21 02:30:04,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118512634] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 02:30:04,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 02:30:04,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 20 [2023-12-21 02:30:04,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673992559] [2023-12-21 02:30:04,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 02:30:04,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-21 02:30:04,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:30:04,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-21 02:30:04,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2023-12-21 02:30:04,235 INFO L87 Difference]: Start difference. First operand 310 states and 415 transitions. Second operand has 20 states, 17 states have (on average 4.294117647058823) internal successors, (73), 20 states have internal predecessors, (73), 5 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 5 states have call successors, (25) [2023-12-21 02:30:05,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:30:05,694 INFO L93 Difference]: Finished difference Result 688 states and 916 transitions. [2023-12-21 02:30:05,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-21 02:30:05,695 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 4.294117647058823) internal successors, (73), 20 states have internal predecessors, (73), 5 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 5 states have call successors, (25) Word has length 131 [2023-12-21 02:30:05,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:30:05,696 INFO L225 Difference]: With dead ends: 688 [2023-12-21 02:30:05,696 INFO L226 Difference]: Without dead ends: 407 [2023-12-21 02:30:05,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 285 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=365, Invalid=1441, Unknown=0, NotChecked=0, Total=1806 [2023-12-21 02:30:05,698 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 502 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 1910 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 2030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:30:05,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 958 Invalid, 2030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1910 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-21 02:30:05,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2023-12-21 02:30:05,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 225. [2023-12-21 02:30:05,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 175 states have (on average 1.2571428571428571) internal successors, (220), 177 states have internal predecessors, (220), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-21 02:30:05,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 300 transitions. [2023-12-21 02:30:05,714 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 300 transitions. Word has length 131 [2023-12-21 02:30:05,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:30:05,714 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 300 transitions. [2023-12-21 02:30:05,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 4.294117647058823) internal successors, (73), 20 states have internal predecessors, (73), 5 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 5 states have call successors, (25) [2023-12-21 02:30:05,714 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 300 transitions. [2023-12-21 02:30:05,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-21 02:30:05,715 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:30:05,715 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:05,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-21 02:30:05,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:30:05,919 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:30:05,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:30:05,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1173347336, now seen corresponding path program 1 times [2023-12-21 02:30:05,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:30:05,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289273305] [2023-12-21 02:30:05,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:30:05,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:30:05,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:06,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:30:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:06,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:30:06,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:06,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:30:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:06,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:30:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:06,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:30:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:06,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:30:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:06,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:30:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:06,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:30:06,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:06,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:30:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:06,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:30:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:06,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:30:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:06,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:30:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:06,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:30:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:06,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:30:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:06,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 02:30:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:06,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 02:30:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:06,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:30:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:06,191 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:30:06,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:30:06,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289273305] [2023-12-21 02:30:06,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289273305] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:30:06,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:30:06,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 02:30:06,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028666130] [2023-12-21 02:30:06,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:30:06,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 02:30:06,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:30:06,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 02:30:06,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:30:06,193 INFO L87 Difference]: Start difference. First operand 225 states and 300 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:30:06,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:30:06,516 INFO L93 Difference]: Finished difference Result 739 states and 992 transitions. [2023-12-21 02:30:06,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 02:30:06,516 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2023-12-21 02:30:06,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:30:06,520 INFO L225 Difference]: With dead ends: 739 [2023-12-21 02:30:06,520 INFO L226 Difference]: Without dead ends: 566 [2023-12-21 02:30:06,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-12-21 02:30:06,522 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 268 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:30:06,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 743 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:30:06,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2023-12-21 02:30:06,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 233. [2023-12-21 02:30:06,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 183 states have (on average 1.2677595628415301) internal successors, (232), 185 states have internal predecessors, (232), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-21 02:30:06,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 312 transitions. [2023-12-21 02:30:06,544 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 312 transitions. Word has length 132 [2023-12-21 02:30:06,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:30:06,547 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 312 transitions. [2023-12-21 02:30:06,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:30:06,548 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 312 transitions. [2023-12-21 02:30:06,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-21 02:30:06,549 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:30:06,550 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:06,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-21 02:30:06,550 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:30:06,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:30:06,551 INFO L85 PathProgramCache]: Analyzing trace with hash 787584799, now seen corresponding path program 1 times [2023-12-21 02:30:06,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:30:06,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639543985] [2023-12-21 02:30:06,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:30:06,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:30:06,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:06,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:30:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:06,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:30:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:06,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:30:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:06,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:30:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:06,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:30:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:06,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:30:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:06,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:30:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:06,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:30:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:06,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:30:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:06,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:30:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:06,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:30:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:06,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:30:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:06,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:30:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:06,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:30:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:06,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 02:30:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:06,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 02:30:06,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:06,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:30:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:06,950 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:30:06,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:30:06,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639543985] [2023-12-21 02:30:06,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639543985] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:30:06,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:30:06,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 02:30:06,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598060318] [2023-12-21 02:30:06,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:30:06,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 02:30:06,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:30:06,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 02:30:06,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:30:06,952 INFO L87 Difference]: Start difference. First operand 233 states and 312 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:30:07,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:30:07,144 INFO L93 Difference]: Finished difference Result 414 states and 555 transitions. [2023-12-21 02:30:07,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:30:07,144 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2023-12-21 02:30:07,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:30:07,148 INFO L225 Difference]: With dead ends: 414 [2023-12-21 02:30:07,148 INFO L226 Difference]: Without dead ends: 233 [2023-12-21 02:30:07,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-12-21 02:30:07,151 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 221 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:30:07,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 122 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:30:07,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2023-12-21 02:30:07,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2023-12-21 02:30:07,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 183 states have (on average 1.2459016393442623) internal successors, (228), 185 states have internal predecessors, (228), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-21 02:30:07,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 308 transitions. [2023-12-21 02:30:07,172 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 308 transitions. Word has length 132 [2023-12-21 02:30:07,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:30:07,172 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 308 transitions. [2023-12-21 02:30:07,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:30:07,172 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 308 transitions. [2023-12-21 02:30:07,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-21 02:30:07,173 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:30:07,174 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:07,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-21 02:30:07,174 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:30:07,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:30:07,174 INFO L85 PathProgramCache]: Analyzing trace with hash 340175627, now seen corresponding path program 1 times [2023-12-21 02:30:07,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:30:07,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962359596] [2023-12-21 02:30:07,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:30:07,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:30:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:07,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:30:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:07,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:30:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:07,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:30:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:07,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:30:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:07,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:30:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:07,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:30:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:07,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:30:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:07,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:30:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:07,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:30:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:07,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:30:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:07,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:30:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:07,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:30:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:07,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:30:07,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:07,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:30:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:07,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 02:30:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:07,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 02:30:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:07,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:30:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:07,912 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:30:07,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:30:07,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962359596] [2023-12-21 02:30:07,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962359596] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:30:07,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:30:07,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:30:07,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705396709] [2023-12-21 02:30:07,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:30:07,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:30:07,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:30:07,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:30:07,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:30:07,914 INFO L87 Difference]: Start difference. First operand 233 states and 308 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:30:08,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:30:08,170 INFO L93 Difference]: Finished difference Result 614 states and 812 transitions. [2023-12-21 02:30:08,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:30:08,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2023-12-21 02:30:08,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:30:08,172 INFO L225 Difference]: With dead ends: 614 [2023-12-21 02:30:08,172 INFO L226 Difference]: Without dead ends: 433 [2023-12-21 02:30:08,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 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:30:08,173 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 134 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:30:08,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 599 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:30:08,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2023-12-21 02:30:08,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 233. [2023-12-21 02:30:08,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 183 states have (on average 1.2349726775956285) internal successors, (226), 185 states have internal predecessors, (226), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-21 02:30:08,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 306 transitions. [2023-12-21 02:30:08,192 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 306 transitions. Word has length 133 [2023-12-21 02:30:08,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:30:08,192 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 306 transitions. [2023-12-21 02:30:08,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:30:08,192 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 306 transitions. [2023-12-21 02:30:08,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-21 02:30:08,193 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:30:08,193 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:08,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-21 02:30:08,193 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:30:08,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:30:08,194 INFO L85 PathProgramCache]: Analyzing trace with hash 2056602669, now seen corresponding path program 1 times [2023-12-21 02:30:08,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:30:08,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812818190] [2023-12-21 02:30:08,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:30:08,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:30:08,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:09,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:30:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:09,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:30:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:09,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:30:09,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:09,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:30:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:09,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:30:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:09,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:30:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:09,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:30:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:09,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:30:09,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:09,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:30:09,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:09,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:30:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:09,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:30:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:09,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:30:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:09,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:30:09,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:09,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:30:09,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:09,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 02:30:09,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:09,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 02:30:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:09,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:30:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:09,288 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:30:09,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:30:09,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812818190] [2023-12-21 02:30:09,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812818190] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:30:09,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:30:09,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 02:30:09,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877224171] [2023-12-21 02:30:09,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:30:09,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 02:30:09,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:30:09,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 02:30:09,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:30:09,292 INFO L87 Difference]: Start difference. First operand 233 states and 306 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:30:09,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:30:09,679 INFO L93 Difference]: Finished difference Result 437 states and 572 transitions. [2023-12-21 02:30:09,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 02:30:09,680 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2023-12-21 02:30:09,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:30:09,681 INFO L225 Difference]: With dead ends: 437 [2023-12-21 02:30:09,681 INFO L226 Difference]: Without dead ends: 256 [2023-12-21 02:30:09,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-21 02:30:09,682 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 156 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 02:30:09,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 525 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 02:30:09,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2023-12-21 02:30:09,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 236. [2023-12-21 02:30:09,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 186 states have (on average 1.2311827956989247) internal successors, (229), 188 states have internal predecessors, (229), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-21 02:30:09,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 309 transitions. [2023-12-21 02:30:09,704 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 309 transitions. Word has length 134 [2023-12-21 02:30:09,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:30:09,705 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 309 transitions. [2023-12-21 02:30:09,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:30:09,705 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 309 transitions. [2023-12-21 02:30:09,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-21 02:30:09,706 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:30:09,706 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:09,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-21 02:30:09,706 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:30:09,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:30:09,707 INFO L85 PathProgramCache]: Analyzing trace with hash 343070083, now seen corresponding path program 1 times [2023-12-21 02:30:09,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:30:09,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519159018] [2023-12-21 02:30:09,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:30:09,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:30:09,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:10,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:30:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:10,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:30:10,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:10,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:30:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:10,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:30:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:10,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:30:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:10,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:30:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:10,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:30:10,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:10,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:30:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:10,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:30:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:10,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:30:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:10,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:30:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:10,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:30:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:10,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:30:10,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:10,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:30:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:10,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 02:30:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:10,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 02:30:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:10,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:30:10,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:10,220 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:30:10,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:30:10,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519159018] [2023-12-21 02:30:10,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519159018] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:30:10,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:30:10,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:30:10,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919451588] [2023-12-21 02:30:10,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:30:10,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:30:10,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:30:10,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:30:10,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:30:10,222 INFO L87 Difference]: Start difference. First operand 236 states and 309 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:30:10,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:30:10,436 INFO L93 Difference]: Finished difference Result 559 states and 729 transitions. [2023-12-21 02:30:10,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:30:10,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2023-12-21 02:30:10,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:30:10,438 INFO L225 Difference]: With dead ends: 559 [2023-12-21 02:30:10,438 INFO L226 Difference]: Without dead ends: 375 [2023-12-21 02:30:10,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 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:30:10,439 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 127 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:30:10,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 324 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:30:10,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2023-12-21 02:30:10,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 236. [2023-12-21 02:30:10,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 186 states have (on average 1.2204301075268817) internal successors, (227), 188 states have internal predecessors, (227), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-21 02:30:10,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 307 transitions. [2023-12-21 02:30:10,457 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 307 transitions. Word has length 134 [2023-12-21 02:30:10,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:30:10,458 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 307 transitions. [2023-12-21 02:30:10,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:30:10,458 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 307 transitions. [2023-12-21 02:30:10,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-21 02:30:10,459 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:30:10,459 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:10,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-21 02:30:10,459 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:30:10,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:30:10,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1471025210, now seen corresponding path program 1 times [2023-12-21 02:30:10,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:30:10,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663294919] [2023-12-21 02:30:10,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:30:10,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:30:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:10,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:30:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:10,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:30:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:10,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:30:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:10,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:30:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:10,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:30:10,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:10,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:30:10,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:10,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:30:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:10,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:30:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:10,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:30:10,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:10,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:30:10,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:10,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:30:10,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:10,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:30:10,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:10,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:30:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:10,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:30:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:10,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 02:30:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:10,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 02:30:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:10,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:30:10,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:10,673 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:30:10,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:30:10,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663294919] [2023-12-21 02:30:10,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663294919] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:30:10,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:30:10,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 02:30:10,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104507787] [2023-12-21 02:30:10,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:30:10,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 02:30:10,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:30:10,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 02:30:10,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:30:10,674 INFO L87 Difference]: Start difference. First operand 236 states and 307 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:30:10,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:30:10,857 INFO L93 Difference]: Finished difference Result 420 states and 545 transitions. [2023-12-21 02:30:10,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:30:10,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2023-12-21 02:30:10,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:30:10,859 INFO L225 Difference]: With dead ends: 420 [2023-12-21 02:30:10,859 INFO L226 Difference]: Without dead ends: 236 [2023-12-21 02:30:10,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-21 02:30:10,859 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 110 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:30:10,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 181 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:30:10,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-12-21 02:30:10,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2023-12-21 02:30:10,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 186 states have (on average 1.2096774193548387) internal successors, (225), 188 states have internal predecessors, (225), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-21 02:30:10,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 305 transitions. [2023-12-21 02:30:10,877 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 305 transitions. Word has length 135 [2023-12-21 02:30:10,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:30:10,877 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 305 transitions. [2023-12-21 02:30:10,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:30:10,877 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 305 transitions. [2023-12-21 02:30:10,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-21 02:30:10,878 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:30:10,878 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:10,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-21 02:30:10,878 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:30:10,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:30:10,879 INFO L85 PathProgramCache]: Analyzing trace with hash -653376760, now seen corresponding path program 1 times [2023-12-21 02:30:10,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:30:10,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747237238] [2023-12-21 02:30:10,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:30:10,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:30:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:12,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:30:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:12,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:30:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:12,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:30:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:12,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:30:12,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:12,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:30:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:12,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:30:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:12,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:30:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:12,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:30:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:12,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:30:12,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:12,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:30:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:12,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:30:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:12,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:30:12,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:12,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:30:12,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:12,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:30:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:12,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 02:30:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:12,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 02:30:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:12,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:30:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:12,332 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:30:12,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:30:12,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747237238] [2023-12-21 02:30:12,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747237238] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:30:12,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:30:12,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 02:30:12,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120384705] [2023-12-21 02:30:12,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:30:12,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 02:30:12,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:30:12,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 02:30:12,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-21 02:30:12,334 INFO L87 Difference]: Start difference. First operand 236 states and 305 transitions. Second operand has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-21 02:30:12,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:30:12,665 INFO L93 Difference]: Finished difference Result 550 states and 714 transitions. [2023-12-21 02:30:12,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 02:30:12,670 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 135 [2023-12-21 02:30:12,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:30:12,671 INFO L225 Difference]: With dead ends: 550 [2023-12-21 02:30:12,671 INFO L226 Difference]: Without dead ends: 366 [2023-12-21 02:30:12,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-12-21 02:30:12,672 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 162 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:30:12,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 815 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:30:12,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2023-12-21 02:30:12,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 238. [2023-12-21 02:30:12,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 188 states have (on average 1.2074468085106382) internal successors, (227), 190 states have internal predecessors, (227), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-21 02:30:12,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 307 transitions. [2023-12-21 02:30:12,692 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 307 transitions. Word has length 135 [2023-12-21 02:30:12,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:30:12,692 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 307 transitions. [2023-12-21 02:30:12,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-21 02:30:12,692 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 307 transitions. [2023-12-21 02:30:12,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-21 02:30:12,693 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:30:12,693 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:12,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-21 02:30:12,694 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:30:12,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:30:12,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1674445114, now seen corresponding path program 1 times [2023-12-21 02:30:12,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:30:12,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98757221] [2023-12-21 02:30:12,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:30:12,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:30:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:12,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:30:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:12,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:30:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:12,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:30:12,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:12,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:30:12,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:12,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:30:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:12,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:30:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:12,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:30:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:12,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:30:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:12,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:30:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:12,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:30:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:12,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:30:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:12,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:30:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:12,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:30:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:12,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:30:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:12,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 02:30:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:12,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 02:30:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:12,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:30:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:12,962 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:30:12,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:30:12,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98757221] [2023-12-21 02:30:12,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98757221] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:30:12,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:30:12,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 02:30:12,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219449438] [2023-12-21 02:30:12,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:30:12,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 02:30:12,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:30:12,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 02:30:12,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:30:12,963 INFO L87 Difference]: Start difference. First operand 238 states and 307 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:30:13,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:30:13,291 INFO L93 Difference]: Finished difference Result 479 states and 618 transitions. [2023-12-21 02:30:13,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 02:30:13,291 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2023-12-21 02:30:13,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:30:13,292 INFO L225 Difference]: With dead ends: 479 [2023-12-21 02:30:13,292 INFO L226 Difference]: Without dead ends: 293 [2023-12-21 02:30:13,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-21 02:30:13,293 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 207 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 02:30:13,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 232 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 02:30:13,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2023-12-21 02:30:13,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 230. [2023-12-21 02:30:13,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 180 states have (on average 1.1944444444444444) internal successors, (215), 182 states have internal predecessors, (215), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-21 02:30:13,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 295 transitions. [2023-12-21 02:30:13,324 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 295 transitions. Word has length 135 [2023-12-21 02:30:13,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:30:13,324 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 295 transitions. [2023-12-21 02:30:13,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:30:13,325 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 295 transitions. [2023-12-21 02:30:13,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-21 02:30:13,325 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:30:13,325 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:13,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-21 02:30:13,326 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:30:13,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:30:13,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1872608361, now seen corresponding path program 1 times [2023-12-21 02:30:13,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:30:13,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457434242] [2023-12-21 02:30:13,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:30:13,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:30:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:13,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:30:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:13,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:30:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:13,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:30:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:13,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:30:13,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:13,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:30:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:13,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:30:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:13,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:30:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:13,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:30:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:13,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:30:13,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:13,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:30:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:13,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:30:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:13,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:30:13,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:13,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:30:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:13,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:30:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:13,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 02:30:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:13,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 02:30:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:13,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:30:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:13,997 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 27 proven. 21 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-21 02:30:13,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:30:13,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457434242] [2023-12-21 02:30:13,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457434242] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 02:30:13,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109253054] [2023-12-21 02:30:13,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:30:13,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:30:13,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:30:14,017 INFO L229 MonitoredProcess]: Starting monitored process 5 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:30:14,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-21 02:30:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:14,203 INFO L262 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-21 02:30:14,206 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:30:14,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:30:14,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-12-21 02:30:14,288 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:30:14,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 16 [2023-12-21 02:30:14,299 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:30:14,299 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 02:30:14,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109253054] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:30:14,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 02:30:14,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2023-12-21 02:30:14,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73051425] [2023-12-21 02:30:14,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:30:14,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 02:30:14,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:30:14,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 02:30:14,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2023-12-21 02:30:14,301 INFO L87 Difference]: Start difference. First operand 230 states and 295 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:30:14,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:30:14,526 INFO L93 Difference]: Finished difference Result 462 states and 590 transitions. [2023-12-21 02:30:14,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 02:30:14,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2023-12-21 02:30:14,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:30:14,527 INFO L225 Difference]: With dead ends: 462 [2023-12-21 02:30:14,527 INFO L226 Difference]: Without dead ends: 284 [2023-12-21 02:30:14,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2023-12-21 02:30:14,528 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 108 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:30:14,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 553 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:30:14,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2023-12-21 02:30:14,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 230. [2023-12-21 02:30:14,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 180 states have (on average 1.1888888888888889) internal successors, (214), 182 states have internal predecessors, (214), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-21 02:30:14,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 294 transitions. [2023-12-21 02:30:14,545 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 294 transitions. Word has length 135 [2023-12-21 02:30:14,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:30:14,545 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 294 transitions. [2023-12-21 02:30:14,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:30:14,545 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 294 transitions. [2023-12-21 02:30:14,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-21 02:30:14,546 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:30:14,546 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:14,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-21 02:30:14,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-21 02:30:14,769 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:30:14,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:30:14,769 INFO L85 PathProgramCache]: Analyzing trace with hash 2061396593, now seen corresponding path program 1 times [2023-12-21 02:30:14,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:30:14,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271722636] [2023-12-21 02:30:14,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:30:14,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:30:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:14,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:30:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:14,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:30:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:14,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:30:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:14,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:30:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:14,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:30:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:14,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:30:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:14,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:30:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:14,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:30:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:14,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:30:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:14,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:30:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:14,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:30:14,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:14,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:30:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:14,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:30:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:14,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:30:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:14,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 02:30:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:14,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 02:30:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:14,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:30:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:14,865 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:30:14,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:30:14,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271722636] [2023-12-21 02:30:14,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271722636] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:30:14,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:30:14,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 02:30:14,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555353628] [2023-12-21 02:30:14,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:30:14,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 02:30:14,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:30:14,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 02:30:14,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:30:14,868 INFO L87 Difference]: Start difference. First operand 230 states and 294 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:30:14,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:30:14,934 INFO L93 Difference]: Finished difference Result 450 states and 575 transitions. [2023-12-21 02:30:14,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 02:30:14,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2023-12-21 02:30:14,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:30:14,936 INFO L225 Difference]: With dead ends: 450 [2023-12-21 02:30:14,936 INFO L226 Difference]: Without dead ends: 272 [2023-12-21 02:30:14,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-21 02:30:14,937 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 80 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:30:14,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 604 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:30:14,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2023-12-21 02:30:14,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 235. [2023-12-21 02:30:14,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 185 states have (on average 1.1837837837837837) internal successors, (219), 187 states have internal predecessors, (219), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-21 02:30:14,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 299 transitions. [2023-12-21 02:30:14,955 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 299 transitions. Word has length 136 [2023-12-21 02:30:14,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:30:14,955 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 299 transitions. [2023-12-21 02:30:14,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:30:14,955 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 299 transitions. [2023-12-21 02:30:14,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-21 02:30:14,956 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:30:14,956 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:14,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-21 02:30:14,956 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:30:14,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:30:14,956 INFO L85 PathProgramCache]: Analyzing trace with hash -194572356, now seen corresponding path program 1 times [2023-12-21 02:30:14,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:30:14,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290061093] [2023-12-21 02:30:14,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:30:14,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:30:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:15,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 02:30:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:15,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 02:30:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:15,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 02:30:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:15,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 02:30:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:15,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 02:30:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:15,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 02:30:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:15,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 02:30:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:15,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 02:30:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:15,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-21 02:30:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:15,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-21 02:30:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:15,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 02:30:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:15,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 02:30:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:15,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 02:30:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:15,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-21 02:30:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:15,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-21 02:30:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:15,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-21 02:30:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:15,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 02:30:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:30:15,219 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:30:15,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:30:15,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290061093] [2023-12-21 02:30:15,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290061093] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:30:15,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:30:15,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:30:15,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067881845] [2023-12-21 02:30:15,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:30:15,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:30:15,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:30:15,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:30:15,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:30:15,220 INFO L87 Difference]: Start difference. First operand 235 states and 299 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:30:15,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:30:15,343 INFO L93 Difference]: Finished difference Result 247 states and 311 transitions. [2023-12-21 02:30:15,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:30:15,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2023-12-21 02:30:15,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:30:15,344 INFO L225 Difference]: With dead ends: 247 [2023-12-21 02:30:15,344 INFO L226 Difference]: Without dead ends: 245 [2023-12-21 02:30:15,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 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:30:15,345 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 60 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:30:15,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 359 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 02:30:15,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2023-12-21 02:30:15,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2023-12-21 02:30:15,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 192 states have (on average 1.1770833333333333) internal successors, (226), 194 states have internal predecessors, (226), 40 states have call successors, (40), 10 states have call predecessors, (40), 10 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-21 02:30:15,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 306 transitions. [2023-12-21 02:30:15,362 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 306 transitions. Word has length 138 [2023-12-21 02:30:15,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:30:15,362 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 306 transitions. [2023-12-21 02:30:15,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:30:15,362 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 306 transitions. [2023-12-21 02:30:15,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-21 02:30:15,363 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:30:15,363 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:15,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-21 02:30:15,363 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:30:15,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:30:15,363 INFO L85 PathProgramCache]: Analyzing trace with hash -194512774, now seen corresponding path program 1 times [2023-12-21 02:30:15,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:30:15,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691897904] [2023-12-21 02:30:15,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:30:15,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:30:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 02:30:15,413 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 02:30:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 02:30:15,472 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 02:30:15,472 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 02:30:15,473 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 02:30:15,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-21 02:30:15,476 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] [2023-12-21 02:30:15,479 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 02:30:15,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 02:30:15 BoogieIcfgContainer [2023-12-21 02:30:15,550 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 02:30:15,550 INFO L158 Benchmark]: Toolchain (without parser) took 22365.57ms. Allocated memory was 281.0MB in the beginning and 820.0MB in the end (delta: 539.0MB). Free memory was 230.6MB in the beginning and 642.4MB in the end (delta: -411.7MB). Peak memory consumption was 128.8MB. Max. memory is 8.0GB. [2023-12-21 02:30:15,550 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 223.3MB. Free memory is still 174.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 02:30:15,551 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.07ms. Allocated memory is still 281.0MB. Free memory was 230.3MB in the beginning and 214.5MB in the end (delta: 15.8MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-21 02:30:15,551 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.62ms. Allocated memory is still 281.0MB. Free memory was 214.5MB in the beginning and 210.8MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-21 02:30:15,551 INFO L158 Benchmark]: Boogie Preprocessor took 74.78ms. Allocated memory is still 281.0MB. Free memory was 210.8MB in the beginning and 206.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-21 02:30:15,551 INFO L158 Benchmark]: RCFGBuilder took 629.36ms. Allocated memory is still 281.0MB. Free memory was 206.6MB in the beginning and 241.5MB in the end (delta: -34.9MB). Peak memory consumption was 26.9MB. Max. memory is 8.0GB. [2023-12-21 02:30:15,551 INFO L158 Benchmark]: TraceAbstraction took 21384.29ms. Allocated memory was 281.0MB in the beginning and 820.0MB in the end (delta: 539.0MB). Free memory was 240.5MB in the beginning and 642.4MB in the end (delta: -401.9MB). Peak memory consumption was 138.7MB. Max. memory is 8.0GB. [2023-12-21 02:30:15,552 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.14ms. Allocated memory is still 223.3MB. Free memory is still 174.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 227.07ms. Allocated memory is still 281.0MB. Free memory was 230.3MB in the beginning and 214.5MB in the end (delta: 15.8MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.62ms. Allocated memory is still 281.0MB. Free memory was 214.5MB in the beginning and 210.8MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 74.78ms. Allocated memory is still 281.0MB. Free memory was 210.8MB in the beginning and 206.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 629.36ms. Allocated memory is still 281.0MB. Free memory was 206.6MB in the beginning and 241.5MB in the end (delta: -34.9MB). Peak memory consumption was 26.9MB. Max. memory is 8.0GB. * TraceAbstraction took 21384.29ms. Allocated memory was 281.0MB in the beginning and 820.0MB in the end (delta: 539.0MB). Free memory was 240.5MB in the beginning and 642.4MB in the end (delta: -401.9MB). Peak memory consumption was 138.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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 someBinaryFLOATComparisonOperation at line 120, overapproximation of bitwise operation at line 120. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 16, 32, 20113, 100, 100, -1, 16, 1, 0, 1, 10, 256, 32.5, 127.4, 128 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 16, 32, 20113, 100, 100, -1, 16, 1, 0, 1, 10, 256, 32.5, 127.4, 128 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 16, 32, 20113, 100, 100, -1, 16, 1, 0, 1, 10, 256, 32.5, 127.4, 128 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 16, 32, 20113, 100, 100, -1, 16, 1, 0, 1, 10, 256, 32.5, 127.4, 128 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 16, 32, 20113, 100, 100, -1, 16, 1, 0, 1, 10, 256, 32.5, 127.4, 128 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 16, 32, 20113, 100, 100, -1, 16, 1, 0, 1, 10, 256, 32.5, 127.4, 128 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 16, 32, 20113, 100, 100, -1, 16, 1, 0, 1, 10, 256, 32.5, 127.4, 128 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 16, 32, 20113, 100, 100, -1, 16, 1, 0, 1, 10, 256, 32.5, 127.4, 128 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 16, 32, 20113, 100, 100, -1, 16, 1, 0, 1, 10, 256, 32.5, 127.4, 128 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 16, 32, 20113, 100, 100, -1, 16, 1, 0, 1, 10, 256, 32.5, 127.4, 128 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 16, 32, 20113, 100, 100, -1, 16, 1, 0, 1, 10, 256, 32.5, 127.4, 128 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 16, 32, 20113, 100, 100, -1, 16, 1, 0, 1, 10, 256, 32.5, 127.4, 128 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 16, 32, 20113, 100, 100, -1, 16, 1, 0, 1, 10, 256, 32.5, 127.4, 128 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 16, 32, 20113, 100, 100, -1, 16, 1, 0, 1, 10, 256, 32.5, 127.4, 128 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 16, 32, 20113, 100, 100, -1, 16, 1, 0, 1, 10, 256, 32.5, 127.4, 128 }; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 16, 32, 20113, 100, 100, -1, 16, 1, 0, 1, 10, 256, 32.5, 127.4, 128 }; [L124] isInitial = 1 [L125] FCALL initially() [L126] COND TRUE 1 [L127] FCALL updateLastVariables() [L128] CALL updateVariables() [L90] WrapperStruct00.var_1_7 = __VERIFIER_nondet_short() [L91] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -1) VAL [WrapperStruct00={4:0}, isInitial=1] [L92] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1] [L93] WrapperStruct00.var_1_8 = __VERIFIER_nondet_short() [L94] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1] [L96] WrapperStruct00.var_1_9 = __VERIFIER_nondet_short() [L97] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] WrapperStruct00.var_1_11 = __VERIFIER_nondet_char() [L100] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= -63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= -63) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] WrapperStruct00.var_1_12 = __VERIFIER_nondet_char() [L103] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= -31) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= -31) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 32) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 32) VAL [WrapperStruct00={4:0}, isInitial=1] [L105] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L109] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L110] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L111] WrapperStruct00.var_1_19 = __VERIFIER_nondet_ushort() [L112] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L113] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] WrapperStruct00.var_1_21 = __VERIFIER_nondet_float() [L115] EXPR WrapperStruct00.var_1_21 [L115] EXPR WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L115] EXPR WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F [L115] EXPR WrapperStruct00.var_1_21 [L115] EXPR WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L115] EXPR (WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F) || (WrapperStruct00.var_1_21 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_21 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] EXPR (WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F) || (WrapperStruct00.var_1_21 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_21 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] CALL assume_abort_if_not((WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F) || (WrapperStruct00.var_1_21 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_21 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L115] RET assume_abort_if_not((WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F) || (WrapperStruct00.var_1_21 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_21 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L128] RET updateVariables() [L129] CALL step() [L60] EXPR WrapperStruct00.var_1_19 [L60] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_19 [L61] EXPR WrapperStruct00.var_1_21 [L61] WrapperStruct00.var_1_20 = WrapperStruct00.var_1_21 [L62] EXPR WrapperStruct00.var_1_12 [L62] WrapperStruct00.var_1_22 = WrapperStruct00.var_1_12 [L63] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1] [L63] COND TRUE 127.5f > WrapperStruct00.var_1_20 [L64] EXPR WrapperStruct00.var_1_15 [L64] EXPR WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L64] EXPR WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16 [L64] EXPR WrapperStruct00.var_1_16 [L64] EXPR WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L64] WrapperStruct00.var_1_13 = (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16) [L68] EXPR WrapperStruct00.var_1_18 [L68] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L68] COND TRUE WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7 [L69] EXPR WrapperStruct00.var_1_11 [L69] EXPR WrapperStruct00.var_1_12 [L69] WrapperStruct00.var_1_10 = (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)) [L77] WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L77] COND TRUE WrapperStruct00.var_1_13 [L78] EXPR WrapperStruct00.var_1_10 [L78] EXPR WrapperStruct00.var_1_22 VAL [WrapperStruct00={4:0}, isInitial=1] [L78] COND FALSE !(WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) [L85] WrapperStruct00.var_1_1 = 8 VAL [WrapperStruct00={4:0}, isInitial=1] [L129] RET step() [L130] CALL, EXPR property() [L120] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1 [L120] EXPR WrapperStruct00.var_1_10 [L120] EXPR WrapperStruct00.var_1_22 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8)) [L120] EXPR WrapperStruct00.var_1_1 [L120] EXPR (WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8)) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1)) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1)) [L120] EXPR WrapperStruct00.var_1_18 [L120] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1) [L120] EXPR WrapperStruct00.var_1_10 [L120] EXPR WrapperStruct00.var_1_11 [L120] EXPR WrapperStruct00.var_1_12 [L120] EXPR (WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1)) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR ((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR ((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15)))) [L120] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))) [L120] EXPR WrapperStruct00.var_1_13 [L120] EXPR WrapperStruct00.var_1_15 [L120] EXPR WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16 [L120] EXPR WrapperStruct00.var_1_16 [L120] EXPR WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR ((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19)) [L120] EXPR WrapperStruct00.var_1_18 [L120] EXPR WrapperStruct00.var_1_19 [L120] EXPR (((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR ((((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_21)) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR ((((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_21)) [L120] EXPR WrapperStruct00.var_1_20 [L120] EXPR WrapperStruct00.var_1_21 [L120] EXPR ((((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_21)) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (((((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_21))) && (WrapperStruct00.var_1_22 == ((signed short int) WrapperStruct00.var_1_12)) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (((((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_21))) && (WrapperStruct00.var_1_22 == ((signed short int) WrapperStruct00.var_1_12)) VAL [WrapperStruct00={4:0}, isInitial=1] [L120-L121] return (((((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_21))) && (WrapperStruct00.var_1_22 == ((signed short int) WrapperStruct00.var_1_12)) ; [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.3s, OverallIterations: 21, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3134 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3052 mSDsluCounter, 9116 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6653 mSDsCounter, 611 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7238 IncrementalHoareTripleChecker+Invalid, 7849 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 611 mSolverCounterUnsat, 2463 mSDtfsCounter, 7238 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1899 GetRequests, 1681 SyntacticMatches, 19 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 906 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=310occurred in iteration=8, InterpolantAutomatonStates: 190, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 1300 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 10.8s InterpolantComputationTime, 3320 NumberOfCodeBlocks, 3320 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 3548 ConstructedInterpolants, 0 QuantifiedInterpolants, 13989 SizeOfPredicates, 24 NumberOfNonLiveVariables, 1756 ConjunctsInSsa, 102 ConjunctsInUnsatCore, 27 InterpolantComputations, 17 PerfectInterpolantSequences, 14523/14688 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:30:15,569 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...