/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/bitvector/s3_srvr_3a_alt.BV.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-09 21:50:21,532 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-09 21:50:21,534 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-09 21:50:21,569 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-09 21:50:21,569 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-09 21:50:21,570 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-09 21:50:21,571 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-09 21:50:21,573 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-09 21:50:21,591 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-09 21:50:21,592 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-09 21:50:21,593 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-09 21:50:21,594 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-09 21:50:21,594 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-09 21:50:21,597 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-09 21:50:21,598 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-09 21:50:21,599 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-09 21:50:21,600 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-09 21:50:21,600 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-09 21:50:21,602 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-09 21:50:21,603 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-09 21:50:21,605 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-09 21:50:21,610 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-09 21:50:21,613 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-09 21:50:21,615 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-09 21:50:21,620 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-09 21:50:21,620 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-09 21:50:21,620 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-09 21:50:21,621 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-09 21:50:21,621 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-09 21:50:21,622 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-09 21:50:21,622 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-09 21:50:21,622 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-09 21:50:21,623 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-09 21:50:21,623 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-09 21:50:21,624 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-09 21:50:21,624 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-09 21:50:21,625 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-09 21:50:21,625 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-09 21:50:21,625 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-09 21:50:21,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-09 21:50:21,627 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-09 21:50:21,635 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-09 21:50:21,661 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-09 21:50:21,662 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-09 21:50:21,662 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-09 21:50:21,662 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-09 21:50:21,663 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-09 21:50:21,663 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-09 21:50:21,663 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-09 21:50:21,664 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-09 21:50:21,664 INFO L138 SettingsManager]: * Use SBE=true [2022-01-09 21:50:21,664 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-09 21:50:21,664 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-09 21:50:21,665 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-09 21:50:21,665 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-09 21:50:21,665 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-09 21:50:21,665 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-09 21:50:21,665 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-09 21:50:21,665 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-09 21:50:21,665 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-09 21:50:21,665 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-09 21:50:21,666 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-09 21:50:21,666 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-09 21:50:21,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-09 21:50:21,666 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-09 21:50:21,666 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-09 21:50:21,666 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-09 21:50:21,666 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-09 21:50:21,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-09 21:50:21,666 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-09 21:50:21,667 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-09 21:50:21,667 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-09 21:50:21,667 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-09 21:50:21,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-09 21:50:21,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-09 21:50:21,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-09 21:50:21,898 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-09 21:50:21,898 INFO L275 PluginConnector]: CDTParser initialized [2022-01-09 21:50:21,899 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2022-01-09 21:50:21,961 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30a5f22c2/4b660ec81f994cf5bf6a81aab9ac0f9c/FLAGd98ac0d83 [2022-01-09 21:50:22,361 INFO L306 CDTParser]: Found 1 translation units. [2022-01-09 21:50:22,362 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_srvr_3a_alt.BV.c.cil.c [2022-01-09 21:50:22,382 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30a5f22c2/4b660ec81f994cf5bf6a81aab9ac0f9c/FLAGd98ac0d83 [2022-01-09 21:50:22,749 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30a5f22c2/4b660ec81f994cf5bf6a81aab9ac0f9c [2022-01-09 21:50:22,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-09 21:50:22,752 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-09 21:50:22,756 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-09 21:50:22,756 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-09 21:50:22,758 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-09 21:50:22,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:50:22" (1/1) ... [2022-01-09 21:50:22,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59bf0014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:22, skipping insertion in model container [2022-01-09 21:50:22,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:50:22" (1/1) ... [2022-01-09 21:50:22,768 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-09 21:50:22,798 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-09 21:50:23,010 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_srvr_3a_alt.BV.c.cil.c[44628,44641] [2022-01-09 21:50:23,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-09 21:50:23,032 INFO L203 MainTranslator]: Completed pre-run [2022-01-09 21:50:23,097 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_srvr_3a_alt.BV.c.cil.c[44628,44641] [2022-01-09 21:50:23,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-09 21:50:23,114 INFO L208 MainTranslator]: Completed translation [2022-01-09 21:50:23,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:23 WrapperNode [2022-01-09 21:50:23,115 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-09 21:50:23,117 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-09 21:50:23,117 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-09 21:50:23,117 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-09 21:50:23,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:23" (1/1) ... [2022-01-09 21:50:23,144 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:23" (1/1) ... [2022-01-09 21:50:23,177 INFO L137 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 522 [2022-01-09 21:50:23,178 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-09 21:50:23,183 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-09 21:50:23,183 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-09 21:50:23,183 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-09 21:50:23,190 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:23" (1/1) ... [2022-01-09 21:50:23,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:23" (1/1) ... [2022-01-09 21:50:23,197 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:23" (1/1) ... [2022-01-09 21:50:23,197 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:23" (1/1) ... [2022-01-09 21:50:23,210 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:23" (1/1) ... [2022-01-09 21:50:23,219 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:23" (1/1) ... [2022-01-09 21:50:23,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:23" (1/1) ... [2022-01-09 21:50:23,222 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-09 21:50:23,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-09 21:50:23,223 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-09 21:50:23,223 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-09 21:50:23,228 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:23" (1/1) ... [2022-01-09 21:50:23,234 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-09 21:50:23,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 21:50:23,256 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-09 21:50:23,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-09 21:50:23,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-09 21:50:23,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-09 21:50:23,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-09 21:50:23,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-09 21:50:23,403 INFO L234 CfgBuilder]: Building ICFG [2022-01-09 21:50:23,404 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-09 21:50:23,437 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-09 21:50:23,891 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-01-09 21:50:23,891 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-01-09 21:50:23,891 INFO L275 CfgBuilder]: Performing block encoding [2022-01-09 21:50:23,901 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-09 21:50:23,901 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-09 21:50:23,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:50:23 BoogieIcfgContainer [2022-01-09 21:50:23,904 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-09 21:50:23,907 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-09 21:50:23,907 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-09 21:50:23,909 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-09 21:50:23,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:50:22" (1/3) ... [2022-01-09 21:50:23,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1173003c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:50:23, skipping insertion in model container [2022-01-09 21:50:23,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:50:23" (2/3) ... [2022-01-09 21:50:23,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1173003c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:50:23, skipping insertion in model container [2022-01-09 21:50:23,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:50:23" (3/3) ... [2022-01-09 21:50:23,912 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_3a_alt.BV.c.cil.c [2022-01-09 21:50:23,916 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-09 21:50:23,916 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-09 21:50:23,955 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-09 21:50:23,960 INFO L339 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=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-09 21:50:23,960 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-09 21:50:23,974 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 136 states have (on average 1.7426470588235294) internal successors, (237), 137 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:23,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-09 21:50:23,981 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 21:50:23,982 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 21:50:23,982 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 21:50:23,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 21:50:23,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1632003015, now seen corresponding path program 1 times [2022-01-09 21:50:23,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 21:50:23,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575838308] [2022-01-09 21:50:23,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 21:50:23,999 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 21:50:24,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 21:50:24,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 21:50:24,236 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 21:50:24,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575838308] [2022-01-09 21:50:24,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575838308] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 21:50:24,237 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 21:50:24,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 21:50:24,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137890202] [2022-01-09 21:50:24,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 21:50:24,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 21:50:24,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 21:50:24,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 21:50:24,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:24,276 INFO L87 Difference]: Start difference. First operand has 138 states, 136 states have (on average 1.7426470588235294) internal successors, (237), 137 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:24,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 21:50:24,528 INFO L93 Difference]: Finished difference Result 323 states and 559 transitions. [2022-01-09 21:50:24,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 21:50:24,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-01-09 21:50:24,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 21:50:24,545 INFO L225 Difference]: With dead ends: 323 [2022-01-09 21:50:24,545 INFO L226 Difference]: Without dead ends: 171 [2022-01-09 21:50:24,549 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:24,553 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 167 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 21:50:24,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 187 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 21:50:24,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-01-09 21:50:24,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 166. [2022-01-09 21:50:24,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.6424242424242423) internal successors, (271), 165 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:24,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 271 transitions. [2022-01-09 21:50:24,595 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 271 transitions. Word has length 44 [2022-01-09 21:50:24,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 21:50:24,596 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 271 transitions. [2022-01-09 21:50:24,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:24,597 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 271 transitions. [2022-01-09 21:50:24,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-09 21:50:24,601 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 21:50:24,601 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 21:50:24,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-09 21:50:24,602 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 21:50:24,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 21:50:24,603 INFO L85 PathProgramCache]: Analyzing trace with hash -954579415, now seen corresponding path program 1 times [2022-01-09 21:50:24,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 21:50:24,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10315395] [2022-01-09 21:50:24,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 21:50:24,603 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 21:50:24,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 21:50:24,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 21:50:24,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 21:50:24,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10315395] [2022-01-09 21:50:24,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10315395] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 21:50:24,670 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 21:50:24,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 21:50:24,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092090890] [2022-01-09 21:50:24,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 21:50:24,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 21:50:24,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 21:50:24,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 21:50:24,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:24,672 INFO L87 Difference]: Start difference. First operand 166 states and 271 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:24,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 21:50:24,877 INFO L93 Difference]: Finished difference Result 372 states and 616 transitions. [2022-01-09 21:50:24,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 21:50:24,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-01-09 21:50:24,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 21:50:24,879 INFO L225 Difference]: With dead ends: 372 [2022-01-09 21:50:24,879 INFO L226 Difference]: Without dead ends: 212 [2022-01-09 21:50:24,880 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:24,881 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 125 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 21:50:24,881 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 137 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 21:50:24,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-01-09 21:50:24,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 207. [2022-01-09 21:50:24,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.6893203883495145) internal successors, (348), 206 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:24,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 348 transitions. [2022-01-09 21:50:24,910 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 348 transitions. Word has length 45 [2022-01-09 21:50:24,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 21:50:24,911 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 348 transitions. [2022-01-09 21:50:24,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:24,911 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 348 transitions. [2022-01-09 21:50:24,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-09 21:50:24,913 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 21:50:24,913 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 21:50:24,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-09 21:50:24,913 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 21:50:24,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 21:50:24,914 INFO L85 PathProgramCache]: Analyzing trace with hash -420309214, now seen corresponding path program 1 times [2022-01-09 21:50:24,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 21:50:24,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756502664] [2022-01-09 21:50:24,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 21:50:24,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 21:50:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 21:50:24,989 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 21:50:24,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 21:50:24,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756502664] [2022-01-09 21:50:24,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756502664] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 21:50:24,990 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 21:50:24,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 21:50:24,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062520391] [2022-01-09 21:50:24,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 21:50:24,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 21:50:24,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 21:50:24,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 21:50:24,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:24,992 INFO L87 Difference]: Start difference. First operand 207 states and 348 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:25,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 21:50:25,144 INFO L93 Difference]: Finished difference Result 437 states and 742 transitions. [2022-01-09 21:50:25,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 21:50:25,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-01-09 21:50:25,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 21:50:25,146 INFO L225 Difference]: With dead ends: 437 [2022-01-09 21:50:25,147 INFO L226 Difference]: Without dead ends: 238 [2022-01-09 21:50:25,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:25,149 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 132 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 21:50:25,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 138 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 21:50:25,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-01-09 21:50:25,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2022-01-09 21:50:25,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.7046413502109705) internal successors, (404), 237 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:25,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 404 transitions. [2022-01-09 21:50:25,165 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 404 transitions. Word has length 72 [2022-01-09 21:50:25,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 21:50:25,165 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 404 transitions. [2022-01-09 21:50:25,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:25,166 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 404 transitions. [2022-01-09 21:50:25,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-09 21:50:25,168 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 21:50:25,168 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 21:50:25,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-09 21:50:25,168 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 21:50:25,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 21:50:25,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1606429448, now seen corresponding path program 1 times [2022-01-09 21:50:25,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 21:50:25,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297435439] [2022-01-09 21:50:25,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 21:50:25,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 21:50:25,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 21:50:25,210 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-09 21:50:25,210 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 21:50:25,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297435439] [2022-01-09 21:50:25,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297435439] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 21:50:25,211 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 21:50:25,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 21:50:25,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187932560] [2022-01-09 21:50:25,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 21:50:25,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 21:50:25,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 21:50:25,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 21:50:25,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:25,213 INFO L87 Difference]: Start difference. First operand 238 states and 404 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:25,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 21:50:25,337 INFO L93 Difference]: Finished difference Result 485 states and 824 transitions. [2022-01-09 21:50:25,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 21:50:25,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2022-01-09 21:50:25,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 21:50:25,342 INFO L225 Difference]: With dead ends: 485 [2022-01-09 21:50:25,342 INFO L226 Difference]: Without dead ends: 255 [2022-01-09 21:50:25,343 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:25,344 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 154 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 21:50:25,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 145 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 21:50:25,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-01-09 21:50:25,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 253. [2022-01-09 21:50:25,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 1.6944444444444444) internal successors, (427), 252 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:25,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 427 transitions. [2022-01-09 21:50:25,359 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 427 transitions. Word has length 84 [2022-01-09 21:50:25,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 21:50:25,359 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 427 transitions. [2022-01-09 21:50:25,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:25,360 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 427 transitions. [2022-01-09 21:50:25,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-09 21:50:25,361 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 21:50:25,361 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 21:50:25,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-09 21:50:25,361 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 21:50:25,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 21:50:25,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1610778141, now seen corresponding path program 1 times [2022-01-09 21:50:25,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 21:50:25,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289921378] [2022-01-09 21:50:25,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 21:50:25,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 21:50:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 21:50:25,430 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 21:50:25,430 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 21:50:25,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289921378] [2022-01-09 21:50:25,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289921378] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 21:50:25,431 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 21:50:25,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 21:50:25,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986922052] [2022-01-09 21:50:25,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 21:50:25,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 21:50:25,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 21:50:25,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 21:50:25,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:25,433 INFO L87 Difference]: Start difference. First operand 253 states and 427 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:25,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 21:50:25,588 INFO L93 Difference]: Finished difference Result 544 states and 923 transitions. [2022-01-09 21:50:25,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 21:50:25,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2022-01-09 21:50:25,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 21:50:25,593 INFO L225 Difference]: With dead ends: 544 [2022-01-09 21:50:25,593 INFO L226 Difference]: Without dead ends: 299 [2022-01-09 21:50:25,594 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:25,601 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 129 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 21:50:25,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 138 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 21:50:25,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-01-09 21:50:25,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 295. [2022-01-09 21:50:25,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 294 states have (on average 1.7040816326530612) internal successors, (501), 294 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:25,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 501 transitions. [2022-01-09 21:50:25,619 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 501 transitions. Word has length 84 [2022-01-09 21:50:25,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 21:50:25,619 INFO L470 AbstractCegarLoop]: Abstraction has 295 states and 501 transitions. [2022-01-09 21:50:25,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:25,619 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 501 transitions. [2022-01-09 21:50:25,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-01-09 21:50:25,620 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 21:50:25,621 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 21:50:25,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-09 21:50:25,621 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 21:50:25,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 21:50:25,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1470428767, now seen corresponding path program 1 times [2022-01-09 21:50:25,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 21:50:25,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537811810] [2022-01-09 21:50:25,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 21:50:25,622 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 21:50:25,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 21:50:25,704 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-09 21:50:25,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 21:50:25,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537811810] [2022-01-09 21:50:25,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537811810] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 21:50:25,705 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 21:50:25,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 21:50:25,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790496022] [2022-01-09 21:50:25,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 21:50:25,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 21:50:25,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 21:50:25,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 21:50:25,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:25,706 INFO L87 Difference]: Start difference. First operand 295 states and 501 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:25,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 21:50:25,811 INFO L93 Difference]: Finished difference Result 584 states and 992 transitions. [2022-01-09 21:50:25,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 21:50:25,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2022-01-09 21:50:25,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 21:50:25,815 INFO L225 Difference]: With dead ends: 584 [2022-01-09 21:50:25,815 INFO L226 Difference]: Without dead ends: 297 [2022-01-09 21:50:25,816 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:25,819 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 153 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 21:50:25,823 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 133 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 21:50:25,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-01-09 21:50:25,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 295. [2022-01-09 21:50:25,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 294 states have (on average 1.6904761904761905) internal successors, (497), 294 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:25,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 497 transitions. [2022-01-09 21:50:25,839 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 497 transitions. Word has length 85 [2022-01-09 21:50:25,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 21:50:25,839 INFO L470 AbstractCegarLoop]: Abstraction has 295 states and 497 transitions. [2022-01-09 21:50:25,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:25,839 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 497 transitions. [2022-01-09 21:50:25,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-01-09 21:50:25,840 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 21:50:25,840 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 21:50:25,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-09 21:50:25,841 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 21:50:25,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 21:50:25,843 INFO L85 PathProgramCache]: Analyzing trace with hash -564791579, now seen corresponding path program 1 times [2022-01-09 21:50:25,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 21:50:25,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416695747] [2022-01-09 21:50:25,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 21:50:25,843 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 21:50:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 21:50:25,909 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 21:50:25,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 21:50:25,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416695747] [2022-01-09 21:50:25,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416695747] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 21:50:25,910 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 21:50:25,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 21:50:25,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557093542] [2022-01-09 21:50:25,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 21:50:25,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 21:50:25,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 21:50:25,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 21:50:25,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:25,911 INFO L87 Difference]: Start difference. First operand 295 states and 497 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:26,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 21:50:26,049 INFO L93 Difference]: Finished difference Result 586 states and 987 transitions. [2022-01-09 21:50:26,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 21:50:26,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2022-01-09 21:50:26,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 21:50:26,051 INFO L225 Difference]: With dead ends: 586 [2022-01-09 21:50:26,051 INFO L226 Difference]: Without dead ends: 297 [2022-01-09 21:50:26,051 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:26,052 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 126 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 21:50:26,052 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 138 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 21:50:26,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-01-09 21:50:26,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 293. [2022-01-09 21:50:26,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 292 states have (on average 1.6849315068493151) internal successors, (492), 292 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:26,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 492 transitions. [2022-01-09 21:50:26,061 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 492 transitions. Word has length 85 [2022-01-09 21:50:26,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 21:50:26,061 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 492 transitions. [2022-01-09 21:50:26,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:26,062 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 492 transitions. [2022-01-09 21:50:26,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-09 21:50:26,063 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 21:50:26,063 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 21:50:26,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-09 21:50:26,063 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 21:50:26,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 21:50:26,064 INFO L85 PathProgramCache]: Analyzing trace with hash -378579321, now seen corresponding path program 1 times [2022-01-09 21:50:26,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 21:50:26,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032905262] [2022-01-09 21:50:26,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 21:50:26,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 21:50:26,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 21:50:26,095 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-01-09 21:50:26,095 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 21:50:26,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032905262] [2022-01-09 21:50:26,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032905262] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 21:50:26,096 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 21:50:26,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 21:50:26,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848786367] [2022-01-09 21:50:26,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 21:50:26,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 21:50:26,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 21:50:26,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 21:50:26,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:26,097 INFO L87 Difference]: Start difference. First operand 293 states and 492 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:26,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 21:50:26,190 INFO L93 Difference]: Finished difference Result 586 states and 983 transitions. [2022-01-09 21:50:26,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 21:50:26,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2022-01-09 21:50:26,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 21:50:26,192 INFO L225 Difference]: With dead ends: 586 [2022-01-09 21:50:26,192 INFO L226 Difference]: Without dead ends: 301 [2022-01-09 21:50:26,193 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:26,193 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 158 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 21:50:26,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 143 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 21:50:26,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-01-09 21:50:26,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2022-01-09 21:50:26,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 1.6566666666666667) internal successors, (497), 300 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:26,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 497 transitions. [2022-01-09 21:50:26,202 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 497 transitions. Word has length 96 [2022-01-09 21:50:26,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 21:50:26,202 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 497 transitions. [2022-01-09 21:50:26,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:26,203 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 497 transitions. [2022-01-09 21:50:26,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-01-09 21:50:26,204 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 21:50:26,205 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 21:50:26,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-09 21:50:26,207 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 21:50:26,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 21:50:26,213 INFO L85 PathProgramCache]: Analyzing trace with hash 183697243, now seen corresponding path program 1 times [2022-01-09 21:50:26,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 21:50:26,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706986137] [2022-01-09 21:50:26,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 21:50:26,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 21:50:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 21:50:26,258 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-09 21:50:26,259 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 21:50:26,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706986137] [2022-01-09 21:50:26,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706986137] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 21:50:26,259 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 21:50:26,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 21:50:26,259 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303812929] [2022-01-09 21:50:26,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 21:50:26,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 21:50:26,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 21:50:26,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 21:50:26,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:26,262 INFO L87 Difference]: Start difference. First operand 301 states and 497 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:26,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 21:50:26,384 INFO L93 Difference]: Finished difference Result 625 states and 1035 transitions. [2022-01-09 21:50:26,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 21:50:26,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2022-01-09 21:50:26,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 21:50:26,387 INFO L225 Difference]: With dead ends: 625 [2022-01-09 21:50:26,390 INFO L226 Difference]: Without dead ends: 332 [2022-01-09 21:50:26,391 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:26,393 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 137 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 21:50:26,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 136 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 21:50:26,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-01-09 21:50:26,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2022-01-09 21:50:26,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 329 states have (on average 1.6534954407294833) internal successors, (544), 329 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:26,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 544 transitions. [2022-01-09 21:50:26,403 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 544 transitions. Word has length 98 [2022-01-09 21:50:26,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 21:50:26,403 INFO L470 AbstractCegarLoop]: Abstraction has 330 states and 544 transitions. [2022-01-09 21:50:26,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:26,404 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 544 transitions. [2022-01-09 21:50:26,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-09 21:50:26,405 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 21:50:26,405 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 21:50:26,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-09 21:50:26,405 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 21:50:26,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 21:50:26,406 INFO L85 PathProgramCache]: Analyzing trace with hash 156444990, now seen corresponding path program 1 times [2022-01-09 21:50:26,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 21:50:26,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929697945] [2022-01-09 21:50:26,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 21:50:26,406 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 21:50:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 21:50:26,454 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-09 21:50:26,455 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 21:50:26,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929697945] [2022-01-09 21:50:26,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929697945] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 21:50:26,455 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 21:50:26,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 21:50:26,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136409933] [2022-01-09 21:50:26,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 21:50:26,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 21:50:26,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 21:50:26,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 21:50:26,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:26,456 INFO L87 Difference]: Start difference. First operand 330 states and 544 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:26,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 21:50:26,573 INFO L93 Difference]: Finished difference Result 686 states and 1135 transitions. [2022-01-09 21:50:26,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 21:50:26,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-09 21:50:26,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 21:50:26,575 INFO L225 Difference]: With dead ends: 686 [2022-01-09 21:50:26,575 INFO L226 Difference]: Without dead ends: 364 [2022-01-09 21:50:26,576 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:26,576 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 139 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 21:50:26,576 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 143 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 21:50:26,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-01-09 21:50:26,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 357. [2022-01-09 21:50:26,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 1.646067415730337) internal successors, (586), 356 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:26,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 586 transitions. [2022-01-09 21:50:26,586 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 586 transitions. Word has length 99 [2022-01-09 21:50:26,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 21:50:26,586 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 586 transitions. [2022-01-09 21:50:26,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:26,587 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 586 transitions. [2022-01-09 21:50:26,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-09 21:50:26,588 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 21:50:26,588 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 21:50:26,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-09 21:50:26,588 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 21:50:26,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 21:50:26,589 INFO L85 PathProgramCache]: Analyzing trace with hash -2130209566, now seen corresponding path program 1 times [2022-01-09 21:50:26,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 21:50:26,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614749607] [2022-01-09 21:50:26,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 21:50:26,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 21:50:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 21:50:26,614 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-09 21:50:26,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 21:50:26,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614749607] [2022-01-09 21:50:26,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614749607] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 21:50:26,614 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 21:50:26,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 21:50:26,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991774653] [2022-01-09 21:50:26,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 21:50:26,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 21:50:26,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 21:50:26,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 21:50:26,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:26,616 INFO L87 Difference]: Start difference. First operand 357 states and 586 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:26,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 21:50:26,725 INFO L93 Difference]: Finished difference Result 708 states and 1162 transitions. [2022-01-09 21:50:26,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 21:50:26,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-01-09 21:50:26,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 21:50:26,727 INFO L225 Difference]: With dead ends: 708 [2022-01-09 21:50:26,727 INFO L226 Difference]: Without dead ends: 359 [2022-01-09 21:50:26,728 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:26,729 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 136 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 21:50:26,729 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 136 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 21:50:26,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-01-09 21:50:26,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 357. [2022-01-09 21:50:26,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 1.6348314606741574) internal successors, (582), 356 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:26,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 582 transitions. [2022-01-09 21:50:26,739 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 582 transitions. Word has length 99 [2022-01-09 21:50:26,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 21:50:26,740 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 582 transitions. [2022-01-09 21:50:26,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:26,743 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 582 transitions. [2022-01-09 21:50:26,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-01-09 21:50:26,745 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 21:50:26,745 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 21:50:26,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-09 21:50:26,745 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 21:50:26,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 21:50:26,745 INFO L85 PathProgramCache]: Analyzing trace with hash -417318601, now seen corresponding path program 1 times [2022-01-09 21:50:26,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 21:50:26,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875485312] [2022-01-09 21:50:26,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 21:50:26,746 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 21:50:26,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 21:50:26,784 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-09 21:50:26,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 21:50:26,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875485312] [2022-01-09 21:50:26,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875485312] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 21:50:26,785 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 21:50:26,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 21:50:26,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897995982] [2022-01-09 21:50:26,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 21:50:26,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 21:50:26,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 21:50:26,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 21:50:26,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:26,787 INFO L87 Difference]: Start difference. First operand 357 states and 582 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:26,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 21:50:26,902 INFO L93 Difference]: Finished difference Result 713 states and 1164 transitions. [2022-01-09 21:50:26,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 21:50:26,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2022-01-09 21:50:26,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 21:50:26,904 INFO L225 Difference]: With dead ends: 713 [2022-01-09 21:50:26,904 INFO L226 Difference]: Without dead ends: 364 [2022-01-09 21:50:26,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:26,905 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 138 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 21:50:26,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 143 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 21:50:26,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-01-09 21:50:26,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 357. [2022-01-09 21:50:26,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 1.6207865168539326) internal successors, (577), 356 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:26,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 577 transitions. [2022-01-09 21:50:26,916 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 577 transitions. Word has length 100 [2022-01-09 21:50:26,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 21:50:26,916 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 577 transitions. [2022-01-09 21:50:26,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:26,916 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 577 transitions. [2022-01-09 21:50:26,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-09 21:50:26,917 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 21:50:26,918 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 21:50:26,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-09 21:50:26,918 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 21:50:26,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 21:50:26,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1321281040, now seen corresponding path program 1 times [2022-01-09 21:50:26,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 21:50:26,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391825607] [2022-01-09 21:50:26,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 21:50:26,919 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 21:50:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 21:50:26,948 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-09 21:50:26,948 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 21:50:26,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391825607] [2022-01-09 21:50:26,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391825607] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 21:50:26,949 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 21:50:26,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 21:50:26,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741565544] [2022-01-09 21:50:26,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 21:50:26,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 21:50:26,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 21:50:26,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 21:50:26,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:26,950 INFO L87 Difference]: Start difference. First operand 357 states and 577 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:27,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 21:50:27,043 INFO L93 Difference]: Finished difference Result 731 states and 1183 transitions. [2022-01-09 21:50:27,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 21:50:27,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-09 21:50:27,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 21:50:27,045 INFO L225 Difference]: With dead ends: 731 [2022-01-09 21:50:27,045 INFO L226 Difference]: Without dead ends: 382 [2022-01-09 21:50:27,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:27,046 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 145 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 21:50:27,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 139 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 21:50:27,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-01-09 21:50:27,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 378. [2022-01-09 21:50:27,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 1.6074270557029178) internal successors, (606), 377 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:27,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 606 transitions. [2022-01-09 21:50:27,058 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 606 transitions. Word has length 105 [2022-01-09 21:50:27,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 21:50:27,058 INFO L470 AbstractCegarLoop]: Abstraction has 378 states and 606 transitions. [2022-01-09 21:50:27,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:27,058 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 606 transitions. [2022-01-09 21:50:27,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-09 21:50:27,059 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 21:50:27,059 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 21:50:27,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-09 21:50:27,060 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 21:50:27,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 21:50:27,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1276596489, now seen corresponding path program 1 times [2022-01-09 21:50:27,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 21:50:27,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185815666] [2022-01-09 21:50:27,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 21:50:27,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 21:50:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 21:50:27,087 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-09 21:50:27,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 21:50:27,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185815666] [2022-01-09 21:50:27,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185815666] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 21:50:27,087 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 21:50:27,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 21:50:27,088 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995486838] [2022-01-09 21:50:27,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 21:50:27,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 21:50:27,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 21:50:27,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 21:50:27,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:27,089 INFO L87 Difference]: Start difference. First operand 378 states and 606 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:27,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 21:50:27,183 INFO L93 Difference]: Finished difference Result 752 states and 1206 transitions. [2022-01-09 21:50:27,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 21:50:27,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-01-09 21:50:27,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 21:50:27,185 INFO L225 Difference]: With dead ends: 752 [2022-01-09 21:50:27,185 INFO L226 Difference]: Without dead ends: 382 [2022-01-09 21:50:27,186 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:27,186 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 144 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 21:50:27,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 139 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 21:50:27,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-01-09 21:50:27,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 378. [2022-01-09 21:50:27,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 1.5915119363395225) internal successors, (600), 377 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:27,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 600 transitions. [2022-01-09 21:50:27,198 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 600 transitions. Word has length 106 [2022-01-09 21:50:27,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 21:50:27,198 INFO L470 AbstractCegarLoop]: Abstraction has 378 states and 600 transitions. [2022-01-09 21:50:27,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:27,198 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 600 transitions. [2022-01-09 21:50:27,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-09 21:50:27,199 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 21:50:27,199 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 21:50:27,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-09 21:50:27,200 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 21:50:27,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 21:50:27,200 INFO L85 PathProgramCache]: Analyzing trace with hash -687746511, now seen corresponding path program 1 times [2022-01-09 21:50:27,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 21:50:27,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292718879] [2022-01-09 21:50:27,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 21:50:27,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 21:50:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 21:50:27,233 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-09 21:50:27,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 21:50:27,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292718879] [2022-01-09 21:50:27,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292718879] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 21:50:27,233 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 21:50:27,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 21:50:27,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684095188] [2022-01-09 21:50:27,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 21:50:27,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 21:50:27,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 21:50:27,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 21:50:27,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:27,235 INFO L87 Difference]: Start difference. First operand 378 states and 600 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:27,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 21:50:27,279 INFO L93 Difference]: Finished difference Result 1072 states and 1706 transitions. [2022-01-09 21:50:27,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 21:50:27,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2022-01-09 21:50:27,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 21:50:27,282 INFO L225 Difference]: With dead ends: 1072 [2022-01-09 21:50:27,283 INFO L226 Difference]: Without dead ends: 702 [2022-01-09 21:50:27,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:27,286 INFO L933 BasicCegarLoop]: 350 mSDtfsCounter, 131 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 21:50:27,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 531 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 21:50:27,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2022-01-09 21:50:27,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 702. [2022-01-09 21:50:27,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 701 states have (on average 1.587731811697575) internal successors, (1113), 701 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:27,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1113 transitions. [2022-01-09 21:50:27,309 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1113 transitions. Word has length 121 [2022-01-09 21:50:27,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 21:50:27,309 INFO L470 AbstractCegarLoop]: Abstraction has 702 states and 1113 transitions. [2022-01-09 21:50:27,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:27,309 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1113 transitions. [2022-01-09 21:50:27,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-09 21:50:27,311 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 21:50:27,311 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 21:50:27,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-09 21:50:27,311 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 21:50:27,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 21:50:27,311 INFO L85 PathProgramCache]: Analyzing trace with hash 209646767, now seen corresponding path program 1 times [2022-01-09 21:50:27,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 21:50:27,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669680194] [2022-01-09 21:50:27,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 21:50:27,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 21:50:27,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 21:50:27,350 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-09 21:50:27,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 21:50:27,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669680194] [2022-01-09 21:50:27,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669680194] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 21:50:27,352 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 21:50:27,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 21:50:27,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752321085] [2022-01-09 21:50:27,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 21:50:27,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 21:50:27,353 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 21:50:27,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 21:50:27,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:27,353 INFO L87 Difference]: Start difference. First operand 702 states and 1113 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:27,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 21:50:27,399 INFO L93 Difference]: Finished difference Result 1760 states and 2796 transitions. [2022-01-09 21:50:27,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 21:50:27,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2022-01-09 21:50:27,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 21:50:27,403 INFO L225 Difference]: With dead ends: 1760 [2022-01-09 21:50:27,403 INFO L226 Difference]: Without dead ends: 1066 [2022-01-09 21:50:27,404 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:27,404 INFO L933 BasicCegarLoop]: 346 mSDtfsCounter, 129 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 21:50:27,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 527 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 21:50:27,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2022-01-09 21:50:27,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1066. [2022-01-09 21:50:27,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1066 states, 1065 states have (on average 1.5868544600938967) internal successors, (1690), 1065 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:27,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1690 transitions. [2022-01-09 21:50:27,436 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1690 transitions. Word has length 121 [2022-01-09 21:50:27,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 21:50:27,436 INFO L470 AbstractCegarLoop]: Abstraction has 1066 states and 1690 transitions. [2022-01-09 21:50:27,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:27,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1690 transitions. [2022-01-09 21:50:27,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-09 21:50:27,438 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 21:50:27,438 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 21:50:27,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-09 21:50:27,439 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 21:50:27,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 21:50:27,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1728089839, now seen corresponding path program 1 times [2022-01-09 21:50:27,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 21:50:27,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184360394] [2022-01-09 21:50:27,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 21:50:27,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 21:50:27,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 21:50:27,471 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-09 21:50:27,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 21:50:27,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184360394] [2022-01-09 21:50:27,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184360394] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 21:50:27,471 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 21:50:27,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 21:50:27,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855229632] [2022-01-09 21:50:27,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 21:50:27,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 21:50:27,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 21:50:27,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 21:50:27,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:27,473 INFO L87 Difference]: Start difference. First operand 1066 states and 1690 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:27,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 21:50:27,537 INFO L93 Difference]: Finished difference Result 2488 states and 3950 transitions. [2022-01-09 21:50:27,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 21:50:27,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2022-01-09 21:50:27,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 21:50:27,542 INFO L225 Difference]: With dead ends: 2488 [2022-01-09 21:50:27,542 INFO L226 Difference]: Without dead ends: 1430 [2022-01-09 21:50:27,543 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:27,544 INFO L933 BasicCegarLoop]: 353 mSDtfsCounter, 151 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 21:50:27,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 534 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 21:50:27,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2022-01-09 21:50:27,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1430. [2022-01-09 21:50:27,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1430 states, 1429 states have (on average 1.5864240727781667) internal successors, (2267), 1429 states have internal predecessors, (2267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:27,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 2267 transitions. [2022-01-09 21:50:27,582 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 2267 transitions. Word has length 121 [2022-01-09 21:50:27,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 21:50:27,582 INFO L470 AbstractCegarLoop]: Abstraction has 1430 states and 2267 transitions. [2022-01-09 21:50:27,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:27,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 2267 transitions. [2022-01-09 21:50:27,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-09 21:50:27,584 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 21:50:27,585 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 21:50:27,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-09 21:50:27,585 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 21:50:27,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 21:50:27,585 INFO L85 PathProgramCache]: Analyzing trace with hash -305304207, now seen corresponding path program 1 times [2022-01-09 21:50:27,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 21:50:27,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384594283] [2022-01-09 21:50:27,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 21:50:27,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 21:50:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 21:50:27,607 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-01-09 21:50:27,607 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 21:50:27,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384594283] [2022-01-09 21:50:27,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384594283] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 21:50:27,607 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 21:50:27,607 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 21:50:27,608 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213960766] [2022-01-09 21:50:27,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 21:50:27,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 21:50:27,608 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 21:50:27,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 21:50:27,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:27,609 INFO L87 Difference]: Start difference. First operand 1430 states and 2267 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:27,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 21:50:27,663 INFO L93 Difference]: Finished difference Result 3198 states and 5073 transitions. [2022-01-09 21:50:27,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 21:50:27,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2022-01-09 21:50:27,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 21:50:27,669 INFO L225 Difference]: With dead ends: 3198 [2022-01-09 21:50:27,669 INFO L226 Difference]: Without dead ends: 1776 [2022-01-09 21:50:27,671 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:27,672 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 166 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 21:50:27,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 380 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 21:50:27,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2022-01-09 21:50:27,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1776. [2022-01-09 21:50:27,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1776 states, 1775 states have (on average 1.5847887323943661) internal successors, (2813), 1775 states have internal predecessors, (2813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:27,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 2813 transitions. [2022-01-09 21:50:27,720 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 2813 transitions. Word has length 121 [2022-01-09 21:50:27,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 21:50:27,721 INFO L470 AbstractCegarLoop]: Abstraction has 1776 states and 2813 transitions. [2022-01-09 21:50:27,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:27,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 2813 transitions. [2022-01-09 21:50:27,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-01-09 21:50:27,725 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 21:50:27,725 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 21:50:27,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-09 21:50:27,725 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 21:50:27,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 21:50:27,726 INFO L85 PathProgramCache]: Analyzing trace with hash 230274424, now seen corresponding path program 1 times [2022-01-09 21:50:27,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 21:50:27,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617989428] [2022-01-09 21:50:27,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 21:50:27,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 21:50:27,740 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-09 21:50:27,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1678713870] [2022-01-09 21:50:27,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 21:50:27,741 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 21:50:27,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 21:50:27,743 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) [2022-01-09 21:50:27,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-09 21:50:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 21:50:27,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-09 21:50:27,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 21:50:28,212 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-01-09 21:50:28,212 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-09 21:50:28,212 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 21:50:28,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617989428] [2022-01-09 21:50:28,212 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-09 21:50:28,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678713870] [2022-01-09 21:50:28,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678713870] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 21:50:28,213 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 21:50:28,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 21:50:28,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784981415] [2022-01-09 21:50:28,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 21:50:28,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 21:50:28,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 21:50:28,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 21:50:28,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:28,215 INFO L87 Difference]: Start difference. First operand 1776 states and 2813 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:28,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 21:50:28,360 INFO L93 Difference]: Finished difference Result 3589 states and 5669 transitions. [2022-01-09 21:50:28,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 21:50:28,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2022-01-09 21:50:28,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 21:50:28,367 INFO L225 Difference]: With dead ends: 3589 [2022-01-09 21:50:28,367 INFO L226 Difference]: Without dead ends: 1821 [2022-01-09 21:50:28,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:28,370 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 29 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 21:50:28,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 288 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 21:50:28,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2022-01-09 21:50:28,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1776. [2022-01-09 21:50:28,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1776 states, 1775 states have (on average 1.544225352112676) internal successors, (2741), 1775 states have internal predecessors, (2741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:28,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 2741 transitions. [2022-01-09 21:50:28,460 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 2741 transitions. Word has length 199 [2022-01-09 21:50:28,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 21:50:28,461 INFO L470 AbstractCegarLoop]: Abstraction has 1776 states and 2741 transitions. [2022-01-09 21:50:28,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:28,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 2741 transitions. [2022-01-09 21:50:28,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-01-09 21:50:28,465 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 21:50:28,465 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 21:50:28,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-09 21:50:28,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 21:50:28,689 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 21:50:28,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 21:50:28,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1368505586, now seen corresponding path program 1 times [2022-01-09 21:50:28,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 21:50:28,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556025091] [2022-01-09 21:50:28,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 21:50:28,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 21:50:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 21:50:28,734 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-01-09 21:50:28,734 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 21:50:28,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556025091] [2022-01-09 21:50:28,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556025091] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 21:50:28,734 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 21:50:28,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 21:50:28,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001130911] [2022-01-09 21:50:28,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 21:50:28,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 21:50:28,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 21:50:28,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 21:50:28,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:28,736 INFO L87 Difference]: Start difference. First operand 1776 states and 2741 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:28,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 21:50:28,902 INFO L93 Difference]: Finished difference Result 3606 states and 5542 transitions. [2022-01-09 21:50:28,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 21:50:28,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 212 [2022-01-09 21:50:28,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 21:50:28,908 INFO L225 Difference]: With dead ends: 3606 [2022-01-09 21:50:28,908 INFO L226 Difference]: Without dead ends: 1838 [2022-01-09 21:50:28,910 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:28,911 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 148 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 21:50:28,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 157 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 21:50:28,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2022-01-09 21:50:28,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1776. [2022-01-09 21:50:28,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1776 states, 1775 states have (on average 1.5014084507042254) internal successors, (2665), 1775 states have internal predecessors, (2665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:28,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 2665 transitions. [2022-01-09 21:50:28,965 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 2665 transitions. Word has length 212 [2022-01-09 21:50:28,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 21:50:28,965 INFO L470 AbstractCegarLoop]: Abstraction has 1776 states and 2665 transitions. [2022-01-09 21:50:28,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:28,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 2665 transitions. [2022-01-09 21:50:28,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-01-09 21:50:28,970 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 21:50:28,970 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 21:50:28,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-09 21:50:28,971 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 21:50:28,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 21:50:28,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1759452965, now seen corresponding path program 1 times [2022-01-09 21:50:28,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 21:50:28,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79291108] [2022-01-09 21:50:28,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 21:50:28,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 21:50:28,988 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-09 21:50:28,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [848360265] [2022-01-09 21:50:28,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 21:50:28,989 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 21:50:28,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 21:50:28,990 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) [2022-01-09 21:50:29,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-09 21:50:29,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 21:50:29,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-09 21:50:29,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 21:50:29,425 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 362 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-01-09 21:50:29,425 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-09 21:50:29,425 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 21:50:29,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79291108] [2022-01-09 21:50:29,426 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-09 21:50:29,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848360265] [2022-01-09 21:50:29,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848360265] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 21:50:29,426 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 21:50:29,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 21:50:29,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939557372] [2022-01-09 21:50:29,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 21:50:29,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 21:50:29,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 21:50:29,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 21:50:29,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:29,433 INFO L87 Difference]: Start difference. First operand 1776 states and 2665 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:29,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 21:50:29,572 INFO L93 Difference]: Finished difference Result 3784 states and 5678 transitions. [2022-01-09 21:50:29,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 21:50:29,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 241 [2022-01-09 21:50:29,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 21:50:29,579 INFO L225 Difference]: With dead ends: 3784 [2022-01-09 21:50:29,579 INFO L226 Difference]: Without dead ends: 1891 [2022-01-09 21:50:29,581 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:29,582 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 26 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 21:50:29,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 279 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 21:50:29,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2022-01-09 21:50:29,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 1846. [2022-01-09 21:50:29,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1846 states, 1845 states have (on average 1.4742547425474255) internal successors, (2720), 1845 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:29,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1846 states to 1846 states and 2720 transitions. [2022-01-09 21:50:29,647 INFO L78 Accepts]: Start accepts. Automaton has 1846 states and 2720 transitions. Word has length 241 [2022-01-09 21:50:29,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 21:50:29,648 INFO L470 AbstractCegarLoop]: Abstraction has 1846 states and 2720 transitions. [2022-01-09 21:50:29,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:29,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 2720 transitions. [2022-01-09 21:50:29,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2022-01-09 21:50:29,652 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 21:50:29,653 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 21:50:29,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-09 21:50:29,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-01-09 21:50:29,875 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 21:50:29,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 21:50:29,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1825507112, now seen corresponding path program 1 times [2022-01-09 21:50:29,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 21:50:29,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466557960] [2022-01-09 21:50:29,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 21:50:29,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 21:50:29,891 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-09 21:50:29,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1771662001] [2022-01-09 21:50:29,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 21:50:29,891 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 21:50:29,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 21:50:29,892 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) [2022-01-09 21:50:29,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-09 21:50:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 21:50:29,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-09 21:50:29,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 21:50:30,304 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2022-01-09 21:50:30,305 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-09 21:50:30,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 21:50:30,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466557960] [2022-01-09 21:50:30,305 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-09 21:50:30,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771662001] [2022-01-09 21:50:30,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771662001] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 21:50:30,305 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 21:50:30,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 21:50:30,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801635260] [2022-01-09 21:50:30,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 21:50:30,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 21:50:30,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 21:50:30,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 21:50:30,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:30,307 INFO L87 Difference]: Start difference. First operand 1846 states and 2720 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:30,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 21:50:30,481 INFO L93 Difference]: Finished difference Result 3729 states and 5483 transitions. [2022-01-09 21:50:30,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 21:50:30,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 255 [2022-01-09 21:50:30,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 21:50:30,488 INFO L225 Difference]: With dead ends: 3729 [2022-01-09 21:50:30,488 INFO L226 Difference]: Without dead ends: 1891 [2022-01-09 21:50:30,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:30,490 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 145 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 21:50:30,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 178 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 21:50:30,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2022-01-09 21:50:30,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 1846. [2022-01-09 21:50:30,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1846 states, 1845 states have (on average 1.43739837398374) internal successors, (2652), 1845 states have internal predecessors, (2652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:30,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1846 states to 1846 states and 2652 transitions. [2022-01-09 21:50:30,539 INFO L78 Accepts]: Start accepts. Automaton has 1846 states and 2652 transitions. Word has length 255 [2022-01-09 21:50:30,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 21:50:30,540 INFO L470 AbstractCegarLoop]: Abstraction has 1846 states and 2652 transitions. [2022-01-09 21:50:30,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:30,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 2652 transitions. [2022-01-09 21:50:30,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-01-09 21:50:30,544 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 21:50:30,545 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 21:50:30,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-09 21:50:30,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 21:50:30,768 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 21:50:30,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 21:50:30,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1622703552, now seen corresponding path program 1 times [2022-01-09 21:50:30,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 21:50:30,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258484968] [2022-01-09 21:50:30,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 21:50:30,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 21:50:30,786 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-09 21:50:30,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2133302262] [2022-01-09 21:50:30,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 21:50:30,787 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 21:50:30,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 21:50:30,788 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) [2022-01-09 21:50:30,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-09 21:50:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 21:50:30,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-09 21:50:30,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 21:50:31,316 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2022-01-09 21:50:31,316 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-09 21:50:31,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 21:50:31,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258484968] [2022-01-09 21:50:31,316 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-09 21:50:31,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133302262] [2022-01-09 21:50:31,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133302262] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 21:50:31,317 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 21:50:31,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 21:50:31,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733447712] [2022-01-09 21:50:31,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 21:50:31,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 21:50:31,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 21:50:31,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 21:50:31,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:31,318 INFO L87 Difference]: Start difference. First operand 1846 states and 2652 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:31,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 21:50:31,395 INFO L93 Difference]: Finished difference Result 5426 states and 7794 transitions. [2022-01-09 21:50:31,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 21:50:31,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 269 [2022-01-09 21:50:31,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 21:50:31,408 INFO L225 Difference]: With dead ends: 5426 [2022-01-09 21:50:31,408 INFO L226 Difference]: Without dead ends: 3588 [2022-01-09 21:50:31,411 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:31,411 INFO L933 BasicCegarLoop]: 349 mSDtfsCounter, 119 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 21:50:31,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 534 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 21:50:31,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3588 states. [2022-01-09 21:50:31,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3588 to 3586. [2022-01-09 21:50:31,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3586 states, 3585 states have (on average 1.4337517433751743) internal successors, (5140), 3585 states have internal predecessors, (5140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:31,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3586 states to 3586 states and 5140 transitions. [2022-01-09 21:50:31,513 INFO L78 Accepts]: Start accepts. Automaton has 3586 states and 5140 transitions. Word has length 269 [2022-01-09 21:50:31,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 21:50:31,513 INFO L470 AbstractCegarLoop]: Abstraction has 3586 states and 5140 transitions. [2022-01-09 21:50:31,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:31,514 INFO L276 IsEmpty]: Start isEmpty. Operand 3586 states and 5140 transitions. [2022-01-09 21:50:31,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2022-01-09 21:50:31,522 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 21:50:31,524 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 21:50:31,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-09 21:50:31,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 21:50:31,743 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 21:50:31,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 21:50:31,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1812515673, now seen corresponding path program 1 times [2022-01-09 21:50:31,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 21:50:31,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347989176] [2022-01-09 21:50:31,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 21:50:31,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 21:50:31,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 21:50:31,784 INFO L134 CoverageAnalysis]: Checked inductivity of 877 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2022-01-09 21:50:31,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 21:50:31,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347989176] [2022-01-09 21:50:31,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347989176] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 21:50:31,785 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 21:50:31,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 21:50:31,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864633000] [2022-01-09 21:50:31,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 21:50:31,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 21:50:31,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 21:50:31,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 21:50:31,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:31,786 INFO L87 Difference]: Start difference. First operand 3586 states and 5140 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:31,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 21:50:31,939 INFO L93 Difference]: Finished difference Result 7286 states and 10440 transitions. [2022-01-09 21:50:31,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 21:50:31,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 307 [2022-01-09 21:50:31,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 21:50:31,951 INFO L225 Difference]: With dead ends: 7286 [2022-01-09 21:50:31,951 INFO L226 Difference]: Without dead ends: 3708 [2022-01-09 21:50:31,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:31,956 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 12 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 21:50:31,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 299 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 21:50:31,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3708 states. [2022-01-09 21:50:32,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3708 to 3678. [2022-01-09 21:50:32,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3678 states, 3677 states have (on average 1.4283383192820234) internal successors, (5252), 3677 states have internal predecessors, (5252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:32,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3678 states to 3678 states and 5252 transitions. [2022-01-09 21:50:32,076 INFO L78 Accepts]: Start accepts. Automaton has 3678 states and 5252 transitions. Word has length 307 [2022-01-09 21:50:32,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 21:50:32,076 INFO L470 AbstractCegarLoop]: Abstraction has 3678 states and 5252 transitions. [2022-01-09 21:50:32,076 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:32,076 INFO L276 IsEmpty]: Start isEmpty. Operand 3678 states and 5252 transitions. [2022-01-09 21:50:32,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2022-01-09 21:50:32,084 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 21:50:32,085 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 21:50:32,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-09 21:50:32,085 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 21:50:32,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 21:50:32,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1267987889, now seen corresponding path program 1 times [2022-01-09 21:50:32,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 21:50:32,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848697100] [2022-01-09 21:50:32,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 21:50:32,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 21:50:32,100 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-09 21:50:32,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1801912266] [2022-01-09 21:50:32,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 21:50:32,101 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 21:50:32,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 21:50:32,102 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 21:50:32,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-09 21:50:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 21:50:32,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-09 21:50:32,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 21:50:32,657 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2022-01-09 21:50:32,658 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-09 21:50:32,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 21:50:32,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848697100] [2022-01-09 21:50:32,658 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-09 21:50:32,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801912266] [2022-01-09 21:50:32,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801912266] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 21:50:32,658 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 21:50:32,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 21:50:32,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502024711] [2022-01-09 21:50:32,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 21:50:32,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 21:50:32,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 21:50:32,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 21:50:32,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:32,660 INFO L87 Difference]: Start difference. First operand 3678 states and 5252 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:32,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 21:50:32,807 INFO L93 Difference]: Finished difference Result 7348 states and 10492 transitions. [2022-01-09 21:50:32,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 21:50:32,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 320 [2022-01-09 21:50:32,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 21:50:32,823 INFO L225 Difference]: With dead ends: 7348 [2022-01-09 21:50:32,824 INFO L226 Difference]: Without dead ends: 2173 [2022-01-09 21:50:32,829 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:32,829 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 11 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 21:50:32,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 287 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 21:50:32,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2173 states. [2022-01-09 21:50:32,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2173 to 2173. [2022-01-09 21:50:32,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2173 states, 2172 states have (on average 1.405156537753223) internal successors, (3052), 2172 states have internal predecessors, (3052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:32,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2173 states to 2173 states and 3052 transitions. [2022-01-09 21:50:32,889 INFO L78 Accepts]: Start accepts. Automaton has 2173 states and 3052 transitions. Word has length 320 [2022-01-09 21:50:32,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 21:50:32,889 INFO L470 AbstractCegarLoop]: Abstraction has 2173 states and 3052 transitions. [2022-01-09 21:50:32,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:32,890 INFO L276 IsEmpty]: Start isEmpty. Operand 2173 states and 3052 transitions. [2022-01-09 21:50:32,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2022-01-09 21:50:32,909 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 21:50:32,909 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 21:50:32,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-01-09 21:50:33,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-01-09 21:50:33,131 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 21:50:33,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 21:50:33,131 INFO L85 PathProgramCache]: Analyzing trace with hash 493001237, now seen corresponding path program 1 times [2022-01-09 21:50:33,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 21:50:33,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733426468] [2022-01-09 21:50:33,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 21:50:33,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 21:50:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 21:50:33,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 435 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2022-01-09 21:50:33,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 21:50:33,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733426468] [2022-01-09 21:50:33,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733426468] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 21:50:33,178 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 21:50:33,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 21:50:33,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882231952] [2022-01-09 21:50:33,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 21:50:33,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 21:50:33,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 21:50:33,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 21:50:33,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:33,180 INFO L87 Difference]: Start difference. First operand 2173 states and 3052 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:33,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 21:50:33,313 INFO L93 Difference]: Finished difference Result 4560 states and 6428 transitions. [2022-01-09 21:50:33,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 21:50:33,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 327 [2022-01-09 21:50:33,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 21:50:33,318 INFO L225 Difference]: With dead ends: 4560 [2022-01-09 21:50:33,318 INFO L226 Difference]: Without dead ends: 2395 [2022-01-09 21:50:33,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:33,322 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 28 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 21:50:33,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 296 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 21:50:33,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2395 states. [2022-01-09 21:50:33,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2395 to 2323. [2022-01-09 21:50:33,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2323 states, 2322 states have (on average 1.3919035314384152) internal successors, (3232), 2322 states have internal predecessors, (3232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:33,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2323 states to 2323 states and 3232 transitions. [2022-01-09 21:50:33,386 INFO L78 Accepts]: Start accepts. Automaton has 2323 states and 3232 transitions. Word has length 327 [2022-01-09 21:50:33,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 21:50:33,386 INFO L470 AbstractCegarLoop]: Abstraction has 2323 states and 3232 transitions. [2022-01-09 21:50:33,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:33,387 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 3232 transitions. [2022-01-09 21:50:33,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2022-01-09 21:50:33,393 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 21:50:33,393 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 21:50:33,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-09 21:50:33,394 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 21:50:33,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 21:50:33,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1757399063, now seen corresponding path program 1 times [2022-01-09 21:50:33,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 21:50:33,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518576249] [2022-01-09 21:50:33,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 21:50:33,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 21:50:33,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 21:50:33,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2022-01-09 21:50:33,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 21:50:33,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518576249] [2022-01-09 21:50:33,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518576249] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 21:50:33,440 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 21:50:33,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 21:50:33,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837849912] [2022-01-09 21:50:33,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 21:50:33,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 21:50:33,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 21:50:33,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 21:50:33,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:33,442 INFO L87 Difference]: Start difference. First operand 2323 states and 3232 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:33,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 21:50:33,577 INFO L93 Difference]: Finished difference Result 4680 states and 6524 transitions. [2022-01-09 21:50:33,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 21:50:33,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 353 [2022-01-09 21:50:33,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 21:50:33,581 INFO L225 Difference]: With dead ends: 4680 [2022-01-09 21:50:33,581 INFO L226 Difference]: Without dead ends: 2365 [2022-01-09 21:50:33,584 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:33,584 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 18 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 21:50:33,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 295 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 21:50:33,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2022-01-09 21:50:33,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 2323. [2022-01-09 21:50:33,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2323 states, 2322 states have (on average 1.3712316968130922) internal successors, (3184), 2322 states have internal predecessors, (3184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:33,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2323 states to 2323 states and 3184 transitions. [2022-01-09 21:50:33,639 INFO L78 Accepts]: Start accepts. Automaton has 2323 states and 3184 transitions. Word has length 353 [2022-01-09 21:50:33,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 21:50:33,639 INFO L470 AbstractCegarLoop]: Abstraction has 2323 states and 3184 transitions. [2022-01-09 21:50:33,639 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:33,640 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 3184 transitions. [2022-01-09 21:50:33,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2022-01-09 21:50:33,645 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 21:50:33,646 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 21:50:33,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-09 21:50:33,646 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 21:50:33,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 21:50:33,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1876884711, now seen corresponding path program 1 times [2022-01-09 21:50:33,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 21:50:33,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111057237] [2022-01-09 21:50:33,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 21:50:33,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 21:50:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 21:50:33,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2022-01-09 21:50:33,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 21:50:33,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111057237] [2022-01-09 21:50:33,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111057237] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 21:50:33,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273639112] [2022-01-09 21:50:33,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 21:50:33,716 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 21:50:33,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 21:50:33,720 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 21:50:33,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-09 21:50:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 21:50:33,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-09 21:50:33,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 21:50:34,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2022-01-09 21:50:34,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 21:50:34,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2022-01-09 21:50:34,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273639112] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 21:50:34,831 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 21:50:34,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-09 21:50:34,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220190877] [2022-01-09 21:50:34,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 21:50:34,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-09 21:50:34,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 21:50:34,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-09 21:50:34,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-09 21:50:34,833 INFO L87 Difference]: Start difference. First operand 2323 states and 3184 transitions. Second operand has 6 states, 6 states have (on average 40.0) internal successors, (240), 6 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:35,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 21:50:35,314 INFO L93 Difference]: Finished difference Result 7001 states and 9579 transitions. [2022-01-09 21:50:35,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-09 21:50:35,315 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.0) internal successors, (240), 6 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 370 [2022-01-09 21:50:35,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 21:50:35,322 INFO L225 Difference]: With dead ends: 7001 [2022-01-09 21:50:35,322 INFO L226 Difference]: Without dead ends: 4529 [2022-01-09 21:50:35,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 750 GetRequests, 742 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-01-09 21:50:35,327 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 520 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-09 21:50:35,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [520 Valid, 588 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-09 21:50:35,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4529 states. [2022-01-09 21:50:35,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4529 to 2356. [2022-01-09 21:50:35,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2356 states, 2355 states have (on average 1.3511677282377919) internal successors, (3182), 2355 states have internal predecessors, (3182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:35,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 2356 states and 3182 transitions. [2022-01-09 21:50:35,403 INFO L78 Accepts]: Start accepts. Automaton has 2356 states and 3182 transitions. Word has length 370 [2022-01-09 21:50:35,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 21:50:35,404 INFO L470 AbstractCegarLoop]: Abstraction has 2356 states and 3182 transitions. [2022-01-09 21:50:35,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.0) internal successors, (240), 6 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:35,404 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 3182 transitions. [2022-01-09 21:50:35,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2022-01-09 21:50:35,409 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 21:50:35,409 INFO L514 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 21:50:35,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-01-09 21:50:35,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-01-09 21:50:35,624 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 21:50:35,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 21:50:35,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1628763683, now seen corresponding path program 1 times [2022-01-09 21:50:35,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 21:50:35,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450927009] [2022-01-09 21:50:35,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 21:50:35,625 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 21:50:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 21:50:35,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2015 backedges. 975 proven. 0 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2022-01-09 21:50:35,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 21:50:35,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450927009] [2022-01-09 21:50:35,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450927009] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 21:50:35,704 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 21:50:35,704 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 21:50:35,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324882137] [2022-01-09 21:50:35,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 21:50:35,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 21:50:35,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 21:50:35,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 21:50:35,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:35,707 INFO L87 Difference]: Start difference. First operand 2356 states and 3182 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:35,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 21:50:35,843 INFO L93 Difference]: Finished difference Result 4716 states and 6364 transitions. [2022-01-09 21:50:35,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 21:50:35,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 438 [2022-01-09 21:50:35,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 21:50:35,848 INFO L225 Difference]: With dead ends: 4716 [2022-01-09 21:50:35,848 INFO L226 Difference]: Without dead ends: 2368 [2022-01-09 21:50:35,850 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:35,851 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 11 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 21:50:35,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 286 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 21:50:35,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2022-01-09 21:50:35,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2356. [2022-01-09 21:50:35,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2356 states, 2355 states have (on average 1.3307855626326963) internal successors, (3134), 2355 states have internal predecessors, (3134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:35,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 2356 states and 3134 transitions. [2022-01-09 21:50:35,910 INFO L78 Accepts]: Start accepts. Automaton has 2356 states and 3134 transitions. Word has length 438 [2022-01-09 21:50:35,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 21:50:35,911 INFO L470 AbstractCegarLoop]: Abstraction has 2356 states and 3134 transitions. [2022-01-09 21:50:35,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:35,911 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 3134 transitions. [2022-01-09 21:50:35,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2022-01-09 21:50:35,916 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 21:50:35,916 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 21:50:35,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-09 21:50:35,917 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 21:50:35,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 21:50:35,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1752367566, now seen corresponding path program 1 times [2022-01-09 21:50:35,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 21:50:35,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108019723] [2022-01-09 21:50:35,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 21:50:35,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 21:50:35,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 21:50:35,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2338 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2022-01-09 21:50:35,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 21:50:35,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108019723] [2022-01-09 21:50:35,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108019723] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 21:50:35,977 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 21:50:35,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 21:50:35,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156005577] [2022-01-09 21:50:35,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 21:50:35,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 21:50:35,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 21:50:35,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 21:50:35,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:35,979 INFO L87 Difference]: Start difference. First operand 2356 states and 3134 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:36,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 21:50:36,124 INFO L93 Difference]: Finished difference Result 4920 states and 6562 transitions. [2022-01-09 21:50:36,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 21:50:36,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 470 [2022-01-09 21:50:36,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 21:50:36,129 INFO L225 Difference]: With dead ends: 4920 [2022-01-09 21:50:36,129 INFO L226 Difference]: Without dead ends: 2572 [2022-01-09 21:50:36,131 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:36,132 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 11 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 21:50:36,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 284 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 21:50:36,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2022-01-09 21:50:36,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 2560. [2022-01-09 21:50:36,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2560 states, 2559 states have (on average 1.3161391168425165) internal successors, (3368), 2559 states have internal predecessors, (3368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:36,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2560 states and 3368 transitions. [2022-01-09 21:50:36,194 INFO L78 Accepts]: Start accepts. Automaton has 2560 states and 3368 transitions. Word has length 470 [2022-01-09 21:50:36,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 21:50:36,194 INFO L470 AbstractCegarLoop]: Abstraction has 2560 states and 3368 transitions. [2022-01-09 21:50:36,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:36,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 3368 transitions. [2022-01-09 21:50:36,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2022-01-09 21:50:36,200 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 21:50:36,201 INFO L514 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 21:50:36,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-09 21:50:36,201 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 21:50:36,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 21:50:36,201 INFO L85 PathProgramCache]: Analyzing trace with hash -742298620, now seen corresponding path program 1 times [2022-01-09 21:50:36,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 21:50:36,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627434485] [2022-01-09 21:50:36,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 21:50:36,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 21:50:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 21:50:36,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3103 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2022-01-09 21:50:36,280 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 21:50:36,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627434485] [2022-01-09 21:50:36,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627434485] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 21:50:36,280 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 21:50:36,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 21:50:36,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902351052] [2022-01-09 21:50:36,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 21:50:36,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 21:50:36,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 21:50:36,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 21:50:36,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:36,281 INFO L87 Difference]: Start difference. First operand 2560 states and 3368 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:36,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 21:50:36,424 INFO L93 Difference]: Finished difference Result 5340 states and 7054 transitions. [2022-01-09 21:50:36,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 21:50:36,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 532 [2022-01-09 21:50:36,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 21:50:36,430 INFO L225 Difference]: With dead ends: 5340 [2022-01-09 21:50:36,430 INFO L226 Difference]: Without dead ends: 2788 [2022-01-09 21:50:36,432 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 21:50:36,433 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 11 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 21:50:36,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 284 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 21:50:36,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2788 states. [2022-01-09 21:50:36,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2788 to 2776. [2022-01-09 21:50:36,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2776 states, 2775 states have (on average 1.3023423423423424) internal successors, (3614), 2775 states have internal predecessors, (3614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:36,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2776 states to 2776 states and 3614 transitions. [2022-01-09 21:50:36,500 INFO L78 Accepts]: Start accepts. Automaton has 2776 states and 3614 transitions. Word has length 532 [2022-01-09 21:50:36,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 21:50:36,500 INFO L470 AbstractCegarLoop]: Abstraction has 2776 states and 3614 transitions. [2022-01-09 21:50:36,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:36,500 INFO L276 IsEmpty]: Start isEmpty. Operand 2776 states and 3614 transitions. [2022-01-09 21:50:36,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2022-01-09 21:50:36,506 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 21:50:36,506 INFO L514 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 21:50:36,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-09 21:50:36,507 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 21:50:36,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 21:50:36,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1835374162, now seen corresponding path program 1 times [2022-01-09 21:50:36,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 21:50:36,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588201779] [2022-01-09 21:50:36,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 21:50:36,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 21:50:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 21:50:36,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2022-01-09 21:50:36,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 21:50:36,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588201779] [2022-01-09 21:50:36,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588201779] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 21:50:36,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709185804] [2022-01-09 21:50:36,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 21:50:36,601 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 21:50:36,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 21:50:36,603 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 21:50:36,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-09 21:50:36,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 21:50:36,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 912 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-09 21:50:36,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 21:50:37,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2022-01-09 21:50:37,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 21:50:38,212 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2022-01-09 21:50:38,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709185804] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 21:50:38,213 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 21:50:38,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-01-09 21:50:38,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137928321] [2022-01-09 21:50:38,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 21:50:38,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-09 21:50:38,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 21:50:38,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-09 21:50:38,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-01-09 21:50:38,215 INFO L87 Difference]: Start difference. First operand 2776 states and 3614 transitions. Second operand has 8 states, 8 states have (on average 41.375) internal successors, (331), 8 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:38,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 21:50:38,641 INFO L93 Difference]: Finished difference Result 5113 states and 6691 transitions. [2022-01-09 21:50:38,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-09 21:50:38,641 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 41.375) internal successors, (331), 8 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 598 [2022-01-09 21:50:38,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 21:50:38,642 INFO L225 Difference]: With dead ends: 5113 [2022-01-09 21:50:38,642 INFO L226 Difference]: Without dead ends: 0 [2022-01-09 21:50:38,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1204 GetRequests, 1195 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-01-09 21:50:38,646 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 193 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-09 21:50:38,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 1139 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-09 21:50:38,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-09 21:50:38,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-09 21:50:38,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:38,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-09 21:50:38,647 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 598 [2022-01-09 21:50:38,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 21:50:38,647 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-09 21:50:38,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 41.375) internal successors, (331), 8 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 21:50:38,647 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-09 21:50:38,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-09 21:50:38,649 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-09 21:50:38,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-09 21:50:38,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 21:50:38,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-09 21:50:49,612 INFO L858 garLoopResultBuilder]: For program point L531(lines 531 536) no Hoare annotation was computed. [2022-01-09 21:50:49,612 INFO L858 garLoopResultBuilder]: For program point L399(lines 399 405) no Hoare annotation was computed. [2022-01-09 21:50:49,612 INFO L858 garLoopResultBuilder]: For program point L366(lines 366 385) no Hoare annotation was computed. [2022-01-09 21:50:49,613 INFO L854 garLoopResultBuilder]: At program point L598(lines 109 666) the Hoare annotation is: (let ((.cse10 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse8 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse9 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse13 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse14 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse12 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse6 .cse7 .cse8 .cse9) (and .cse10 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448) (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse8) (and .cse4 .cse11) (and (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse10 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse7 .cse8 .cse12 .cse9) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3) (and .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse13 .cse6 .cse7 .cse8 .cse9) (and .cse13 .cse14 .cse15) (and .cse4 .cse14 .cse15) (and .cse12 .cse11) (and .cse13 .cse11) (and .cse14 .cse12 .cse15))) [2022-01-09 21:50:49,613 INFO L858 garLoopResultBuilder]: For program point L565(lines 565 569) no Hoare annotation was computed. [2022-01-09 21:50:49,613 INFO L858 garLoopResultBuilder]: For program point L499(lines 499 503) no Hoare annotation was computed. [2022-01-09 21:50:49,613 INFO L858 garLoopResultBuilder]: For program point L367(lines 367 371) no Hoare annotation was computed. [2022-01-09 21:50:49,613 INFO L858 garLoopResultBuilder]: For program point L367-2(lines 366 383) no Hoare annotation was computed. [2022-01-09 21:50:49,613 INFO L858 garLoopResultBuilder]: For program point L202(lines 202 605) no Hoare annotation was computed. [2022-01-09 21:50:49,613 INFO L858 garLoopResultBuilder]: For program point L169(lines 169 616) no Hoare annotation was computed. [2022-01-09 21:50:49,613 INFO L858 garLoopResultBuilder]: For program point L136(lines 136 627) no Hoare annotation was computed. [2022-01-09 21:50:49,613 INFO L858 garLoopResultBuilder]: For program point L467(lines 467 471) no Hoare annotation was computed. [2022-01-09 21:50:49,614 INFO L858 garLoopResultBuilder]: For program point L335-1(lines 335 344) no Hoare annotation was computed. [2022-01-09 21:50:49,614 INFO L861 garLoopResultBuilder]: At program point L667(lines 108 668) the Hoare annotation is: true [2022-01-09 21:50:49,614 INFO L858 garLoopResultBuilder]: For program point L205(lines 205 604) no Hoare annotation was computed. [2022-01-09 21:50:49,614 INFO L858 garLoopResultBuilder]: For program point L172(lines 172 615) no Hoare annotation was computed. [2022-01-09 21:50:49,614 INFO L858 garLoopResultBuilder]: For program point L139(lines 139 626) no Hoare annotation was computed. [2022-01-09 21:50:49,614 INFO L858 garLoopResultBuilder]: For program point L239(lines 239 256) no Hoare annotation was computed. [2022-01-09 21:50:49,614 INFO L854 garLoopResultBuilder]: At program point L206(lines 202 605) the Hoare annotation is: (let ((.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse5 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse9 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse10 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2022-01-09 21:50:49,614 INFO L854 garLoopResultBuilder]: At program point L173(lines 169 616) the Hoare annotation is: (let ((.cse13 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse18 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse17 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse16 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse12 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse14 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15))) [2022-01-09 21:50:49,614 INFO L858 garLoopResultBuilder]: For program point L239-2(lines 219 597) no Hoare annotation was computed. [2022-01-09 21:50:49,614 INFO L858 garLoopResultBuilder]: For program point L636(lines 636 664) no Hoare annotation was computed. [2022-01-09 21:50:49,615 INFO L858 garLoopResultBuilder]: For program point L339(lines 339 343) no Hoare annotation was computed. [2022-01-09 21:50:49,615 INFO L858 garLoopResultBuilder]: For program point L637(lines 637 661) no Hoare annotation was computed. [2022-01-09 21:50:49,615 INFO L858 garLoopResultBuilder]: For program point L571(lines 571 575) no Hoare annotation was computed. [2022-01-09 21:50:49,615 INFO L858 garLoopResultBuilder]: For program point L538(lines 538 542) no Hoare annotation was computed. [2022-01-09 21:50:49,615 INFO L858 garLoopResultBuilder]: For program point L571-2(lines 571 575) no Hoare annotation was computed. [2022-01-09 21:50:49,615 INFO L858 garLoopResultBuilder]: For program point L472(lines 472 483) no Hoare annotation was computed. [2022-01-09 21:50:49,615 INFO L858 garLoopResultBuilder]: For program point L538-2(lines 219 597) no Hoare annotation was computed. [2022-01-09 21:50:49,615 INFO L858 garLoopResultBuilder]: For program point L439(lines 439 443) no Hoare annotation was computed. [2022-01-09 21:50:49,615 INFO L854 garLoopResultBuilder]: At program point L373(lines 356 391) the Hoare annotation is: (let ((.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse17 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse16 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse18 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse12 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse13 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse14 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse7 .cse8 .cse9 .cse10 .cse12 .cse18 .cse14) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse16 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18 .cse13 .cse14 .cse15) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-01-09 21:50:49,615 INFO L858 garLoopResultBuilder]: For program point L241(lines 241 246) no Hoare annotation was computed. [2022-01-09 21:50:49,615 INFO L858 garLoopResultBuilder]: For program point L208(lines 208 603) no Hoare annotation was computed. [2022-01-09 21:50:49,615 INFO L858 garLoopResultBuilder]: For program point L175(lines 175 614) no Hoare annotation was computed. [2022-01-09 21:50:49,616 INFO L858 garLoopResultBuilder]: For program point L142(lines 142 625) no Hoare annotation was computed. [2022-01-09 21:50:49,616 INFO L854 garLoopResultBuilder]: At program point L109-2(lines 109 666) the Hoare annotation is: (let ((.cse10 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse8 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse9 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse13 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse11 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse14 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse12 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse6 .cse7 .cse8 .cse9) (and .cse10 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448) (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse8) (and .cse4 .cse11) (and (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse10 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse7 .cse8 .cse12 .cse9) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3) (and .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse13 .cse6 .cse7 .cse8 .cse9) (and .cse13 .cse14 .cse15) (and .cse4 .cse14 .cse15) (and .cse12 .cse11) (and .cse13 .cse11) (and .cse14 .cse12 .cse15))) [2022-01-09 21:50:49,616 INFO L858 garLoopResultBuilder]: For program point L671(lines 671 675) no Hoare annotation was computed. [2022-01-09 21:50:49,616 INFO L858 garLoopResultBuilder]: For program point L638(lines 638 647) no Hoare annotation was computed. [2022-01-09 21:50:49,616 INFO L858 garLoopResultBuilder]: For program point L671-2(lines 671 675) no Hoare annotation was computed. [2022-01-09 21:50:49,616 INFO L858 garLoopResultBuilder]: For program point L638-2(lines 637 659) no Hoare annotation was computed. [2022-01-09 21:50:49,616 INFO L854 garLoopResultBuilder]: At program point L407(lines 398 429) the Hoare annotation is: (let ((.cse6 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse15 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse16 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse17 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse18 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse8 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse13 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse14 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse14 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16 .cse14 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14) (and .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2022-01-09 21:50:49,616 INFO L854 garLoopResultBuilder]: At program point L176(lines 175 614) the Hoare annotation is: (let ((.cse6 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse7 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse5 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse2 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse3 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse5) (and .cse6 .cse1 .cse2 .cse5) (and .cse6 .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse2) (and .cse1 .cse2 .cse3 .cse7) (and .cse0 .cse1 .cse2 .cse5) (and .cse1 .cse2 .cse7 .cse5) (and .cse4 .cse1 .cse2 .cse3))) [2022-01-09 21:50:49,617 INFO L854 garLoopResultBuilder]: At program point L143(lines 136 627) the Hoare annotation is: (let ((.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse17 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse16 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse18 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse12 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse13 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse14 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse7 .cse8 .cse9 .cse10 .cse12 .cse18 .cse14) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse16 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18 .cse13 .cse14 .cse15) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-01-09 21:50:49,617 INFO L858 garLoopResultBuilder]: For program point L110(line 110) no Hoare annotation was computed. [2022-01-09 21:50:49,617 INFO L858 garLoopResultBuilder]: For program point L375(lines 375 379) no Hoare annotation was computed. [2022-01-09 21:50:49,617 INFO L858 garLoopResultBuilder]: For program point L640(lines 640 644) no Hoare annotation was computed. [2022-01-09 21:50:49,617 INFO L858 garLoopResultBuilder]: For program point L409(lines 409 415) no Hoare annotation was computed. [2022-01-09 21:50:49,619 INFO L858 garLoopResultBuilder]: For program point L211(lines 211 602) no Hoare annotation was computed. [2022-01-09 21:50:49,619 INFO L858 garLoopResultBuilder]: For program point L178(lines 178 613) no Hoare annotation was computed. [2022-01-09 21:50:49,619 INFO L858 garLoopResultBuilder]: For program point L145(lines 145 624) no Hoare annotation was computed. [2022-01-09 21:50:49,619 INFO L858 garLoopResultBuilder]: For program point L112(lines 112 635) no Hoare annotation was computed. [2022-01-09 21:50:49,619 INFO L858 garLoopResultBuilder]: For program point L476(lines 476 480) no Hoare annotation was computed. [2022-01-09 21:50:49,619 INFO L854 garLoopResultBuilder]: At program point L212(lines 208 603) the Hoare annotation is: (let ((.cse0 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse1 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse1) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1) (and .cse0 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))))) [2022-01-09 21:50:49,620 INFO L854 garLoopResultBuilder]: At program point L113(lines 112 635) the Hoare annotation is: (let ((.cse0 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse1 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse3 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)))) (or (and .cse0 .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3) (and .cse0 .cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse2 .cse3) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse3))) [2022-01-09 21:50:49,620 INFO L858 garLoopResultBuilder]: For program point L511(lines 511 515) no Hoare annotation was computed. [2022-01-09 21:50:49,620 INFO L858 garLoopResultBuilder]: For program point L511-2(lines 219 597) no Hoare annotation was computed. [2022-01-09 21:50:49,620 INFO L858 garLoopResultBuilder]: For program point L247(lines 247 252) no Hoare annotation was computed. [2022-01-09 21:50:49,620 INFO L858 garLoopResultBuilder]: For program point L214(lines 214 601) no Hoare annotation was computed. [2022-01-09 21:50:49,620 INFO L858 garLoopResultBuilder]: For program point L181(lines 181 612) no Hoare annotation was computed. [2022-01-09 21:50:49,620 INFO L858 garLoopResultBuilder]: For program point L148(lines 148 623) no Hoare annotation was computed. [2022-01-09 21:50:49,627 INFO L858 garLoopResultBuilder]: For program point L115(lines 115 634) no Hoare annotation was computed. [2022-01-09 21:50:49,627 INFO L854 garLoopResultBuilder]: At program point L215(lines 214 601) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2022-01-09 21:50:49,627 INFO L854 garLoopResultBuilder]: At program point L182(lines 178 613) the Hoare annotation is: (let ((.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse16 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse17 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (.cse18 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse12 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse13 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse14 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse8 .cse17 .cse9 .cse10 .cse12 .cse18 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse17 .cse9 .cse10 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse7 .cse8 .cse17 .cse9 .cse10 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18 .cse13 .cse14 .cse15) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-01-09 21:50:49,627 INFO L854 garLoopResultBuilder]: At program point L149(lines 145 624) the Hoare annotation is: (let ((.cse15 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse16 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse17 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse11 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse18 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse12 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse13 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse14 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse16 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse16 .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse18 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse12 .cse13 .cse14))) [2022-01-09 21:50:49,628 INFO L858 garLoopResultBuilder]: For program point L83(lines 83 91) no Hoare annotation was computed. [2022-01-09 21:50:49,628 INFO L858 garLoopResultBuilder]: For program point L282(lines 282 286) no Hoare annotation was computed. [2022-01-09 21:50:49,628 INFO L858 garLoopResultBuilder]: For program point L316(lines 316 320) no Hoare annotation was computed. [2022-01-09 21:50:49,628 INFO L858 garLoopResultBuilder]: For program point L316-2(lines 219 597) no Hoare annotation was computed. [2022-01-09 21:50:49,628 INFO L858 garLoopResultBuilder]: For program point L184(lines 184 611) no Hoare annotation was computed. [2022-01-09 21:50:49,628 INFO L858 garLoopResultBuilder]: For program point L151(lines 151 622) no Hoare annotation was computed. [2022-01-09 21:50:49,628 INFO L858 garLoopResultBuilder]: For program point L118(lines 118 633) no Hoare annotation was computed. [2022-01-09 21:50:49,628 INFO L858 garLoopResultBuilder]: For program point L581(lines 581 591) no Hoare annotation was computed. [2022-01-09 21:50:49,628 INFO L858 garLoopResultBuilder]: For program point L581-1(lines 581 591) no Hoare annotation was computed. [2022-01-09 21:50:49,628 INFO L858 garLoopResultBuilder]: For program point L449-1(lines 449 461) no Hoare annotation was computed. [2022-01-09 21:50:49,628 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-09 21:50:49,628 INFO L854 garLoopResultBuilder]: At program point L218(lines 217 600) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2022-01-09 21:50:49,628 INFO L858 garLoopResultBuilder]: For program point L86(lines 86 90) no Hoare annotation was computed. [2022-01-09 21:50:49,629 INFO L858 garLoopResultBuilder]: For program point L86-2(lines 83 91) no Hoare annotation was computed. [2022-01-09 21:50:49,629 INFO L854 garLoopResultBuilder]: At program point L417(lines 408 428) the Hoare annotation is: (let ((.cse6 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse15 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse16 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse17 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse18 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse8 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse13 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse14 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse14 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16 .cse14 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14) (and .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2022-01-09 21:50:49,629 INFO L858 garLoopResultBuilder]: For program point L351(lines 351 355) no Hoare annotation was computed. [2022-01-09 21:50:49,629 INFO L858 garLoopResultBuilder]: For program point L351-2(lines 219 597) no Hoare annotation was computed. [2022-01-09 21:50:49,629 INFO L861 garLoopResultBuilder]: At program point L682(lines 74 684) the Hoare annotation is: true [2022-01-09 21:50:49,629 INFO L858 garLoopResultBuilder]: For program point L649(lines 649 655) no Hoare annotation was computed. [2022-01-09 21:50:49,629 INFO L858 garLoopResultBuilder]: For program point L550(lines 550 555) no Hoare annotation was computed. [2022-01-09 21:50:49,630 INFO L858 garLoopResultBuilder]: For program point L187(lines 187 610) no Hoare annotation was computed. [2022-01-09 21:50:49,630 INFO L858 garLoopResultBuilder]: For program point L154(lines 154 621) no Hoare annotation was computed. [2022-01-09 21:50:49,630 INFO L858 garLoopResultBuilder]: For program point L121(lines 121 632) no Hoare annotation was computed. [2022-01-09 21:50:49,630 INFO L861 garLoopResultBuilder]: At program point L683(lines 19 685) the Hoare annotation is: true [2022-01-09 21:50:49,630 INFO L858 garLoopResultBuilder]: For program point L584(lines 584 588) no Hoare annotation was computed. [2022-01-09 21:50:49,630 INFO L858 garLoopResultBuilder]: For program point L452(lines 452 457) no Hoare annotation was computed. [2022-01-09 21:50:49,630 INFO L854 garLoopResultBuilder]: At program point L188(lines 184 611) the Hoare annotation is: (let ((.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse16 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse17 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (.cse18 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse12 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse13 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse14 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse8 .cse17 .cse9 .cse10 .cse12 .cse18 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse17 .cse9 .cse10 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse7 .cse8 .cse17 .cse9 .cse10 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18 .cse13 .cse14 .cse15) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-01-09 21:50:49,630 INFO L854 garLoopResultBuilder]: At program point L155(lines 151 622) the Hoare annotation is: (let ((.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse17 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse16 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse18 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse12 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse13 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse14 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse7 .cse8 .cse9 .cse10 .cse12 .cse18 .cse14) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse16 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18 .cse13 .cse14 .cse15) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-01-09 21:50:49,630 INFO L858 garLoopResultBuilder]: For program point L420(lines 420 424) no Hoare annotation was computed. [2022-01-09 21:50:49,631 INFO L854 garLoopResultBuilder]: At program point L222(lines 115 634) the Hoare annotation is: (let ((.cse17 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse18 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse19 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse20 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse10 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse16 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse13 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse14 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse15 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse0 .cse17 .cse6 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse19 .cse15) (and .cse16 .cse0 .cse20 .cse6 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse19 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse19 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15) (and .cse16 .cse0 .cse6 .cse13 .cse14) (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15))) [2022-01-09 21:50:49,631 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-09 21:50:49,631 INFO L858 garLoopResultBuilder]: For program point L190(lines 190 609) no Hoare annotation was computed. [2022-01-09 21:50:49,631 INFO L858 garLoopResultBuilder]: For program point L157(lines 157 620) no Hoare annotation was computed. [2022-01-09 21:50:49,631 INFO L858 garLoopResultBuilder]: For program point L124(lines 124 631) no Hoare annotation was computed. [2022-01-09 21:50:49,631 INFO L858 garLoopResultBuilder]: For program point L521(lines 521 525) no Hoare annotation was computed. [2022-01-09 21:50:49,631 INFO L858 garLoopResultBuilder]: For program point L488(lines 488 492) no Hoare annotation was computed. [2022-01-09 21:50:49,631 INFO L858 garLoopResultBuilder]: For program point L521-2(lines 521 525) no Hoare annotation was computed. [2022-01-09 21:50:49,631 INFO L858 garLoopResultBuilder]: For program point L93(lines 93 101) no Hoare annotation was computed. [2022-01-09 21:50:49,631 INFO L858 garLoopResultBuilder]: For program point L93-1(lines 74 684) no Hoare annotation was computed. [2022-01-09 21:50:49,631 INFO L858 garLoopResultBuilder]: For program point L193(lines 193 608) no Hoare annotation was computed. [2022-01-09 21:50:49,631 INFO L858 garLoopResultBuilder]: For program point L160(lines 160 619) no Hoare annotation was computed. [2022-01-09 21:50:49,631 INFO L858 garLoopResultBuilder]: For program point L127(lines 127 630) no Hoare annotation was computed. [2022-01-09 21:50:49,631 INFO L858 garLoopResultBuilder]: For program point L94(lines 94 98) no Hoare annotation was computed. [2022-01-09 21:50:49,632 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-09 21:50:49,632 INFO L858 garLoopResultBuilder]: For program point L359(lines 359 390) no Hoare annotation was computed. [2022-01-09 21:50:49,632 INFO L858 garLoopResultBuilder]: For program point L326(lines 326 330) no Hoare annotation was computed. [2022-01-09 21:50:49,632 INFO L858 garLoopResultBuilder]: For program point L326-2(lines 326 330) no Hoare annotation was computed. [2022-01-09 21:50:49,632 INFO L858 garLoopResultBuilder]: For program point L227(lines 227 231) no Hoare annotation was computed. [2022-01-09 21:50:49,632 INFO L854 garLoopResultBuilder]: At program point L194(lines 190 609) the Hoare annotation is: (let ((.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse16 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse17 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (.cse18 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse12 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse13 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse14 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse8 .cse17 .cse9 .cse10 .cse12 .cse18 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse17 .cse9 .cse10 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse7 .cse8 .cse17 .cse9 .cse10 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18 .cse13 .cse14 .cse15) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-01-09 21:50:49,632 INFO L854 garLoopResultBuilder]: At program point L161(lines 157 620) the Hoare annotation is: (let ((.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse17 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse16 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse18 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse12 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse13 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse14 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse7 .cse8 .cse9 .cse10 .cse12 .cse18 .cse14) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse16 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18 .cse13 .cse14 .cse15) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-01-09 21:50:49,632 INFO L858 garLoopResultBuilder]: For program point L227-2(lines 219 597) no Hoare annotation was computed. [2022-01-09 21:50:49,632 INFO L858 garLoopResultBuilder]: For program point L196(lines 196 607) no Hoare annotation was computed. [2022-01-09 21:50:49,632 INFO L858 garLoopResultBuilder]: For program point L163(lines 163 618) no Hoare annotation was computed. [2022-01-09 21:50:49,632 INFO L858 garLoopResultBuilder]: For program point L130(lines 130 629) no Hoare annotation was computed. [2022-01-09 21:50:49,632 INFO L858 garLoopResultBuilder]: For program point L560(lines 560 564) no Hoare annotation was computed. [2022-01-09 21:50:49,633 INFO L858 garLoopResultBuilder]: For program point L362(lines 362 389) no Hoare annotation was computed. [2022-01-09 21:50:49,633 INFO L858 garLoopResultBuilder]: For program point L362-1(lines 362 389) no Hoare annotation was computed. [2022-01-09 21:50:49,633 INFO L854 garLoopResultBuilder]: At program point L131(lines 127 630) the Hoare annotation is: (let ((.cse11 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse16 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse17 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse18 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse15 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse6 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse10 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse12 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse13 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse14 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse17 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse17 .cse11 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse17 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14))) [2022-01-09 21:50:49,633 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-09 21:50:49,633 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 678) no Hoare annotation was computed. [2022-01-09 21:50:49,633 INFO L854 garLoopResultBuilder]: At program point L561(lines 74 684) the Hoare annotation is: false [2022-01-09 21:50:49,634 INFO L858 garLoopResultBuilder]: For program point L363(lines 363 386) no Hoare annotation was computed. [2022-01-09 21:50:49,634 INFO L858 garLoopResultBuilder]: For program point L264(lines 264 276) no Hoare annotation was computed. [2022-01-09 21:50:49,634 INFO L858 garLoopResultBuilder]: For program point L265(lines 265 270) no Hoare annotation was computed. [2022-01-09 21:50:49,634 INFO L858 garLoopResultBuilder]: For program point L199(lines 199 606) no Hoare annotation was computed. [2022-01-09 21:50:49,634 INFO L858 garLoopResultBuilder]: For program point L166(lines 166 617) no Hoare annotation was computed. [2022-01-09 21:50:49,634 INFO L858 garLoopResultBuilder]: For program point L133(lines 133 628) no Hoare annotation was computed. [2022-01-09 21:50:49,634 INFO L861 garLoopResultBuilder]: At program point L695(lines 686 697) the Hoare annotation is: true [2022-01-09 21:50:49,634 INFO L858 garLoopResultBuilder]: For program point L398(lines 398 429) no Hoare annotation was computed. [2022-01-09 21:50:49,634 INFO L858 garLoopResultBuilder]: For program point L299(lines 299 303) no Hoare annotation was computed. [2022-01-09 21:50:49,634 INFO L858 garLoopResultBuilder]: For program point L299-2(lines 219 597) no Hoare annotation was computed. [2022-01-09 21:50:49,634 INFO L854 garLoopResultBuilder]: At program point L200(lines 196 607) the Hoare annotation is: (let ((.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (.cse7 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse9 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse10 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse10) (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) .cse4 .cse5 .cse7 .cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) .cse9 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) .cse10 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (and .cse0 .cse1 .cse2 .cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2022-01-09 21:50:49,635 INFO L854 garLoopResultBuilder]: At program point L167(lines 163 618) the Hoare annotation is: (let ((.cse6 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse15 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse16 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse17 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse18 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse8 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse12 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse13 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse14 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse14 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16 .cse14 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14) (and .cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2022-01-09 21:50:49,635 INFO L854 garLoopResultBuilder]: At program point L134(lines 133 628) the Hoare annotation is: (and (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480)) (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656)) (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2022-01-09 21:50:49,638 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 21:50:49,639 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-09 21:50:49,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:50:49 BoogieIcfgContainer [2022-01-09 21:50:49,692 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-09 21:50:49,693 INFO L158 Benchmark]: Toolchain (without parser) took 26940.59ms. Allocated memory was 188.7MB in the beginning and 360.7MB in the end (delta: 172.0MB). Free memory was 132.6MB in the beginning and 161.4MB in the end (delta: -28.8MB). Peak memory consumption was 199.6MB. Max. memory is 8.0GB. [2022-01-09 21:50:49,693 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 188.7MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-09 21:50:49,693 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.16ms. Allocated memory was 188.7MB in the beginning and 249.6MB in the end (delta: 60.8MB). Free memory was 132.4MB in the beginning and 218.1MB in the end (delta: -85.7MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. [2022-01-09 21:50:49,693 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.21ms. Allocated memory is still 249.6MB. Free memory was 218.1MB in the beginning and 215.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-09 21:50:49,693 INFO L158 Benchmark]: Boogie Preprocessor took 38.91ms. Allocated memory is still 249.6MB. Free memory was 215.5MB in the beginning and 213.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-09 21:50:49,694 INFO L158 Benchmark]: RCFGBuilder took 681.34ms. Allocated memory is still 249.6MB. Free memory was 213.4MB in the beginning and 181.9MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-01-09 21:50:49,694 INFO L158 Benchmark]: TraceAbstraction took 25785.50ms. Allocated memory was 249.6MB in the beginning and 360.7MB in the end (delta: 111.1MB). Free memory was 181.4MB in the beginning and 161.4MB in the end (delta: 20.0MB). Peak memory consumption was 187.8MB. Max. memory is 8.0GB. [2022-01-09 21:50:49,695 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 188.7MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 360.16ms. Allocated memory was 188.7MB in the beginning and 249.6MB in the end (delta: 60.8MB). Free memory was 132.4MB in the beginning and 218.1MB in the end (delta: -85.7MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.21ms. Allocated memory is still 249.6MB. Free memory was 218.1MB in the beginning and 215.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.91ms. Allocated memory is still 249.6MB. Free memory was 215.5MB in the beginning and 213.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 681.34ms. Allocated memory is still 249.6MB. Free memory was 213.4MB in the beginning and 181.9MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 25785.50ms. Allocated memory was 249.6MB in the beginning and 360.7MB in the end (delta: 111.1MB). Free memory was 181.4MB in the beginning and 161.4MB in the end (delta: 20.0MB). Peak memory consumption was 187.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 678]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 138 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.7s, OverallIterations: 32, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3842 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3842 mSDsluCounter, 9161 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3325 mSDsCounter, 981 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3855 IncrementalHoareTripleChecker+Invalid, 4836 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 981 mSolverCounterUnsat, 5836 mSDtfsCounter, 3855 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3308 GetRequests, 3261 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3678occurred in iteration=24, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 32 MinimizatonAttempts, 2600 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 439 NumberOfFragments, 6881 HoareAnnotationTreeSize, 29 FomulaSimplifications, 21931 FormulaSimplificationTreeSizeReduction, 2.6s HoareSimplificationTime, 29 FomulaSimplificationsInter, 44965 FormulaSimplificationTreeSizeReductionInter, 8.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 7545 NumberOfCodeBlocks, 7545 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 8477 ConstructedInterpolants, 0 QuantifiedInterpolants, 11758 SizeOfPredicates, 2 NumberOfNonLiveVariables, 3745 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 36 InterpolantComputations, 30 PerfectInterpolantSequences, 31029/31185 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: (((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && blastFlag == 0) && !(8560 == s__state)) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && !(8560 == s__state))) || ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && !(8560 == s__state)) - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: ((((8672 <= s__state && blastFlag == 1) && !(12292 == s__state)) || ((8672 <= s__state && !(12292 == s__state)) && blastFlag == 0)) || ((8672 <= s__state && 3 == blastFlag) && !(12292 == s__state))) || (((8672 <= s__state && 2 == blastFlag) && !(12292 == s__state)) && !(0 == s__hit)) - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(8560 == s__state)) || (((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && blastFlag == 0) && !(8560 == s__state))) || (((((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(8560 == s__state)) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && 8448 <= s__state) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) || ((((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && 2 == blastFlag) && s__state < 8576) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || (((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && s__state < 8576) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0) && !(8560 == s__state))) || (((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && s__state < 8576) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: ((((((8672 <= s__state && !(8673 == s__state)) && 3 == blastFlag) && !(s__state == 8672)) && !(0 == s__hit)) || ((((8672 <= s__state && !(8673 == s__state)) && 2 == blastFlag) && !(s__state == 8672)) && !(0 == s__hit))) || ((((8672 <= s__state && !(8673 == s__state)) && blastFlag == 1) && !(s__state == 8672)) && !(0 == s__hit))) || ((((8672 <= s__state && !(8673 == s__state)) && !(s__state == 8672)) && blastFlag == 0) && !(0 == s__hit)) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: (((((((((blastFlag == 1 && s__state <= 8448) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) || (((2 == blastFlag && s__state <= 8448) && 8448 <= s__state) && !(0 == s__hit))) || (((3 == blastFlag && s__state <= 8448) && 8448 <= s__state) && !(0 == s__hit))) || (((3 == blastFlag && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 8448 <= s__state)) || (((s__state <= 8448 && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0)) || (((blastFlag == 1 && s__state <= 8448) && 8448 <= s__state) && !(0 == s__hit))) || (((s__state <= 8448 && 8448 <= s__state) && blastFlag == 0) && !(0 == s__hit))) || (((2 == blastFlag && s__state <= 8448) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) || (((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && blastFlag == 0) && !(8560 == s__state))) || (((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && !(8560 == s__state))) || (((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && !(8560 == s__state))) || (((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(8560 == s__state)) || (((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && blastFlag == 0) && !(8560 == s__state))) || (((((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(8560 == s__state)) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && s__state <= 8672) || (((3 == blastFlag && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 8448 <= s__state)) || (2 == blastFlag && !(0 == s__hit))) || ((8672 <= s__state && 3 == blastFlag) && s__state <= 8672)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(8497 == s__state)) && !(8496 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && blastFlag == 0) && s__state <= 8672)) || s__state <= 3) || (3 == blastFlag && !(0 == s__hit))) || (((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(8497 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && s__state <= 8672)) || ((blastFlag == 1 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (blastFlag == 0 && !(0 == s__hit))) || (blastFlag == 1 && !(0 == s__hit))) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8576) - InvariantResult [Line: 151]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) || (((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && blastFlag == 0) && !(8560 == s__state))) || (((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && !(8560 == s__state))) || (((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && !(8560 == s__state))) || (((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) || (((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && blastFlag == 0) && !(8560 == s__state))) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && !(8560 == s__state))) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && !(8560 == s__state))) || (((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) || ((((8672 <= s__state && !(8673 == s__state)) && 2 == blastFlag) && !(s__state == 8672)) && !(0 == s__hit))) || ((((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || ((((8672 <= s__state && !(8673 == s__state)) && blastFlag == 1) && !(s__state == 8672)) && !(0 == s__hit))) || (((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state))) || ((((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || ((((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0) && !(8560 == s__state))) || (((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state))) || ((((8672 <= s__state && !(8673 == s__state)) && !(s__state == 8672)) && blastFlag == 0) && !(0 == s__hit))) || ((((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && !(0 == s__hit)) && !(8560 == s__state)) - InvariantResult [Line: 356]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) || (((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && blastFlag == 0) && !(8560 == s__state))) || (((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && !(8560 == s__state))) || (((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && !(8560 == s__state))) || (((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: ((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(8560 == s__state)) && s__state <= 8672 - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(8560 == s__state)) || (((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && blastFlag == 0) && !(8560 == s__state))) || (((((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(8560 == s__state)) - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && blastFlag == 0) && !(0 == s__hit)) && s__state <= 8672) || (((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && s__state <= 8672)) || ((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && blastFlag == 0)) || ((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state)) || (((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && s__state <= 8672)) || ((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state)) || (((((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && s__state <= 8672) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(8673 == s__state) && 3 == blastFlag) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) || (((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(8560 == s__state))) || (((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(8560 == s__state))) || (((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0) && !(8560 == s__state))) || (((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && s__state <= 8672) || (((3 == blastFlag && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 8448 <= s__state)) || (2 == blastFlag && !(0 == s__hit))) || ((8672 <= s__state && 3 == blastFlag) && s__state <= 8672)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(8497 == s__state)) && !(8496 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && blastFlag == 0) && s__state <= 8672)) || s__state <= 3) || (3 == blastFlag && !(0 == s__hit))) || (((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(8497 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && s__state <= 8672)) || ((blastFlag == 1 && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((2 == blastFlag && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (blastFlag == 0 && !(0 == s__hit))) || (blastFlag == 1 && !(0 == s__hit))) || ((s__s3__tmp__next_state___0 <= 8576 && blastFlag == 0) && s__state <= 8576) - InvariantResult [Line: 686]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 190]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) || (((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && blastFlag == 0) && !(8560 == s__state))) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && !(8560 == s__state))) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && !(8560 == s__state))) || (((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) || (((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && blastFlag == 0) && !(8560 == s__state))) || (((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && !(8560 == s__state))) || (((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && !(8560 == s__state))) || (((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 214]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) || (((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && blastFlag == 0) && !(8560 == s__state))) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && !(8560 == s__state))) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && !(8496 == s__state)) && s__state < 8656) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && !(8560 == s__state))) || (((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && blastFlag == 0) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672) - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: ((((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && blastFlag == 0) && !(8560 == s__state)) && s__state <= 8672) || ((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && !(8560 == s__state)) && s__state <= 8672)) || (((((((((((((3 == blastFlag && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && !(0 == s__hit)) && !(8560 == s__state)) && s__state <= 8672)) || ((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8672)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && !(8560 == s__state)) && s__state <= 8672) RESULT: Ultimate proved your program to be correct! [2022-01-09 21:50:49,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...