/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/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf -i ../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_3.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 15:52:42,546 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 15:52:42,548 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 15:52:42,600 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 15:52:42,601 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 15:52:42,601 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 15:52:42,602 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 15:52:42,603 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 15:52:42,604 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 15:52:42,605 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 15:52:42,605 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 15:52:42,607 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 15:52:42,607 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 15:52:42,608 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 15:52:42,608 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 15:52:42,609 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 15:52:42,609 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 15:52:42,610 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 15:52:42,611 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 15:52:42,612 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 15:52:42,613 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 15:52:42,613 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 15:52:42,614 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 15:52:42,614 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 15:52:42,616 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 15:52:42,616 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 15:52:42,616 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 15:52:42,617 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 15:52:42,617 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 15:52:42,617 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 15:52:42,618 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 15:52:42,618 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 15:52:42,618 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 15:52:42,619 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 15:52:42,619 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 15:52:42,620 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 15:52:42,620 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 15:52:42,620 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 15:52:42,620 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 15:52:42,621 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 15:52:42,621 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 15:52:42,622 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf [2022-01-10 15:52:42,634 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 15:52:42,634 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 15:52:42,634 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 15:52:42,635 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 15:52:42,635 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 15:52:42,636 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 15:52:42,636 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 15:52:42,636 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 15:52:42,636 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 15:52:42,636 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 15:52:42,636 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 15:52:42,636 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 15:52:42,636 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 15:52:42,637 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 15:52:42,637 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 15:52:42,637 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 15:52:42,637 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 15:52:42,637 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 15:52:42,637 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 15:52:42,637 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 15:52:42,638 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 15:52:42,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 15:52:42,638 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 15:52:42,638 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 15:52:42,638 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 15:52:42,638 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 15:52:42,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 15:52:42,638 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 15:52:42,639 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 15:52:42,639 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 15:52:42,639 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 15:52:42,639 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 15:52:42,640 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 15:52:42,640 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_LAZY 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-10 15:52:42,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 15:52:42,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 15:52:42,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 15:52:42,804 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 15:52:42,805 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 15:52:42,806 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_3.cil.c [2022-01-10 15:52:42,853 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4854e1a33/677b2efa22884a96a2f2dfd06727ad6e/FLAG0e5eddcea [2022-01-10 15:52:43,294 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 15:52:43,295 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_3.cil.c [2022-01-10 15:52:43,316 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4854e1a33/677b2efa22884a96a2f2dfd06727ad6e/FLAG0e5eddcea [2022-01-10 15:52:43,619 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4854e1a33/677b2efa22884a96a2f2dfd06727ad6e [2022-01-10 15:52:43,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 15:52:43,623 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 15:52:43,626 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 15:52:43,626 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 15:52:43,628 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 15:52:43,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:52:43" (1/1) ... [2022-01-10 15:52:43,630 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@612eb6c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:43, skipping insertion in model container [2022-01-10 15:52:43,631 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:52:43" (1/1) ... [2022-01-10 15:52:43,644 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 15:52:43,672 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 15:52:43,875 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_3.cil.c[42783,42796] [2022-01-10 15:52:43,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 15:52:43,889 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 15:52:43,924 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_3.cil.c[42783,42796] [2022-01-10 15:52:43,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 15:52:43,937 INFO L208 MainTranslator]: Completed translation [2022-01-10 15:52:43,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:43 WrapperNode [2022-01-10 15:52:43,938 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 15:52:43,939 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 15:52:43,939 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 15:52:43,939 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 15:52:43,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:43" (1/1) ... [2022-01-10 15:52:43,962 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:43" (1/1) ... [2022-01-10 15:52:44,033 INFO L137 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 500 [2022-01-10 15:52:44,033 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 15:52:44,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 15:52:44,037 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 15:52:44,037 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 15:52:44,041 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:43" (1/1) ... [2022-01-10 15:52:44,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:43" (1/1) ... [2022-01-10 15:52:44,054 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:43" (1/1) ... [2022-01-10 15:52:44,054 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:43" (1/1) ... [2022-01-10 15:52:44,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:43" (1/1) ... [2022-01-10 15:52:44,088 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:43" (1/1) ... [2022-01-10 15:52:44,096 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:43" (1/1) ... [2022-01-10 15:52:44,099 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 15:52:44,100 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 15:52:44,100 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 15:52:44,100 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 15:52:44,110 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:43" (1/1) ... [2022-01-10 15:52:44,122 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 15:52:44,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 15:52:44,150 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-10 15:52:44,152 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-10 15:52:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 15:52:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 15:52:44,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 15:52:44,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 15:52:44,275 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 15:52:44,276 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 15:52:44,285 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 15:52:44,601 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-01-10 15:52:44,601 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-01-10 15:52:44,601 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 15:52:44,607 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 15:52:44,607 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 15:52:44,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:52:44 BoogieIcfgContainer [2022-01-10 15:52:44,608 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 15:52:44,609 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 15:52:44,609 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 15:52:44,610 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 15:52:44,612 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:52:44" (1/1) ... [2022-01-10 15:52:44,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 03:52:44 BasicIcfg [2022-01-10 15:52:44,720 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 15:52:44,722 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 15:52:44,722 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 15:52:44,724 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 15:52:44,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 03:52:43" (1/4) ... [2022-01-10 15:52:44,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d231140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:52:44, skipping insertion in model container [2022-01-10 15:52:44,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:43" (2/4) ... [2022-01-10 15:52:44,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d231140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:52:44, skipping insertion in model container [2022-01-10 15:52:44,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:52:44" (3/4) ... [2022-01-10 15:52:44,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d231140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 03:52:44, skipping insertion in model container [2022-01-10 15:52:44,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 03:52:44" (4/4) ... [2022-01-10 15:52:44,727 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_3.cil.cTransformedIcfg [2022-01-10 15:52:44,732 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 15:52:44,732 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 15:52:44,777 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 15:52:44,782 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-10 15:52:44,782 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 15:52:44,795 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 139 states have (on average 1.7266187050359711) internal successors, (240), 140 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-10 15:52:44,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 15:52:44,802 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:44,803 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-10 15:52:44,803 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:44,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:44,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1208258324, now seen corresponding path program 1 times [2022-01-10 15:52:44,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:44,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974959803] [2022-01-10 15:52:44,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:44,815 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:45,101 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-10 15:52:45,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:45,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974959803] [2022-01-10 15:52:45,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974959803] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:45,102 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:45,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:45,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626485910] [2022-01-10 15:52:45,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:45,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:45,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:45,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:45,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:45,139 INFO L87 Difference]: Start difference. First operand has 141 states, 139 states have (on average 1.7266187050359711) internal successors, (240), 140 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) 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-10 15:52:45,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:45,246 INFO L93 Difference]: Finished difference Result 404 states and 690 transitions. [2022-01-10 15:52:45,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:45,253 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-10 15:52:45,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:45,267 INFO L225 Difference]: With dead ends: 404 [2022-01-10 15:52:45,267 INFO L226 Difference]: Without dead ends: 245 [2022-01-10 15:52:45,271 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-10 15:52:45,274 INFO L933 BasicCegarLoop]: 232 mSDtfsCounter, 186 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 447 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-10 15:52:45,275 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 447 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:52:45,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-01-10 15:52:45,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2022-01-10 15:52:45,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 1.528688524590164) internal successors, (373), 244 states have internal predecessors, (373), 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-10 15:52:45,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 373 transitions. [2022-01-10 15:52:45,341 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 373 transitions. Word has length 44 [2022-01-10 15:52:45,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:45,342 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 373 transitions. [2022-01-10 15:52:45,342 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-10 15:52:45,342 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 373 transitions. [2022-01-10 15:52:45,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-10 15:52:45,344 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:45,345 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-10 15:52:45,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 15:52:45,345 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:45,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:45,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1611832931, now seen corresponding path program 1 times [2022-01-10 15:52:45,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:45,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38578764] [2022-01-10 15:52:45,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:45,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:45,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:45,459 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:52:45,460 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:45,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38578764] [2022-01-10 15:52:45,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38578764] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:45,461 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:45,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:45,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239734894] [2022-01-10 15:52:45,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:45,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:45,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:45,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:45,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:45,464 INFO L87 Difference]: Start difference. First operand 245 states and 373 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-10 15:52:45,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:45,606 INFO L93 Difference]: Finished difference Result 394 states and 606 transitions. [2022-01-10 15:52:45,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:45,607 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 60 [2022-01-10 15:52:45,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:45,608 INFO L225 Difference]: With dead ends: 394 [2022-01-10 15:52:45,609 INFO L226 Difference]: Without dead ends: 274 [2022-01-10 15:52:45,611 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-10 15:52:45,614 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 13 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:45,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 308 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:45,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-01-10 15:52:45,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 266. [2022-01-10 15:52:45,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.5056603773584907) internal successors, (399), 265 states have internal predecessors, (399), 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-10 15:52:45,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 399 transitions. [2022-01-10 15:52:45,632 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 399 transitions. Word has length 60 [2022-01-10 15:52:45,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:45,633 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 399 transitions. [2022-01-10 15:52:45,633 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-10 15:52:45,633 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 399 transitions. [2022-01-10 15:52:45,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-10 15:52:45,635 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:45,635 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:45,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 15:52:45,636 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:45,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:45,636 INFO L85 PathProgramCache]: Analyzing trace with hash 56069177, now seen corresponding path program 1 times [2022-01-10 15:52:45,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:45,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639137057] [2022-01-10 15:52:45,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:45,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:45,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:45,725 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 15:52:45,725 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:45,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639137057] [2022-01-10 15:52:45,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639137057] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:45,727 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:45,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:45,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844624132] [2022-01-10 15:52:45,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:45,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:45,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:45,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:45,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:45,728 INFO L87 Difference]: Start difference. First operand 266 states and 399 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-10 15:52:45,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:45,889 INFO L93 Difference]: Finished difference Result 616 states and 951 transitions. [2022-01-10 15:52:45,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:45,890 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 81 [2022-01-10 15:52:45,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:45,892 INFO L225 Difference]: With dead ends: 616 [2022-01-10 15:52:45,892 INFO L226 Difference]: Without dead ends: 358 [2022-01-10 15:52:45,895 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-10 15:52:45,898 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 14 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:45,900 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 309 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:45,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-01-10 15:52:45,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 350. [2022-01-10 15:52:45,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 349 states have (on average 1.4126074498567336) internal successors, (493), 349 states have internal predecessors, (493), 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-10 15:52:45,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 493 transitions. [2022-01-10 15:52:45,912 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 493 transitions. Word has length 81 [2022-01-10 15:52:45,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:45,913 INFO L470 AbstractCegarLoop]: Abstraction has 350 states and 493 transitions. [2022-01-10 15:52:45,913 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-10 15:52:45,913 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 493 transitions. [2022-01-10 15:52:45,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-10 15:52:45,920 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:45,920 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:45,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 15:52:45,921 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:45,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:45,921 INFO L85 PathProgramCache]: Analyzing trace with hash 180142424, now seen corresponding path program 1 times [2022-01-10 15:52:45,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:45,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438976775] [2022-01-10 15:52:45,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:45,922 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:45,988 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 15:52:45,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:45,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438976775] [2022-01-10 15:52:45,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438976775] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:45,989 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:45,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:45,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287399884] [2022-01-10 15:52:45,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:45,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:45,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:45,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:45,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:45,990 INFO L87 Difference]: Start difference. First operand 350 states and 493 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-10 15:52:46,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:46,118 INFO L93 Difference]: Finished difference Result 746 states and 1068 transitions. [2022-01-10 15:52:46,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:46,119 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 81 [2022-01-10 15:52:46,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:46,121 INFO L225 Difference]: With dead ends: 746 [2022-01-10 15:52:46,121 INFO L226 Difference]: Without dead ends: 404 [2022-01-10 15:52:46,122 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-10 15:52:46,128 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 13 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:46,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 309 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:46,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2022-01-10 15:52:46,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 396. [2022-01-10 15:52:46,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 1.389873417721519) internal successors, (549), 395 states have internal predecessors, (549), 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-10 15:52:46,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 549 transitions. [2022-01-10 15:52:46,136 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 549 transitions. Word has length 81 [2022-01-10 15:52:46,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:46,137 INFO L470 AbstractCegarLoop]: Abstraction has 396 states and 549 transitions. [2022-01-10 15:52:46,137 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-10 15:52:46,137 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 549 transitions. [2022-01-10 15:52:46,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-01-10 15:52:46,140 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:46,140 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2022-01-10 15:52:46,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 15:52:46,140 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:46,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:46,141 INFO L85 PathProgramCache]: Analyzing trace with hash -51368509, now seen corresponding path program 1 times [2022-01-10 15:52:46,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:46,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188861027] [2022-01-10 15:52:46,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:46,141 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:46,209 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-10 15:52:46,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:46,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188861027] [2022-01-10 15:52:46,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188861027] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:46,210 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:46,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:46,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659813400] [2022-01-10 15:52:46,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:46,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:46,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:46,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:46,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:46,212 INFO L87 Difference]: Start difference. First operand 396 states and 549 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-10 15:52:46,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:46,319 INFO L93 Difference]: Finished difference Result 860 states and 1220 transitions. [2022-01-10 15:52:46,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:46,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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 102 [2022-01-10 15:52:46,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:46,321 INFO L225 Difference]: With dead ends: 860 [2022-01-10 15:52:46,321 INFO L226 Difference]: Without dead ends: 472 [2022-01-10 15:52:46,322 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-10 15:52:46,322 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 29 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:46,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 308 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:46,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-01-10 15:52:46,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 446. [2022-01-10 15:52:46,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 1.3685393258426966) internal successors, (609), 445 states have internal predecessors, (609), 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-10 15:52:46,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 609 transitions. [2022-01-10 15:52:46,334 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 609 transitions. Word has length 102 [2022-01-10 15:52:46,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:46,336 INFO L470 AbstractCegarLoop]: Abstraction has 446 states and 609 transitions. [2022-01-10 15:52:46,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-10 15:52:46,340 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 609 transitions. [2022-01-10 15:52:46,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 15:52:46,344 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:46,345 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-10 15:52:46,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 15:52:46,345 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:46,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:46,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1197044043, now seen corresponding path program 1 times [2022-01-10 15:52:46,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:46,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774563713] [2022-01-10 15:52:46,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:46,346 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:46,407 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-10 15:52:46,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:46,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774563713] [2022-01-10 15:52:46,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774563713] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:46,408 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:46,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:46,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472567768] [2022-01-10 15:52:46,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:46,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:46,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:46,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:46,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:46,410 INFO L87 Difference]: Start difference. First operand 446 states and 609 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-10 15:52:46,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:46,432 INFO L93 Difference]: Finished difference Result 677 states and 924 transitions. [2022-01-10 15:52:46,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:46,433 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-10 15:52:46,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:46,435 INFO L225 Difference]: With dead ends: 677 [2022-01-10 15:52:46,435 INFO L226 Difference]: Without dead ends: 675 [2022-01-10 15:52:46,436 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-10 15:52:46,437 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 148 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:46,437 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 362 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:52:46,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2022-01-10 15:52:46,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 675. [2022-01-10 15:52:46,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 674 states have (on average 1.367952522255193) internal successors, (922), 674 states have internal predecessors, (922), 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-10 15:52:46,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 922 transitions. [2022-01-10 15:52:46,449 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 922 transitions. Word has length 121 [2022-01-10 15:52:46,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:46,450 INFO L470 AbstractCegarLoop]: Abstraction has 675 states and 922 transitions. [2022-01-10 15:52:46,450 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-10 15:52:46,450 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 922 transitions. [2022-01-10 15:52:46,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-01-10 15:52:46,451 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:46,451 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-10 15:52:46,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 15:52:46,451 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:46,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:46,452 INFO L85 PathProgramCache]: Analyzing trace with hash 412121465, now seen corresponding path program 1 times [2022-01-10 15:52:46,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:46,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954352967] [2022-01-10 15:52:46,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:46,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:46,506 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-10 15:52:46,506 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:46,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954352967] [2022-01-10 15:52:46,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954352967] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:46,507 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:46,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:46,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047900000] [2022-01-10 15:52:46,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:46,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:46,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:46,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:46,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:46,509 INFO L87 Difference]: Start difference. First operand 675 states and 922 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-10 15:52:46,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:46,652 INFO L93 Difference]: Finished difference Result 1501 states and 2114 transitions. [2022-01-10 15:52:46,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:46,652 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 159 [2022-01-10 15:52:46,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:46,655 INFO L225 Difference]: With dead ends: 1501 [2022-01-10 15:52:46,655 INFO L226 Difference]: Without dead ends: 834 [2022-01-10 15:52:46,656 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-10 15:52:46,657 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 30 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:46,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 300 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:46,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2022-01-10 15:52:46,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 798. [2022-01-10 15:52:46,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 797 states have (on average 1.341279799247177) internal successors, (1069), 797 states have internal predecessors, (1069), 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-10 15:52:46,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1069 transitions. [2022-01-10 15:52:46,670 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1069 transitions. Word has length 159 [2022-01-10 15:52:46,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:46,670 INFO L470 AbstractCegarLoop]: Abstraction has 798 states and 1069 transitions. [2022-01-10 15:52:46,670 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-10 15:52:46,670 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1069 transitions. [2022-01-10 15:52:46,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-01-10 15:52:46,672 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:46,672 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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-10 15:52:46,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 15:52:46,672 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:46,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:46,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1460442779, now seen corresponding path program 1 times [2022-01-10 15:52:46,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:46,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564903334] [2022-01-10 15:52:46,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:46,673 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:46,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:46,780 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-01-10 15:52:46,780 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:46,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564903334] [2022-01-10 15:52:46,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564903334] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:46,781 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:46,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:46,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113853791] [2022-01-10 15:52:46,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:46,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:46,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:46,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:46,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:46,782 INFO L87 Difference]: Start difference. First operand 798 states and 1069 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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-10 15:52:46,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:46,907 INFO L93 Difference]: Finished difference Result 1693 states and 2315 transitions. [2022-01-10 15:52:46,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:46,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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 166 [2022-01-10 15:52:46,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:46,910 INFO L225 Difference]: With dead ends: 1693 [2022-01-10 15:52:46,910 INFO L226 Difference]: Without dead ends: 903 [2022-01-10 15:52:46,911 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-10 15:52:46,912 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 18 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:46,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 308 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:46,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2022-01-10 15:52:46,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 879. [2022-01-10 15:52:46,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 878 states have (on average 1.326879271070615) internal successors, (1165), 878 states have internal predecessors, (1165), 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-10 15:52:46,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1165 transitions. [2022-01-10 15:52:46,925 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1165 transitions. Word has length 166 [2022-01-10 15:52:46,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:46,926 INFO L470 AbstractCegarLoop]: Abstraction has 879 states and 1165 transitions. [2022-01-10 15:52:46,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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-10 15:52:46,926 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1165 transitions. [2022-01-10 15:52:46,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-01-10 15:52:46,927 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:46,928 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-10 15:52:46,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 15:52:46,928 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:46,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:46,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1267412616, now seen corresponding path program 1 times [2022-01-10 15:52:46,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:46,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56469951] [2022-01-10 15:52:46,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:46,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:46,962 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-01-10 15:52:46,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:46,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56469951] [2022-01-10 15:52:46,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56469951] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:46,962 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:46,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:46,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084655323] [2022-01-10 15:52:46,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:46,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:46,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:46,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:46,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:46,963 INFO L87 Difference]: Start difference. First operand 879 states and 1165 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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-10 15:52:47,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:47,102 INFO L93 Difference]: Finished difference Result 1920 states and 2611 transitions. [2022-01-10 15:52:47,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:47,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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 172 [2022-01-10 15:52:47,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:47,105 INFO L225 Difference]: With dead ends: 1920 [2022-01-10 15:52:47,105 INFO L226 Difference]: Without dead ends: 1046 [2022-01-10 15:52:47,106 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-10 15:52:47,106 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 160 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:47,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 156 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:47,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2022-01-10 15:52:47,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1032. [2022-01-10 15:52:47,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 1031 states have (on average 1.3743937924345295) internal successors, (1417), 1031 states have internal predecessors, (1417), 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-10 15:52:47,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1417 transitions. [2022-01-10 15:52:47,122 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1417 transitions. Word has length 172 [2022-01-10 15:52:47,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:47,122 INFO L470 AbstractCegarLoop]: Abstraction has 1032 states and 1417 transitions. [2022-01-10 15:52:47,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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-10 15:52:47,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1417 transitions. [2022-01-10 15:52:47,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-01-10 15:52:47,124 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:47,124 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 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] [2022-01-10 15:52:47,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 15:52:47,124 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:47,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:47,125 INFO L85 PathProgramCache]: Analyzing trace with hash -264676988, now seen corresponding path program 1 times [2022-01-10 15:52:47,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:47,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682259594] [2022-01-10 15:52:47,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:47,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:47,169 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2022-01-10 15:52:47,169 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:47,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682259594] [2022-01-10 15:52:47,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682259594] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:47,169 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:47,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:47,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800475513] [2022-01-10 15:52:47,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:47,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:47,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:47,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:47,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:47,170 INFO L87 Difference]: Start difference. First operand 1032 states and 1417 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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-10 15:52:47,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:47,291 INFO L93 Difference]: Finished difference Result 2149 states and 2981 transitions. [2022-01-10 15:52:47,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:47,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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 189 [2022-01-10 15:52:47,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:47,295 INFO L225 Difference]: With dead ends: 2149 [2022-01-10 15:52:47,295 INFO L226 Difference]: Without dead ends: 1125 [2022-01-10 15:52:47,296 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-10 15:52:47,296 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 10 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:47,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 308 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:47,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2022-01-10 15:52:47,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1119. [2022-01-10 15:52:47,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1119 states, 1118 states have (on average 1.358676207513417) internal successors, (1519), 1118 states have internal predecessors, (1519), 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-10 15:52:47,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1519 transitions. [2022-01-10 15:52:47,312 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1519 transitions. Word has length 189 [2022-01-10 15:52:47,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:47,313 INFO L470 AbstractCegarLoop]: Abstraction has 1119 states and 1519 transitions. [2022-01-10 15:52:47,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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-10 15:52:47,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1519 transitions. [2022-01-10 15:52:47,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-01-10 15:52:47,315 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:47,315 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 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, 1, 1] [2022-01-10 15:52:47,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 15:52:47,315 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:47,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:47,315 INFO L85 PathProgramCache]: Analyzing trace with hash 2106033391, now seen corresponding path program 1 times [2022-01-10 15:52:47,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:47,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371960977] [2022-01-10 15:52:47,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:47,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:47,367 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2022-01-10 15:52:47,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:47,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371960977] [2022-01-10 15:52:47,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371960977] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:47,368 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:47,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:47,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754622602] [2022-01-10 15:52:47,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:47,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:47,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:47,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:47,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:47,369 INFO L87 Difference]: Start difference. First operand 1119 states and 1519 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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-10 15:52:47,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:47,505 INFO L93 Difference]: Finished difference Result 2323 states and 3191 transitions. [2022-01-10 15:52:47,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:47,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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 194 [2022-01-10 15:52:47,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:47,508 INFO L225 Difference]: With dead ends: 2323 [2022-01-10 15:52:47,508 INFO L226 Difference]: Without dead ends: 1212 [2022-01-10 15:52:47,509 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-10 15:52:47,510 INFO L933 BasicCegarLoop]: 195 mSDtfsCounter, 15 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:47,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 290 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:47,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2022-01-10 15:52:47,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1212. [2022-01-10 15:52:47,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 1211 states have (on average 1.3435177539223782) internal successors, (1627), 1211 states have internal predecessors, (1627), 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-10 15:52:47,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1627 transitions. [2022-01-10 15:52:47,526 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1627 transitions. Word has length 194 [2022-01-10 15:52:47,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:47,527 INFO L470 AbstractCegarLoop]: Abstraction has 1212 states and 1627 transitions. [2022-01-10 15:52:47,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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-10 15:52:47,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1627 transitions. [2022-01-10 15:52:47,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2022-01-10 15:52:47,529 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:47,529 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2022-01-10 15:52:47,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 15:52:47,529 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:47,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:47,530 INFO L85 PathProgramCache]: Analyzing trace with hash 996957252, now seen corresponding path program 1 times [2022-01-10 15:52:47,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:47,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142528807] [2022-01-10 15:52:47,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:47,530 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:47,583 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 320 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-01-10 15:52:47,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:47,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142528807] [2022-01-10 15:52:47,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142528807] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 15:52:47,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373574661] [2022-01-10 15:52:47,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:47,584 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 15:52:47,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 15:52:47,600 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-10 15:52:47,625 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-10 15:52:47,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:47,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 15:52:47,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 15:52:48,138 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2022-01-10 15:52:48,139 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 15:52:48,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373574661] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:48,139 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 15:52:48,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-10 15:52:48,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670935895] [2022-01-10 15:52:48,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:48,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:48,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:48,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:48,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 15:52:48,141 INFO L87 Difference]: Start difference. First operand 1212 states and 1627 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-10 15:52:48,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:48,170 INFO L93 Difference]: Finished difference Result 2438 states and 3273 transitions. [2022-01-10 15:52:48,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:48,171 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 222 [2022-01-10 15:52:48,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:48,176 INFO L225 Difference]: With dead ends: 2438 [2022-01-10 15:52:48,176 INFO L226 Difference]: Without dead ends: 1620 [2022-01-10 15:52:48,177 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 15:52:48,178 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 130 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:48,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 363 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:52:48,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1620 states. [2022-01-10 15:52:48,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1620 to 1620. [2022-01-10 15:52:48,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1619 states have (on average 1.342804200123533) internal successors, (2174), 1619 states have internal predecessors, (2174), 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-10 15:52:48,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2174 transitions. [2022-01-10 15:52:48,212 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 2174 transitions. Word has length 222 [2022-01-10 15:52:48,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:48,212 INFO L470 AbstractCegarLoop]: Abstraction has 1620 states and 2174 transitions. [2022-01-10 15:52:48,213 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-10 15:52:48,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 2174 transitions. [2022-01-10 15:52:48,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2022-01-10 15:52:48,216 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:48,217 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, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:48,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 15:52:48,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-10 15:52:48,439 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:48,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:48,440 INFO L85 PathProgramCache]: Analyzing trace with hash 255739816, now seen corresponding path program 1 times [2022-01-10 15:52:48,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:48,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614993344] [2022-01-10 15:52:48,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:48,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:48,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:48,487 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2022-01-10 15:52:48,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:48,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614993344] [2022-01-10 15:52:48,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614993344] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:48,487 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:48,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:48,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635501111] [2022-01-10 15:52:48,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:48,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:48,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:48,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:48,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:48,488 INFO L87 Difference]: Start difference. First operand 1620 states and 2174 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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-10 15:52:48,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:48,652 INFO L93 Difference]: Finished difference Result 3400 states and 4640 transitions. [2022-01-10 15:52:48,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:48,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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 229 [2022-01-10 15:52:48,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:48,657 INFO L225 Difference]: With dead ends: 3400 [2022-01-10 15:52:48,657 INFO L226 Difference]: Without dead ends: 1612 [2022-01-10 15:52:48,659 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-10 15:52:48,659 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 9 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:48,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 308 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:48,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2022-01-10 15:52:48,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1612. [2022-01-10 15:52:48,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1612 states, 1611 states have (on average 1.3370577281191807) internal successors, (2154), 1611 states have internal predecessors, (2154), 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-10 15:52:48,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 2154 transitions. [2022-01-10 15:52:48,691 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 2154 transitions. Word has length 229 [2022-01-10 15:52:48,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:48,692 INFO L470 AbstractCegarLoop]: Abstraction has 1612 states and 2154 transitions. [2022-01-10 15:52:48,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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-10 15:52:48,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2154 transitions. [2022-01-10 15:52:48,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-01-10 15:52:48,695 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:48,695 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-10 15:52:48,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 15:52:48,696 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:48,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:48,696 INFO L85 PathProgramCache]: Analyzing trace with hash 34515610, now seen corresponding path program 1 times [2022-01-10 15:52:48,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:48,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332061207] [2022-01-10 15:52:48,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:48,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:48,768 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-10 15:52:48,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:48,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332061207] [2022-01-10 15:52:48,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332061207] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:48,769 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:48,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:48,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073784485] [2022-01-10 15:52:48,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:48,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:48,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:48,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:48,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:48,771 INFO L87 Difference]: Start difference. First operand 1612 states and 2154 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-10 15:52:48,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:48,821 INFO L93 Difference]: Finished difference Result 4716 states and 6314 transitions. [2022-01-10 15:52:48,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:48,821 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-10 15:52:48,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:48,826 INFO L225 Difference]: With dead ends: 4716 [2022-01-10 15:52:48,827 INFO L226 Difference]: Without dead ends: 1987 [2022-01-10 15:52:48,829 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-10 15:52:48,830 INFO L933 BasicCegarLoop]: 364 mSDtfsCounter, 120 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:48,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 551 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:52:48,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2022-01-10 15:52:48,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1985. [2022-01-10 15:52:48,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1985 states, 1984 states have (on average 1.3326612903225807) internal successors, (2644), 1984 states have internal predecessors, (2644), 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-10 15:52:48,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 2644 transitions. [2022-01-10 15:52:48,873 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 2644 transitions. Word has length 269 [2022-01-10 15:52:48,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:48,873 INFO L470 AbstractCegarLoop]: Abstraction has 1985 states and 2644 transitions. [2022-01-10 15:52:48,873 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-10 15:52:48,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 2644 transitions. [2022-01-10 15:52:48,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2022-01-10 15:52:48,877 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:48,878 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, 1, 1] [2022-01-10 15:52:48,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 15:52:48,878 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:48,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:48,879 INFO L85 PathProgramCache]: Analyzing trace with hash -612804714, now seen corresponding path program 1 times [2022-01-10 15:52:48,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:48,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372291215] [2022-01-10 15:52:48,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:48,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:48,969 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-10 15:52:48,969 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:48,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372291215] [2022-01-10 15:52:48,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372291215] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 15:52:48,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447407228] [2022-01-10 15:52:48,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:48,970 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 15:52:48,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 15:52:48,986 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-10 15:52:48,990 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-10 15:52:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:49,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 1409 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 15:52:49,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 15:52:49,639 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-10 15:52:49,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 15:52:50,046 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-10 15:52:50,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447407228] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 15:52:50,046 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 15:52:50,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-10 15:52:50,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508476487] [2022-01-10 15:52:50,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 15:52:50,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 15:52:50,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:50,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 15:52:50,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 15:52:50,048 INFO L87 Difference]: Start difference. First operand 1985 states and 2644 transitions. Second operand has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 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-10 15:52:50,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:50,384 INFO L93 Difference]: Finished difference Result 5119 states and 6932 transitions. [2022-01-10 15:52:50,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 15:52:50,384 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 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 372 [2022-01-10 15:52:50,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:50,392 INFO L225 Difference]: With dead ends: 5119 [2022-01-10 15:52:50,392 INFO L226 Difference]: Without dead ends: 2986 [2022-01-10 15:52:50,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 754 GetRequests, 746 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-10 15:52:50,394 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 621 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:50,394 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [621 Valid, 666 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 15:52:50,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2022-01-10 15:52:50,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 2132. [2022-01-10 15:52:50,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2132 states, 2131 states have (on average 1.336931018301267) internal successors, (2849), 2131 states have internal predecessors, (2849), 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-10 15:52:50,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2849 transitions. [2022-01-10 15:52:50,431 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2849 transitions. Word has length 372 [2022-01-10 15:52:50,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:50,431 INFO L470 AbstractCegarLoop]: Abstraction has 2132 states and 2849 transitions. [2022-01-10 15:52:50,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 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-10 15:52:50,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2849 transitions. [2022-01-10 15:52:50,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2022-01-10 15:52:50,436 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:50,436 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, 1, 1] [2022-01-10 15:52:50,455 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-10 15:52:50,647 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,SelfDestructingSolverStorable14 [2022-01-10 15:52:50,648 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:50,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:50,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1374102422, now seen corresponding path program 1 times [2022-01-10 15:52:50,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:50,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585481042] [2022-01-10 15:52:50,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:50,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:50,805 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-10 15:52:50,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:50,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585481042] [2022-01-10 15:52:50,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585481042] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:50,805 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:50,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:50,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856317596] [2022-01-10 15:52:50,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:50,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:50,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:50,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:50,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:50,807 INFO L87 Difference]: Start difference. First operand 2132 states and 2849 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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-10 15:52:51,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:51,002 INFO L93 Difference]: Finished difference Result 4508 states and 6120 transitions. [2022-01-10 15:52:51,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:51,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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 472 [2022-01-10 15:52:51,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:51,017 INFO L225 Difference]: With dead ends: 4508 [2022-01-10 15:52:51,017 INFO L226 Difference]: Without dead ends: 2384 [2022-01-10 15:52:51,019 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-10 15:52:51,020 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 10 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:51,020 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 305 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:51,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2384 states. [2022-01-10 15:52:51,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2384 to 2370. [2022-01-10 15:52:51,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2370 states, 2369 states have (on average 1.3178556352891515) internal successors, (3122), 2369 states have internal predecessors, (3122), 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-10 15:52:51,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2370 states and 3122 transitions. [2022-01-10 15:52:51,115 INFO L78 Accepts]: Start accepts. Automaton has 2370 states and 3122 transitions. Word has length 472 [2022-01-10 15:52:51,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:51,116 INFO L470 AbstractCegarLoop]: Abstraction has 2370 states and 3122 transitions. [2022-01-10 15:52:51,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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-10 15:52:51,116 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 3122 transitions. [2022-01-10 15:52:51,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2022-01-10 15:52:51,164 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:51,164 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, 1, 1] [2022-01-10 15:52:51,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 15:52:51,164 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:51,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:51,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1042465148, now seen corresponding path program 1 times [2022-01-10 15:52:51,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:51,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807922514] [2022-01-10 15:52:51,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:51,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:51,328 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-10 15:52:51,329 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:51,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807922514] [2022-01-10 15:52:51,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807922514] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:51,329 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:51,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:51,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796252427] [2022-01-10 15:52:51,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:51,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:51,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:51,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:51,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:51,330 INFO L87 Difference]: Start difference. First operand 2370 states and 3122 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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-10 15:52:51,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:51,490 INFO L93 Difference]: Finished difference Result 4998 states and 6694 transitions. [2022-01-10 15:52:51,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:51,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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 534 [2022-01-10 15:52:51,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:51,497 INFO L225 Difference]: With dead ends: 4998 [2022-01-10 15:52:51,497 INFO L226 Difference]: Without dead ends: 2636 [2022-01-10 15:52:51,500 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-10 15:52:51,500 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 10 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:51,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 305 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:51,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2022-01-10 15:52:51,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2622. [2022-01-10 15:52:51,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2622 states, 2621 states have (on average 1.3006486074017551) internal successors, (3409), 2621 states have internal predecessors, (3409), 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-10 15:52:51,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2622 states to 2622 states and 3409 transitions. [2022-01-10 15:52:51,550 INFO L78 Accepts]: Start accepts. Automaton has 2622 states and 3409 transitions. Word has length 534 [2022-01-10 15:52:51,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:51,551 INFO L470 AbstractCegarLoop]: Abstraction has 2622 states and 3409 transitions. [2022-01-10 15:52:51,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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-10 15:52:51,551 INFO L276 IsEmpty]: Start isEmpty. Operand 2622 states and 3409 transitions. [2022-01-10 15:52:51,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2022-01-10 15:52:51,560 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:51,560 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, 1, 1] [2022-01-10 15:52:51,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 15:52:51,560 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:51,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:51,561 INFO L85 PathProgramCache]: Analyzing trace with hash -17431062, now seen corresponding path program 1 times [2022-01-10 15:52:51,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:51,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561817725] [2022-01-10 15:52:51,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:51,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:51,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:51,671 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-10 15:52:51,671 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:51,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561817725] [2022-01-10 15:52:51,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561817725] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 15:52:51,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167519026] [2022-01-10 15:52:51,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:51,671 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 15:52:51,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 15:52:51,696 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-10 15:52:51,698 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-10 15:52:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:51,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 2201 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 15:52:51,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 15:52:52,706 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-10 15:52:52,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 15:52:53,288 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-10 15:52:53,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167519026] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 15:52:53,288 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 15:52:53,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-10 15:52:53,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163315190] [2022-01-10 15:52:53,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 15:52:53,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 15:52:53,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:53,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 15:52:53,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 15:52:53,290 INFO L87 Difference]: Start difference. First operand 2622 states and 3409 transitions. Second operand has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 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-10 15:52:53,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:53,567 INFO L93 Difference]: Finished difference Result 4483 states and 5891 transitions. [2022-01-10 15:52:53,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 15:52:53,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 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 600 [2022-01-10 15:52:53,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:53,568 INFO L225 Difference]: With dead ends: 4483 [2022-01-10 15:52:53,568 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 15:52:53,571 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1208 GetRequests, 1201 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-10 15:52:53,572 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 217 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:53,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 765 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 15:52:53,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 15:52:53,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 15:52:53,572 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-10 15:52:53,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 15:52:53,573 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 600 [2022-01-10 15:52:53,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:53,573 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 15:52:53,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 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-10 15:52:53,573 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 15:52:53,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 15:52:53,575 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 15:52:53,597 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-10 15:52:53,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-01-10 15:52:53,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 15:52:55,332 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 15:52:55,332 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 15:52:55,332 INFO L858 garLoopResultBuilder]: For program point L93(lines 93 99) no Hoare annotation was computed. [2022-01-10 15:52:55,332 INFO L858 garLoopResultBuilder]: For program point L96-2(lines 93 99) no Hoare annotation was computed. [2022-01-10 15:52:55,333 INFO L858 garLoopResultBuilder]: For program point L96(lines 96 98) no Hoare annotation was computed. [2022-01-10 15:52:55,333 INFO L858 garLoopResultBuilder]: For program point L101(lines 101 105) no Hoare annotation was computed. [2022-01-10 15:52:55,333 INFO L858 garLoopResultBuilder]: For program point L102(lines 102 104) no Hoare annotation was computed. [2022-01-10 15:52:55,334 INFO L858 garLoopResultBuilder]: For program point L101-1(lines 83 620) no Hoare annotation was computed. [2022-01-10 15:52:55,334 INFO L861 garLoopResultBuilder]: At program point L619(lines 22 621) the Hoare annotation is: true [2022-01-10 15:52:55,335 INFO L854 garLoopResultBuilder]: At program point L110-2(lines 110 608) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) (or (and (= 8560 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|) .cse0) (and (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656) .cse1 .cse0) (and .cse1 .cse0 (= 8656 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and .cse0 (= 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) .cse2) (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8512)) (and .cse0 (= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 3) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) .cse1 .cse2 (<= 8672 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and .cse0 (= 8528 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0) (and .cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 3) (= 8448 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)))) [2022-01-10 15:52:55,335 INFO L861 garLoopResultBuilder]: At program point L631(lines 622 633) the Hoare annotation is: true [2022-01-10 15:52:55,335 INFO L861 garLoopResultBuilder]: At program point L609(lines 109 610) the Hoare annotation is: true [2022-01-10 15:52:55,335 INFO L858 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2022-01-10 15:52:55,335 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 15:52:55,335 INFO L858 garLoopResultBuilder]: For program point L614(lines 614 616) no Hoare annotation was computed. [2022-01-10 15:52:55,335 INFO L858 garLoopResultBuilder]: For program point L113(lines 113 589) no Hoare annotation was computed. [2022-01-10 15:52:55,335 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 15:52:55,335 INFO L858 garLoopResultBuilder]: For program point L614-2(lines 614 616) no Hoare annotation was computed. [2022-01-10 15:52:55,335 INFO L854 garLoopResultBuilder]: At program point L114(lines 113 589) the Hoare annotation is: (let ((.cse0 (<= 8672 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (or (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3) .cse0) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)))) [2022-01-10 15:52:55,335 INFO L858 garLoopResultBuilder]: For program point L116(lines 116 588) no Hoare annotation was computed. [2022-01-10 15:52:55,336 INFO L854 garLoopResultBuilder]: At program point L222(lines 116 588) the Hoare annotation is: (or (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) [2022-01-10 15:52:55,352 INFO L858 garLoopResultBuilder]: For program point L119(lines 119 587) no Hoare annotation was computed. [2022-01-10 15:52:55,352 INFO L858 garLoopResultBuilder]: For program point L227(lines 227 229) no Hoare annotation was computed. [2022-01-10 15:52:55,352 INFO L858 garLoopResultBuilder]: For program point L122(lines 122 586) no Hoare annotation was computed. [2022-01-10 15:52:55,352 INFO L858 garLoopResultBuilder]: For program point L227-2(lines 227 229) no Hoare annotation was computed. [2022-01-10 15:52:55,352 INFO L858 garLoopResultBuilder]: For program point L125(lines 125 585) no Hoare annotation was computed. [2022-01-10 15:52:55,352 INFO L858 garLoopResultBuilder]: For program point L232(lines 232 234) no Hoare annotation was computed. [2022-01-10 15:52:55,352 INFO L858 garLoopResultBuilder]: For program point L128(lines 128 584) no Hoare annotation was computed. [2022-01-10 15:52:55,352 INFO L858 garLoopResultBuilder]: For program point L237(lines 237 248) no Hoare annotation was computed. [2022-01-10 15:52:55,352 INFO L854 garLoopResultBuilder]: At program point L132(lines 128 584) the Hoare annotation is: (or (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576)) (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 15:52:55,352 INFO L858 garLoopResultBuilder]: For program point L131(lines 131 583) no Hoare annotation was computed. [2022-01-10 15:52:55,352 INFO L858 garLoopResultBuilder]: For program point L239(lines 239 242) no Hoare annotation was computed. [2022-01-10 15:52:55,352 INFO L858 garLoopResultBuilder]: For program point L237-2(lines 219 552) no Hoare annotation was computed. [2022-01-10 15:52:55,352 INFO L858 garLoopResultBuilder]: For program point L270(lines 270 272) no Hoare annotation was computed. [2022-01-10 15:52:55,352 INFO L858 garLoopResultBuilder]: For program point L134(lines 134 582) no Hoare annotation was computed. [2022-01-10 15:52:55,352 INFO L858 garLoopResultBuilder]: For program point L243(lines 243 246) no Hoare annotation was computed. [2022-01-10 15:52:55,352 INFO L858 garLoopResultBuilder]: For program point L254(lines 254 264) no Hoare annotation was computed. [2022-01-10 15:52:55,352 INFO L854 garLoopResultBuilder]: At program point L553(lines 110 608) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) (or (and (= 8560 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|) .cse0) (and (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656) .cse1 .cse0) (and .cse1 .cse0 (= 8656 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and .cse0 (= 8496 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) .cse2) (and .cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8512)) (and .cse0 (= 8544 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 3) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) .cse1 .cse2 (<= 8672 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (and .cse0 (= 8528 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0) (and .cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 3) (= 8448 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)))) [2022-01-10 15:52:55,352 INFO L854 garLoopResultBuilder]: At program point L135(lines 134 582) the Hoare annotation is: (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) [2022-01-10 15:52:55,352 INFO L858 garLoopResultBuilder]: For program point L137(lines 137 581) no Hoare annotation was computed. [2022-01-10 15:52:55,352 INFO L858 garLoopResultBuilder]: For program point L255(lines 255 258) no Hoare annotation was computed. [2022-01-10 15:52:55,353 INFO L858 garLoopResultBuilder]: For program point L591(lines 591 605) no Hoare annotation was computed. [2022-01-10 15:52:55,353 INFO L858 garLoopResultBuilder]: For program point L590(lines 590 606) no Hoare annotation was computed. [2022-01-10 15:52:55,353 INFO L854 garLoopResultBuilder]: At program point L144(lines 137 581) the Hoare annotation is: (or (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8576)) (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 15:52:55,353 INFO L858 garLoopResultBuilder]: For program point L140(lines 140 580) no Hoare annotation was computed. [2022-01-10 15:52:55,353 INFO L858 garLoopResultBuilder]: For program point L592(lines 592 597) no Hoare annotation was computed. [2022-01-10 15:52:55,353 INFO L858 garLoopResultBuilder]: For program point L285(lines 285 287) no Hoare annotation was computed. [2022-01-10 15:52:55,353 INFO L858 garLoopResultBuilder]: For program point L143(lines 143 579) no Hoare annotation was computed. [2022-01-10 15:52:55,353 INFO L858 garLoopResultBuilder]: For program point L594(lines 594 596) no Hoare annotation was computed. [2022-01-10 15:52:55,353 INFO L858 garLoopResultBuilder]: For program point L592-2(lines 591 605) no Hoare annotation was computed. [2022-01-10 15:52:55,353 INFO L858 garLoopResultBuilder]: For program point L285-2(lines 219 552) no Hoare annotation was computed. [2022-01-10 15:52:55,354 INFO L858 garLoopResultBuilder]: For program point L146(lines 146 578) no Hoare annotation was computed. [2022-01-10 15:52:55,354 INFO L858 garLoopResultBuilder]: For program point L599(lines 599 603) no Hoare annotation was computed. [2022-01-10 15:52:55,354 INFO L854 garLoopResultBuilder]: At program point L150(lines 146 578) the Hoare annotation is: (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 15:52:55,355 INFO L858 garLoopResultBuilder]: For program point L149(lines 149 577) no Hoare annotation was computed. [2022-01-10 15:52:55,355 INFO L858 garLoopResultBuilder]: For program point L298(lines 298 300) no Hoare annotation was computed. [2022-01-10 15:52:55,355 INFO L858 garLoopResultBuilder]: For program point L152(lines 152 576) no Hoare annotation was computed. [2022-01-10 15:52:55,355 INFO L858 garLoopResultBuilder]: For program point L298-2(lines 219 552) no Hoare annotation was computed. [2022-01-10 15:52:55,355 INFO L854 garLoopResultBuilder]: At program point L156(lines 152 576) the Hoare annotation is: (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 15:52:55,355 INFO L858 garLoopResultBuilder]: For program point L155(lines 155 575) no Hoare annotation was computed. [2022-01-10 15:52:55,356 INFO L858 garLoopResultBuilder]: For program point L304(lines 304 308) no Hoare annotation was computed. [2022-01-10 15:52:55,356 INFO L858 garLoopResultBuilder]: For program point L315(lines 315 322) no Hoare annotation was computed. [2022-01-10 15:52:55,356 INFO L858 garLoopResultBuilder]: For program point L158(lines 158 574) no Hoare annotation was computed. [2022-01-10 15:52:55,356 INFO L858 garLoopResultBuilder]: For program point L304-2(lines 304 308) no Hoare annotation was computed. [2022-01-10 15:52:55,356 INFO L858 garLoopResultBuilder]: For program point L315-2(lines 315 322) no Hoare annotation was computed. [2022-01-10 15:52:55,356 INFO L858 garLoopResultBuilder]: For program point L319(lines 319 321) no Hoare annotation was computed. [2022-01-10 15:52:55,356 INFO L854 garLoopResultBuilder]: At program point L162(lines 158 574) the Hoare annotation is: (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 15:52:55,356 INFO L858 garLoopResultBuilder]: For program point L161(lines 161 573) no Hoare annotation was computed. [2022-01-10 15:52:55,356 INFO L858 garLoopResultBuilder]: For program point L332(lines 332 336) no Hoare annotation was computed. [2022-01-10 15:52:55,357 INFO L858 garLoopResultBuilder]: For program point L164(lines 164 572) no Hoare annotation was computed. [2022-01-10 15:52:55,357 INFO L858 garLoopResultBuilder]: For program point L332-2(lines 219 552) no Hoare annotation was computed. [2022-01-10 15:52:55,357 INFO L854 garLoopResultBuilder]: At program point L168(lines 164 572) the Hoare annotation is: (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 15:52:55,357 INFO L858 garLoopResultBuilder]: For program point L167(lines 167 571) no Hoare annotation was computed. [2022-01-10 15:52:55,357 INFO L854 garLoopResultBuilder]: At program point L362(lines 338 380) the Hoare annotation is: (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 15:52:55,357 INFO L858 garLoopResultBuilder]: For program point L341(lines 341 379) no Hoare annotation was computed. [2022-01-10 15:52:55,357 INFO L858 garLoopResultBuilder]: For program point L387(lines 387 419) no Hoare annotation was computed. [2022-01-10 15:52:55,357 INFO L858 garLoopResultBuilder]: For program point L170(lines 170 570) no Hoare annotation was computed. [2022-01-10 15:52:55,357 INFO L858 garLoopResultBuilder]: For program point L364(lines 364 366) no Hoare annotation was computed. [2022-01-10 15:52:55,358 INFO L858 garLoopResultBuilder]: For program point L344(lines 344 378) no Hoare annotation was computed. [2022-01-10 15:52:55,358 INFO L858 garLoopResultBuilder]: For program point L388(lines 388 394) no Hoare annotation was computed. [2022-01-10 15:52:55,358 INFO L854 garLoopResultBuilder]: At program point L396(lines 387 419) the Hoare annotation is: (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 15:52:55,358 INFO L854 garLoopResultBuilder]: At program point L174(lines 170 570) the Hoare annotation is: (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 15:52:55,358 INFO L858 garLoopResultBuilder]: For program point L173(lines 173 569) no Hoare annotation was computed. [2022-01-10 15:52:55,358 INFO L858 garLoopResultBuilder]: For program point L344-1(lines 344 378) no Hoare annotation was computed. [2022-01-10 15:52:55,358 INFO L858 garLoopResultBuilder]: For program point L345(lines 345 375) no Hoare annotation was computed. [2022-01-10 15:52:55,358 INFO L858 garLoopResultBuilder]: For program point L399(lines 399 417) no Hoare annotation was computed. [2022-01-10 15:52:55,358 INFO L858 garLoopResultBuilder]: For program point L429(lines 429 431) no Hoare annotation was computed. [2022-01-10 15:52:55,358 INFO L858 garLoopResultBuilder]: For program point L176(lines 176 568) no Hoare annotation was computed. [2022-01-10 15:52:55,358 INFO L858 garLoopResultBuilder]: For program point L350(lines 350 373) no Hoare annotation was computed. [2022-01-10 15:52:55,358 INFO L858 garLoopResultBuilder]: For program point L400(lines 400 406) no Hoare annotation was computed. [2022-01-10 15:52:55,358 INFO L854 garLoopResultBuilder]: At program point L408(lines 399 417) the Hoare annotation is: (or (and (not (<= 8576 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3))) [2022-01-10 15:52:55,358 INFO L854 garLoopResultBuilder]: At program point L177(lines 176 568) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)) (.cse1 (= 8448 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (or (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) .cse0 .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2) .cse1) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0) .cse1) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 3) .cse1))) [2022-01-10 15:52:55,358 INFO L858 garLoopResultBuilder]: For program point L179(lines 179 567) no Hoare annotation was computed. [2022-01-10 15:52:55,358 INFO L858 garLoopResultBuilder]: For program point L353(lines 353 357) no Hoare annotation was computed. [2022-01-10 15:52:55,358 INFO L858 garLoopResultBuilder]: For program point L411(lines 411 413) no Hoare annotation was computed. [2022-01-10 15:52:55,358 INFO L858 garLoopResultBuilder]: For program point L440(lines 440 443) no Hoare annotation was computed. [2022-01-10 15:52:55,358 INFO L858 garLoopResultBuilder]: For program point L437-1(lines 437 445) no Hoare annotation was computed. [2022-01-10 15:52:55,358 INFO L854 garLoopResultBuilder]: At program point L183(lines 179 567) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656))) (or (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)))) [2022-01-10 15:52:55,358 INFO L858 garLoopResultBuilder]: For program point L182(lines 182 566) no Hoare annotation was computed. [2022-01-10 15:52:55,358 INFO L858 garLoopResultBuilder]: For program point L353-2(lines 353 357) no Hoare annotation was computed. [2022-01-10 15:52:55,358 INFO L858 garLoopResultBuilder]: For program point L451(lines 451 453) no Hoare annotation was computed. [2022-01-10 15:52:55,358 INFO L858 garLoopResultBuilder]: For program point L185(lines 185 565) no Hoare annotation was computed. [2022-01-10 15:52:55,359 INFO L858 garLoopResultBuilder]: For program point L361(lines 361 369) no Hoare annotation was computed. [2022-01-10 15:52:55,359 INFO L858 garLoopResultBuilder]: For program point L454(lines 454 463) no Hoare annotation was computed. [2022-01-10 15:52:55,359 INFO L854 garLoopResultBuilder]: At program point L189(lines 185 565) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656))) (or (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)))) [2022-01-10 15:52:55,360 INFO L858 garLoopResultBuilder]: For program point L188(lines 188 564) no Hoare annotation was computed. [2022-01-10 15:52:55,360 INFO L858 garLoopResultBuilder]: For program point L458(lines 458 460) no Hoare annotation was computed. [2022-01-10 15:52:55,360 INFO L858 garLoopResultBuilder]: For program point L468(lines 468 470) no Hoare annotation was computed. [2022-01-10 15:52:55,360 INFO L858 garLoopResultBuilder]: For program point L191(lines 191 563) no Hoare annotation was computed. [2022-01-10 15:52:55,360 INFO L854 garLoopResultBuilder]: At program point L195(lines 191 563) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656))) (or (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)))) [2022-01-10 15:52:55,360 INFO L858 garLoopResultBuilder]: For program point L194(lines 194 562) no Hoare annotation was computed. [2022-01-10 15:52:55,360 INFO L858 garLoopResultBuilder]: For program point L477(lines 477 479) no Hoare annotation was computed. [2022-01-10 15:52:55,360 INFO L858 garLoopResultBuilder]: For program point L197(lines 197 561) no Hoare annotation was computed. [2022-01-10 15:52:55,360 INFO L854 garLoopResultBuilder]: At program point L201(lines 197 561) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8656))) (or (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672)) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)))) [2022-01-10 15:52:55,360 INFO L858 garLoopResultBuilder]: For program point L200(lines 200 560) no Hoare annotation was computed. [2022-01-10 15:52:55,360 INFO L858 garLoopResultBuilder]: For program point L486(lines 486 488) no Hoare annotation was computed. [2022-01-10 15:52:55,360 INFO L858 garLoopResultBuilder]: For program point L203(lines 203 559) no Hoare annotation was computed. [2022-01-10 15:52:55,360 INFO L858 garLoopResultBuilder]: For program point L486-2(lines 219 552) no Hoare annotation was computed. [2022-01-10 15:52:55,360 INFO L854 garLoopResultBuilder]: At program point L207(lines 203 559) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int| 8672))) (or (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 2)) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)) (and .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)))) [2022-01-10 15:52:55,360 INFO L858 garLoopResultBuilder]: For program point L206(lines 206 558) no Hoare annotation was computed. [2022-01-10 15:52:55,360 INFO L858 garLoopResultBuilder]: For program point L492(lines 492 496) no Hoare annotation was computed. [2022-01-10 15:52:55,360 INFO L858 garLoopResultBuilder]: For program point L502(lines 502 505) no Hoare annotation was computed. [2022-01-10 15:52:55,360 INFO L858 garLoopResultBuilder]: For program point L209(lines 209 557) no Hoare annotation was computed. [2022-01-10 15:52:55,360 INFO L858 garLoopResultBuilder]: For program point L492-2(lines 492 496) no Hoare annotation was computed. [2022-01-10 15:52:55,360 INFO L858 garLoopResultBuilder]: For program point L507(lines 507 509) no Hoare annotation was computed. [2022-01-10 15:52:55,360 INFO L854 garLoopResultBuilder]: At program point L213(lines 209 557) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 3)) (.cse1 (<= 8672 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__state~0#1Int|))) (or (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1Int| 8576) .cse0 .cse1) (and (not (= 0 |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~s__hit~0#1Int|)) .cse0 .cse1) (and .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_accept_~blastFlag~0#1Int| 0)))) [2022-01-10 15:52:55,360 INFO L858 garLoopResultBuilder]: For program point L212(lines 212 556) no Hoare annotation was computed. [2022-01-10 15:52:55,360 INFO L858 garLoopResultBuilder]: For program point L507-2(lines 219 552) no Hoare annotation was computed. [2022-01-10 15:52:55,361 INFO L858 garLoopResultBuilder]: For program point L523(lines 523 525) no Hoare annotation was computed. [2022-01-10 15:52:55,361 INFO L858 garLoopResultBuilder]: For program point L215(lines 215 555) no Hoare annotation was computed. [2022-01-10 15:52:55,361 INFO L858 garLoopResultBuilder]: For program point L515(lines 515 518) no Hoare annotation was computed. [2022-01-10 15:52:55,361 INFO L854 garLoopResultBuilder]: At program point L524(lines 83 620) the Hoare annotation is: false [2022-01-10 15:52:55,361 INFO L858 garLoopResultBuilder]: For program point L526(lines 526 528) no Hoare annotation was computed. [2022-01-10 15:52:55,361 INFO L861 garLoopResultBuilder]: At program point L216(lines 215 555) the Hoare annotation is: true [2022-01-10 15:52:55,361 INFO L861 garLoopResultBuilder]: At program point L218(lines 217 555) the Hoare annotation is: true [2022-01-10 15:52:55,361 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 618) no Hoare annotation was computed. [2022-01-10 15:52:55,361 INFO L858 garLoopResultBuilder]: For program point L530(lines 530 534) no Hoare annotation was computed. [2022-01-10 15:52:55,362 INFO L858 garLoopResultBuilder]: For program point L540(lines 540 546) no Hoare annotation was computed. [2022-01-10 15:52:55,362 INFO L858 garLoopResultBuilder]: For program point L530-2(lines 530 534) no Hoare annotation was computed. [2022-01-10 15:52:55,362 INFO L858 garLoopResultBuilder]: For program point L543(lines 543 545) no Hoare annotation was computed. [2022-01-10 15:52:55,362 INFO L858 garLoopResultBuilder]: For program point L540-1(lines 540 546) no Hoare annotation was computed. [2022-01-10 15:52:55,365 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:55,365 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 15:52:55,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 03:52:55 BasicIcfg [2022-01-10 15:52:55,402 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 15:52:55,403 INFO L158 Benchmark]: Toolchain (without parser) took 11779.83ms. Allocated memory was 228.6MB in the beginning and 497.0MB in the end (delta: 268.4MB). Free memory was 174.8MB in the beginning and 343.9MB in the end (delta: -169.1MB). Peak memory consumption was 275.3MB. Max. memory is 8.0GB. [2022-01-10 15:52:55,403 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 228.6MB. Free memory is still 191.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 15:52:55,411 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.69ms. Allocated memory is still 228.6MB. Free memory was 174.7MB in the beginning and 197.8MB in the end (delta: -23.1MB). Peak memory consumption was 5.1MB. Max. memory is 8.0GB. [2022-01-10 15:52:55,411 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.06ms. Allocated memory is still 228.6MB. Free memory was 197.8MB in the beginning and 195.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 15:52:55,411 INFO L158 Benchmark]: Boogie Preprocessor took 65.63ms. Allocated memory is still 228.6MB. Free memory was 195.1MB in the beginning and 193.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 15:52:55,411 INFO L158 Benchmark]: RCFGBuilder took 508.49ms. Allocated memory is still 228.6MB. Free memory was 193.0MB in the beginning and 166.6MB in the end (delta: 26.4MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-01-10 15:52:55,411 INFO L158 Benchmark]: IcfgTransformer took 111.14ms. Allocated memory is still 228.6MB. Free memory was 166.3MB in the beginning and 152.4MB in the end (delta: 13.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-01-10 15:52:55,412 INFO L158 Benchmark]: TraceAbstraction took 10680.17ms. Allocated memory was 228.6MB in the beginning and 497.0MB in the end (delta: 268.4MB). Free memory was 152.1MB in the beginning and 343.9MB in the end (delta: -191.9MB). Peak memory consumption was 253.1MB. Max. memory is 8.0GB. [2022-01-10 15:52:55,413 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.09ms. Allocated memory is still 228.6MB. Free memory is still 191.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 312.69ms. Allocated memory is still 228.6MB. Free memory was 174.7MB in the beginning and 197.8MB in the end (delta: -23.1MB). Peak memory consumption was 5.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 94.06ms. Allocated memory is still 228.6MB. Free memory was 197.8MB in the beginning and 195.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 65.63ms. Allocated memory is still 228.6MB. Free memory was 195.1MB in the beginning and 193.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 508.49ms. Allocated memory is still 228.6MB. Free memory was 193.0MB in the beginning and 166.6MB in the end (delta: 26.4MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * IcfgTransformer took 111.14ms. Allocated memory is still 228.6MB. Free memory was 166.3MB in the beginning and 152.4MB in the end (delta: 13.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 10680.17ms. Allocated memory was 228.6MB in the beginning and 497.0MB in the end (delta: 268.4MB). Free memory was 152.1MB in the beginning and 343.9MB in the end (delta: -191.9MB). Peak memory consumption was 253.1MB. 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: 618]: 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, 141 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.6s, OverallIterations: 18, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1753 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1753 mSDsluCounter, 6668 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2841 mSDsCounter, 503 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2469 IncrementalHoareTripleChecker+Invalid, 2972 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 503 mSolverCounterUnsat, 3827 mSDtfsCounter, 2469 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2232 GetRequests, 2199 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2622occurred in iteration=17, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 1014 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 334 NumberOfFragments, 666 HoareAnnotationTreeSize, 28 FomulaSimplifications, 5020 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 28 FomulaSimplificationsInter, 3104 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 5261 NumberOfCodeBlocks, 5261 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 6210 ConstructedInterpolants, 0 QuantifiedInterpolants, 9046 SizeOfPredicates, 2 NumberOfNonLiveVariables, 4501 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 23 InterpolantComputations, 16 PerfectInterpolantSequences, 25212/25394 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: 622]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32)) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: NULL - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((~bvule32(blastFlag, 2bv32) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvule32(s__state, 8672bv32)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32))) || (~bvule32(blastFlag, 0bv32) && ~bvule32(s__state, 8672bv32)) - InvariantResult [Line: 399]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32)) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: ((~bvule32(blastFlag, 0bv32) && ~bvult64(s__state, 8656bv32)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvult64(s__state, 8656bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: ((~bvule32(blastFlag, 0bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvult64(s__state, 8576bv32)) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((((((~bvule32(blastFlag, 2bv32) && 8528bv32 == s__state) || ~bvule32(s__state, 3bv32)) || ~bvule32(blastFlag, 0bv32)) || (~bvule32(blastFlag, 2bv32) && 8496bv32 == s__state)) || (((~bvule32(blastFlag, 3bv32) && ~bvule32(8672bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvule32(s__state, 8672bv32))) || ((~bvule32(blastFlag, 3bv32) && ~bvule32(s__s3__tmp__next_state___0, 3bv32)) && 8448bv32 == s__state)) || ((~bvule32(blastFlag, 2bv32) && 8656bv32 == s__state) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (~bvule32(blastFlag, 2bv32) && 8512bv32 == s__state)) || (~bvule32(blastFlag, 2bv32) && 8560bv32 == s__state)) || (!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvult64(s__state, 8656bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (~bvule32(blastFlag, 2bv32) && 8544bv32 == s__state) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((((((~bvule32(blastFlag, 2bv32) && 8528bv32 == s__state) || ~bvule32(s__state, 3bv32)) || ~bvule32(blastFlag, 0bv32)) || (~bvule32(blastFlag, 2bv32) && 8496bv32 == s__state)) || (((~bvule32(blastFlag, 3bv32) && ~bvule32(8672bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvule32(s__state, 8672bv32))) || ((~bvule32(blastFlag, 3bv32) && ~bvule32(s__s3__tmp__next_state___0, 3bv32)) && 8448bv32 == s__state)) || ((~bvule32(blastFlag, 2bv32) && 8656bv32 == s__state) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (~bvule32(blastFlag, 2bv32) && 8512bv32 == s__state)) || (~bvule32(blastFlag, 2bv32) && 8560bv32 == s__state)) || (!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvult64(s__state, 8656bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (~bvule32(blastFlag, 2bv32) && 8544bv32 == s__state) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 0bv32) || (!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvult64(s__state, 8576bv32)) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(8672bv32, s__state)) || (~bvule32(blastFlag, 0bv32) && ~bvule32(8672bv32, s__state)) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((~bvule32(blastFlag, 0bv32) && 8448bv32 == s__state) || ((~bvule32(blastFlag, 3bv32) && ~bvule32(s__s3__tmp__next_state___0, 3bv32)) && 8448bv32 == s__state)) || ((~bvule32(blastFlag, 2bv32) && 8448bv32 == s__state) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && 8448bv32 == s__state) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((~bvule32(blastFlag, 0bv32) && ~bvult64(s__state, 8656bv32)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvult64(s__state, 8656bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32)) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: (((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(8672bv32, s__state)) || ((~bvule32(blastFlag, 3bv32) && ~bvule32(8672bv32, s__state)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32))) || (~bvule32(blastFlag, 0bv32) && ~bvule32(8672bv32, s__state)) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: ((~bvule32(blastFlag, 0bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) && ~bvult64(s__state, 8576bv32)) - InvariantResult [Line: 338]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32)) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32)) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((~bvule32(blastFlag, 0bv32) && ~bvult64(s__state, 8656bv32)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvult64(s__state, 8656bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32)) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: ((~bvule32(blastFlag, 0bv32) && ~bvult64(s__state, 8656bv32)) || (!(s__hit == 0bv32) && ~bvule32(s__state, 8672bv32))) || ((~bvule32(blastFlag, 2bv32) && ~bvult64(s__state, 8656bv32)) && ~bvule32(s__s3__tmp__next_state___0, 8576bv32)) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: (~bvule32(blastFlag, 2bv32) && !~bvule32(8576bv32, s__state)) || ((!(s__hit == 0bv32) && ~bvule32(blastFlag, 3bv32)) && ~bvule32(s__state, 8672bv32)) RESULT: Ultimate proved your program to be correct! [2022-01-10 15:52:55,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...