/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_clnt_1.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 15:52:05,774 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 15:52:05,777 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 15:52:05,856 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 15:52:05,856 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 15:52:05,857 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 15:52:05,858 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 15:52:05,860 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 15:52:05,861 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 15:52:05,862 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 15:52:05,862 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 15:52:05,863 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 15:52:05,864 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 15:52:05,864 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 15:52:05,865 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 15:52:05,866 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 15:52:05,871 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 15:52:05,877 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 15:52:05,882 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 15:52:05,883 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 15:52:05,884 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 15:52:05,889 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 15:52:05,890 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 15:52:05,891 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 15:52:05,893 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 15:52:05,893 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 15:52:05,893 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 15:52:05,894 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 15:52:05,894 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 15:52:05,895 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 15:52:05,895 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 15:52:05,896 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 15:52:05,896 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 15:52:05,897 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 15:52:05,897 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 15:52:05,898 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 15:52:05,898 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 15:52:05,898 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 15:52:05,898 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 15:52:05,899 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 15:52:05,900 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 15:52:05,905 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:05,938 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 15:52:05,938 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 15:52:05,939 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 15:52:05,939 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 15:52:05,940 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 15:52:05,940 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 15:52:05,940 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 15:52:05,941 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 15:52:05,941 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 15:52:05,941 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 15:52:05,941 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 15:52:05,942 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 15:52:05,942 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 15:52:05,942 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 15:52:05,942 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 15:52:05,942 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 15:52:05,942 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 15:52:05,942 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 15:52:05,942 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 15:52:05,943 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 15:52:05,943 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 15:52:05,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 15:52:05,943 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 15:52:05,943 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 15:52:05,943 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 15:52:05,943 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 15:52:05,944 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 15:52:05,944 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 15:52:05,944 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 15:52:05,944 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 15:52:05,944 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 15:52:05,944 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 15:52:05,945 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 15:52:05,945 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:06,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 15:52:06,145 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 15:52:06,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 15:52:06,148 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 15:52:06,149 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 15:52:06,150 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_clnt_1.cil-1.c [2022-01-10 15:52:06,208 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/036ec4800/ce763b6d389a432ea9e942ad7a0b5d46/FLAG2442a4b75 [2022-01-10 15:52:06,601 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 15:52:06,601 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_clnt_1.cil-1.c [2022-01-10 15:52:06,610 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/036ec4800/ce763b6d389a432ea9e942ad7a0b5d46/FLAG2442a4b75 [2022-01-10 15:52:06,624 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/036ec4800/ce763b6d389a432ea9e942ad7a0b5d46 [2022-01-10 15:52:06,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 15:52:06,627 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 15:52:06,629 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 15:52:06,629 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 15:52:06,631 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 15:52:06,632 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:52:06" (1/1) ... [2022-01-10 15:52:06,633 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@468aa696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:06, skipping insertion in model container [2022-01-10 15:52:06,633 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:52:06" (1/1) ... [2022-01-10 15:52:06,639 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 15:52:06,684 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 15:52:06,938 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_clnt_1.cil-1.c[35497,35510] [2022-01-10 15:52:06,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 15:52:06,962 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 15:52:06,999 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_clnt_1.cil-1.c[35497,35510] [2022-01-10 15:52:07,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 15:52:07,022 INFO L208 MainTranslator]: Completed translation [2022-01-10 15:52:07,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:07 WrapperNode [2022-01-10 15:52:07,023 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 15:52:07,024 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 15:52:07,024 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 15:52:07,024 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 15:52:07,030 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:07" (1/1) ... [2022-01-10 15:52:07,041 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:07" (1/1) ... [2022-01-10 15:52:07,072 INFO L137 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 461 [2022-01-10 15:52:07,073 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 15:52:07,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 15:52:07,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 15:52:07,073 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 15:52:07,081 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:07" (1/1) ... [2022-01-10 15:52:07,081 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:07" (1/1) ... [2022-01-10 15:52:07,085 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:07" (1/1) ... [2022-01-10 15:52:07,085 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:07" (1/1) ... [2022-01-10 15:52:07,097 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:07" (1/1) ... [2022-01-10 15:52:07,102 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:07" (1/1) ... [2022-01-10 15:52:07,104 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:07" (1/1) ... [2022-01-10 15:52:07,109 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 15:52:07,110 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 15:52:07,110 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 15:52:07,110 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 15:52:07,117 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:07" (1/1) ... [2022-01-10 15:52:07,133 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 15:52:07,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 15:52:07,151 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:07,166 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:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 15:52:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 15:52:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 15:52:07,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 15:52:07,264 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 15:52:07,265 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 15:52:07,278 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 15:52:07,664 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-01-10 15:52:07,664 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-01-10 15:52:07,665 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 15:52:07,678 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 15:52:07,678 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 15:52:07,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:52:07 BoogieIcfgContainer [2022-01-10 15:52:07,681 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 15:52:07,682 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 15:52:07,682 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 15:52:07,683 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 15:52:07,685 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:52:07" (1/1) ... [2022-01-10 15:52:07,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 03:52:07 BasicIcfg [2022-01-10 15:52:07,895 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 15:52:07,898 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 15:52:07,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 15:52:07,900 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 15:52:07,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 03:52:06" (1/4) ... [2022-01-10 15:52:07,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33a3516d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:52:07, skipping insertion in model container [2022-01-10 15:52:07,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:52:07" (2/4) ... [2022-01-10 15:52:07,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33a3516d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:52:07, skipping insertion in model container [2022-01-10 15:52:07,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:52:07" (3/4) ... [2022-01-10 15:52:07,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33a3516d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 03:52:07, skipping insertion in model container [2022-01-10 15:52:07,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 03:52:07" (4/4) ... [2022-01-10 15:52:07,903 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt_1.cil-1.cTransformedIcfg [2022-01-10 15:52:07,907 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 15:52:07,907 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 15:52:07,947 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 15:52:07,956 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:07,956 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 15:52:07,971 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 125 states have (on average 1.72) internal successors, (215), 126 states have internal predecessors, (215), 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:07,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 15:52:07,977 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:07,977 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] [2022-01-10 15:52:07,978 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:07,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:07,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1066682238, now seen corresponding path program 1 times [2022-01-10 15:52:07,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:07,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891561607] [2022-01-10 15:52:07,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:07,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:08,224 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:08,224 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:08,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891561607] [2022-01-10 15:52:08,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891561607] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:08,226 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:08,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:08,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895809096] [2022-01-10 15:52:08,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:08,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:08,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:08,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:08,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:08,269 INFO L87 Difference]: Start difference. First operand has 127 states, 125 states have (on average 1.72) internal successors, (215), 126 states have internal predecessors, (215), 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 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:08,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:08,373 INFO L93 Difference]: Finished difference Result 363 states and 617 transitions. [2022-01-10 15:52:08,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:08,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2022-01-10 15:52:08,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:08,391 INFO L225 Difference]: With dead ends: 363 [2022-01-10 15:52:08,391 INFO L226 Difference]: Without dead ends: 211 [2022-01-10 15:52:08,394 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:08,397 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 178 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:08,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 396 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:52:08,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-01-10 15:52:08,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2022-01-10 15:52:08,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.5) internal successors, (315), 210 states have internal predecessors, (315), 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:08,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 315 transitions. [2022-01-10 15:52:08,453 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 315 transitions. Word has length 24 [2022-01-10 15:52:08,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:08,453 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 315 transitions. [2022-01-10 15:52:08,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:08,453 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 315 transitions. [2022-01-10 15:52:08,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-10 15:52:08,455 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:08,455 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:08,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 15:52:08,456 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:08,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:08,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1094950918, now seen corresponding path program 1 times [2022-01-10 15:52:08,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:08,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664173450] [2022-01-10 15:52:08,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:08,457 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:08,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:08,561 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:52:08,561 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:08,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664173450] [2022-01-10 15:52:08,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664173450] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:08,562 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:08,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:08,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441236488] [2022-01-10 15:52:08,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:08,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:08,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:08,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:08,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:08,564 INFO L87 Difference]: Start difference. First operand 211 states and 315 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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:08,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:08,736 INFO L93 Difference]: Finished difference Result 340 states and 513 transitions. [2022-01-10 15:52:08,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:08,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 38 [2022-01-10 15:52:08,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:08,738 INFO L225 Difference]: With dead ends: 340 [2022-01-10 15:52:08,738 INFO L226 Difference]: Without dead ends: 236 [2022-01-10 15:52:08,739 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:08,740 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 14 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:08,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 258 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:08,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-01-10 15:52:08,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 228. [2022-01-10 15:52:08,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.4845814977973568) internal successors, (337), 227 states have internal predecessors, (337), 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:08,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 337 transitions. [2022-01-10 15:52:08,755 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 337 transitions. Word has length 38 [2022-01-10 15:52:08,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:08,755 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 337 transitions. [2022-01-10 15:52:08,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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:08,756 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 337 transitions. [2022-01-10 15:52:08,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 15:52:08,757 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:08,758 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:08,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 15:52:08,758 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:08,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:08,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1460883333, now seen corresponding path program 1 times [2022-01-10 15:52:08,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:08,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146093242] [2022-01-10 15:52:08,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:08,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:08,820 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:52:08,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:08,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146093242] [2022-01-10 15:52:08,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146093242] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:08,821 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:08,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:08,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408992480] [2022-01-10 15:52:08,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:08,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:08,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:08,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:08,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:08,823 INFO L87 Difference]: Start difference. First operand 228 states and 337 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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:08,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:08,849 INFO L93 Difference]: Finished difference Result 370 states and 544 transitions. [2022-01-10 15:52:08,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:08,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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 55 [2022-01-10 15:52:08,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:08,851 INFO L225 Difference]: With dead ends: 370 [2022-01-10 15:52:08,852 INFO L226 Difference]: Without dead ends: 249 [2022-01-10 15:52:08,855 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:08,859 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 11 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:08,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 345 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:52:08,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-01-10 15:52:08,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2022-01-10 15:52:08,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 1.467741935483871) internal successors, (364), 248 states have internal predecessors, (364), 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:08,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 364 transitions. [2022-01-10 15:52:08,886 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 364 transitions. Word has length 55 [2022-01-10 15:52:08,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:08,886 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 364 transitions. [2022-01-10 15:52:08,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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:08,886 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 364 transitions. [2022-01-10 15:52:08,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 15:52:08,888 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:08,889 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:08,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 15:52:08,889 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:08,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:08,890 INFO L85 PathProgramCache]: Analyzing trace with hash -756874620, now seen corresponding path program 1 times [2022-01-10 15:52:08,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:08,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502855563] [2022-01-10 15:52:08,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:08,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:09,002 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 15:52:09,002 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:09,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502855563] [2022-01-10 15:52:09,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502855563] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:09,003 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:09,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:09,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880238256] [2022-01-10 15:52:09,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:09,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:09,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:09,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:09,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:09,005 INFO L87 Difference]: Start difference. First operand 249 states and 364 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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:09,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:09,171 INFO L93 Difference]: Finished difference Result 593 states and 895 transitions. [2022-01-10 15:52:09,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:09,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 55 [2022-01-10 15:52:09,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:09,174 INFO L225 Difference]: With dead ends: 593 [2022-01-10 15:52:09,174 INFO L226 Difference]: Without dead ends: 349 [2022-01-10 15:52:09,176 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:09,184 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 53 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:09,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 222 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 15:52:09,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-01-10 15:52:09,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 331. [2022-01-10 15:52:09,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 330 states have (on average 1.406060606060606) internal successors, (464), 330 states have internal predecessors, (464), 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:09,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 464 transitions. [2022-01-10 15:52:09,199 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 464 transitions. Word has length 55 [2022-01-10 15:52:09,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:09,199 INFO L470 AbstractCegarLoop]: Abstraction has 331 states and 464 transitions. [2022-01-10 15:52:09,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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:09,200 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 464 transitions. [2022-01-10 15:52:09,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-10 15:52:09,202 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:09,202 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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] [2022-01-10 15:52:09,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 15:52:09,202 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:09,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:09,203 INFO L85 PathProgramCache]: Analyzing trace with hash 533632591, now seen corresponding path program 1 times [2022-01-10 15:52:09,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:09,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713131826] [2022-01-10 15:52:09,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:09,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:09,290 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 15:52:09,291 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:09,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713131826] [2022-01-10 15:52:09,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713131826] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:09,291 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:09,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:09,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450169340] [2022-01-10 15:52:09,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:09,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:09,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:09,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:09,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:09,294 INFO L87 Difference]: Start difference. First operand 331 states and 464 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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:09,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:09,460 INFO L93 Difference]: Finished difference Result 701 states and 996 transitions. [2022-01-10 15:52:09,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:09,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 68 [2022-01-10 15:52:09,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:09,463 INFO L225 Difference]: With dead ends: 701 [2022-01-10 15:52:09,463 INFO L226 Difference]: Without dead ends: 377 [2022-01-10 15:52:09,463 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:09,464 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 14 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:09,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 261 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 15:52:09,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-01-10 15:52:09,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 369. [2022-01-10 15:52:09,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 368 states have (on average 1.391304347826087) internal successors, (512), 368 states have internal predecessors, (512), 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:09,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 512 transitions. [2022-01-10 15:52:09,476 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 512 transitions. Word has length 68 [2022-01-10 15:52:09,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:09,481 INFO L470 AbstractCegarLoop]: Abstraction has 369 states and 512 transitions. [2022-01-10 15:52:09,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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:09,486 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 512 transitions. [2022-01-10 15:52:09,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-10 15:52:09,490 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:09,490 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 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] [2022-01-10 15:52:09,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 15:52:09,490 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:09,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:09,491 INFO L85 PathProgramCache]: Analyzing trace with hash -2110207324, now seen corresponding path program 1 times [2022-01-10 15:52:09,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:09,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418306985] [2022-01-10 15:52:09,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:09,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:09,577 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 15:52:09,578 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:09,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418306985] [2022-01-10 15:52:09,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418306985] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:09,578 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:09,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:09,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074629882] [2022-01-10 15:52:09,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:09,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:09,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:09,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:09,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:09,579 INFO L87 Difference]: Start difference. First operand 369 states and 512 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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:09,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:09,737 INFO L93 Difference]: Finished difference Result 870 states and 1234 transitions. [2022-01-10 15:52:09,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:09,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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:09,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:09,740 INFO L225 Difference]: With dead ends: 870 [2022-01-10 15:52:09,740 INFO L226 Difference]: Without dead ends: 506 [2022-01-10 15:52:09,741 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:09,742 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 126 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:09,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 172 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:09,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2022-01-10 15:52:09,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 480. [2022-01-10 15:52:09,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 479 states have (on average 1.4258872651356993) internal successors, (683), 479 states have internal predecessors, (683), 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:09,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 683 transitions. [2022-01-10 15:52:09,761 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 683 transitions. Word has length 81 [2022-01-10 15:52:09,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:09,761 INFO L470 AbstractCegarLoop]: Abstraction has 480 states and 683 transitions. [2022-01-10 15:52:09,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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:09,762 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 683 transitions. [2022-01-10 15:52:09,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-10 15:52:09,764 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:09,764 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2022-01-10 15:52:09,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 15:52:09,764 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:09,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:09,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1016548416, now seen corresponding path program 1 times [2022-01-10 15:52:09,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:09,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41042142] [2022-01-10 15:52:09,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:09,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:09,836 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-01-10 15:52:09,836 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:09,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41042142] [2022-01-10 15:52:09,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41042142] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:09,836 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:09,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:09,836 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427975363] [2022-01-10 15:52:09,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:09,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:09,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:09,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:09,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:09,838 INFO L87 Difference]: Start difference. First operand 480 states and 683 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:09,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:09,952 INFO L93 Difference]: Finished difference Result 968 states and 1395 transitions. [2022-01-10 15:52:09,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:09,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2022-01-10 15:52:09,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:09,956 INFO L225 Difference]: With dead ends: 968 [2022-01-10 15:52:09,956 INFO L226 Difference]: Without dead ends: 528 [2022-01-10 15:52:09,957 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:09,958 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 12 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:09,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 260 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:09,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-01-10 15:52:09,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 522. [2022-01-10 15:52:09,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 521 states have (on average 1.4107485604606527) internal successors, (735), 521 states have internal predecessors, (735), 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:09,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 735 transitions. [2022-01-10 15:52:09,972 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 735 transitions. Word has length 84 [2022-01-10 15:52:09,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:09,973 INFO L470 AbstractCegarLoop]: Abstraction has 522 states and 735 transitions. [2022-01-10 15:52:09,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:09,973 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 735 transitions. [2022-01-10 15:52:09,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-01-10 15:52:09,978 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:09,979 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-01-10 15:52:09,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 15:52:09,979 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:09,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:09,979 INFO L85 PathProgramCache]: Analyzing trace with hash -781792154, now seen corresponding path program 1 times [2022-01-10 15:52:09,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:09,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222210365] [2022-01-10 15:52:09,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:09,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:10,037 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-01-10 15:52:10,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:10,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222210365] [2022-01-10 15:52:10,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222210365] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:10,038 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:10,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:10,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942708193] [2022-01-10 15:52:10,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:10,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:10,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:10,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:10,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:10,039 INFO L87 Difference]: Start difference. First operand 522 states and 735 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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:10,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:10,068 INFO L93 Difference]: Finished difference Result 1023 states and 1453 transitions. [2022-01-10 15:52:10,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:10,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 104 [2022-01-10 15:52:10,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:10,071 INFO L225 Difference]: With dead ends: 1023 [2022-01-10 15:52:10,072 INFO L226 Difference]: Without dead ends: 761 [2022-01-10 15:52:10,072 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:10,073 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 136 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:10,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 305 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:52:10,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2022-01-10 15:52:10,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761. [2022-01-10 15:52:10,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 760 states have (on average 1.4171052631578946) internal successors, (1077), 760 states have internal predecessors, (1077), 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:10,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1077 transitions. [2022-01-10 15:52:10,094 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1077 transitions. Word has length 104 [2022-01-10 15:52:10,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:10,095 INFO L470 AbstractCegarLoop]: Abstraction has 761 states and 1077 transitions. [2022-01-10 15:52:10,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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:10,095 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1077 transitions. [2022-01-10 15:52:10,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-10 15:52:10,096 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:10,096 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-01-10 15:52:10,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 15:52:10,098 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:10,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:10,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1301841361, now seen corresponding path program 1 times [2022-01-10 15:52:10,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:10,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618739160] [2022-01-10 15:52:10,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:10,099 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:10,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:10,162 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-01-10 15:52:10,162 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:10,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618739160] [2022-01-10 15:52:10,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618739160] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:10,162 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:10,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:10,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773604776] [2022-01-10 15:52:10,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:10,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:10,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:10,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:10,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:10,164 INFO L87 Difference]: Start difference. First operand 761 states and 1077 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:10,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:10,198 INFO L93 Difference]: Finished difference Result 1002 states and 1423 transitions. [2022-01-10 15:52:10,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:10,198 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 106 [2022-01-10 15:52:10,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:10,202 INFO L225 Difference]: With dead ends: 1002 [2022-01-10 15:52:10,202 INFO L226 Difference]: Without dead ends: 1000 [2022-01-10 15:52:10,202 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:10,204 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 138 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:10,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 303 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:52:10,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2022-01-10 15:52:10,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 1000. [2022-01-10 15:52:10,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 999 states have (on average 1.4224224224224224) internal successors, (1421), 999 states have internal predecessors, (1421), 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:10,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1421 transitions. [2022-01-10 15:52:10,228 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1421 transitions. Word has length 106 [2022-01-10 15:52:10,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:10,229 INFO L470 AbstractCegarLoop]: Abstraction has 1000 states and 1421 transitions. [2022-01-10 15:52:10,229 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:10,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1421 transitions. [2022-01-10 15:52:10,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-01-10 15:52:10,231 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:10,231 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1] [2022-01-10 15:52:10,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 15:52:10,232 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:10,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:10,232 INFO L85 PathProgramCache]: Analyzing trace with hash -459425482, now seen corresponding path program 1 times [2022-01-10 15:52:10,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:10,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73308824] [2022-01-10 15:52:10,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:10,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:10,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:10,289 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-01-10 15:52:10,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:10,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73308824] [2022-01-10 15:52:10,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73308824] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:10,290 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:10,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:10,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752861661] [2022-01-10 15:52:10,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:10,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:10,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:10,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:10,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:10,291 INFO L87 Difference]: Start difference. First operand 1000 states and 1421 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:10,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:10,421 INFO L93 Difference]: Finished difference Result 2066 states and 2964 transitions. [2022-01-10 15:52:10,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:10,422 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 131 [2022-01-10 15:52:10,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:10,426 INFO L225 Difference]: With dead ends: 2066 [2022-01-10 15:52:10,426 INFO L226 Difference]: Without dead ends: 1106 [2022-01-10 15:52:10,427 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:10,428 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 13 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:10,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 259 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:10,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2022-01-10 15:52:10,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1092. [2022-01-10 15:52:10,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1091 states have (on average 1.4051329055912007) internal successors, (1533), 1091 states have internal predecessors, (1533), 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:10,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1533 transitions. [2022-01-10 15:52:10,455 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1533 transitions. Word has length 131 [2022-01-10 15:52:10,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:10,455 INFO L470 AbstractCegarLoop]: Abstraction has 1092 states and 1533 transitions. [2022-01-10 15:52:10,456 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:10,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1533 transitions. [2022-01-10 15:52:10,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-01-10 15:52:10,458 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:10,458 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1] [2022-01-10 15:52:10,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 15:52:10,459 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:10,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:10,460 INFO L85 PathProgramCache]: Analyzing trace with hash -804562235, now seen corresponding path program 1 times [2022-01-10 15:52:10,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:10,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829696397] [2022-01-10 15:52:10,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:10,460 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:10,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:10,527 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2022-01-10 15:52:10,527 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:10,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829696397] [2022-01-10 15:52:10,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829696397] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:10,528 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:10,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:10,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918336497] [2022-01-10 15:52:10,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:10,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:10,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:10,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:10,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:10,529 INFO L87 Difference]: Start difference. First operand 1092 states and 1533 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:10,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:10,692 INFO L93 Difference]: Finished difference Result 2348 states and 3358 transitions. [2022-01-10 15:52:10,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:10,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2022-01-10 15:52:10,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:10,697 INFO L225 Difference]: With dead ends: 2348 [2022-01-10 15:52:10,697 INFO L226 Difference]: Without dead ends: 1288 [2022-01-10 15:52:10,699 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:10,700 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 66 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:10,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 211 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:10,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2022-01-10 15:52:10,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1248. [2022-01-10 15:52:10,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 1247 states have (on average 1.408981555733761) internal successors, (1757), 1247 states have internal predecessors, (1757), 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:10,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1757 transitions. [2022-01-10 15:52:10,732 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1757 transitions. Word has length 152 [2022-01-10 15:52:10,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:10,732 INFO L470 AbstractCegarLoop]: Abstraction has 1248 states and 1757 transitions. [2022-01-10 15:52:10,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:10,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1757 transitions. [2022-01-10 15:52:10,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-01-10 15:52:10,735 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:10,736 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:10,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 15:52:10,736 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:10,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:10,736 INFO L85 PathProgramCache]: Analyzing trace with hash 329770372, now seen corresponding path program 1 times [2022-01-10 15:52:10,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:10,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448600621] [2022-01-10 15:52:10,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:10,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:10,805 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2022-01-10 15:52:10,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:10,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448600621] [2022-01-10 15:52:10,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448600621] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:10,806 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:10,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:10,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870324921] [2022-01-10 15:52:10,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:10,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:10,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:10,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:10,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:10,807 INFO L87 Difference]: Start difference. First operand 1248 states and 1757 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:10,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:10,912 INFO L93 Difference]: Finished difference Result 2576 states and 3610 transitions. [2022-01-10 15:52:10,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:10,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 188 [2022-01-10 15:52:10,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:10,918 INFO L225 Difference]: With dead ends: 2576 [2022-01-10 15:52:10,918 INFO L226 Difference]: Without dead ends: 1368 [2022-01-10 15:52:10,920 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:10,921 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 10 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:10,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 260 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:10,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2022-01-10 15:52:10,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1360. [2022-01-10 15:52:10,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 1359 states have (on average 1.3899926416482709) internal successors, (1889), 1359 states have internal predecessors, (1889), 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:10,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1889 transitions. [2022-01-10 15:52:10,953 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1889 transitions. Word has length 188 [2022-01-10 15:52:10,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:10,954 INFO L470 AbstractCegarLoop]: Abstraction has 1360 states and 1889 transitions. [2022-01-10 15:52:10,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:10,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1889 transitions. [2022-01-10 15:52:10,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-01-10 15:52:10,957 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:10,957 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:10,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 15:52:10,957 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:10,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:10,958 INFO L85 PathProgramCache]: Analyzing trace with hash 610120261, now seen corresponding path program 1 times [2022-01-10 15:52:10,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:10,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522175173] [2022-01-10 15:52:10,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:10,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:11,036 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2022-01-10 15:52:11,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:11,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522175173] [2022-01-10 15:52:11,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522175173] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:11,037 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:11,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:11,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538358878] [2022-01-10 15:52:11,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:11,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:11,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:11,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:11,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:11,038 INFO L87 Difference]: Start difference. First operand 1360 states and 1889 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:11,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:11,181 INFO L93 Difference]: Finished difference Result 2816 states and 3910 transitions. [2022-01-10 15:52:11,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:11,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 188 [2022-01-10 15:52:11,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:11,187 INFO L225 Difference]: With dead ends: 2816 [2022-01-10 15:52:11,187 INFO L226 Difference]: Without dead ends: 1496 [2022-01-10 15:52:11,189 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:11,190 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 11 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:11,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 261 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:11,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2022-01-10 15:52:11,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1484. [2022-01-10 15:52:11,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1484 states, 1483 states have (on average 1.370869858395145) internal successors, (2033), 1483 states have internal predecessors, (2033), 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:11,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 2033 transitions. [2022-01-10 15:52:11,223 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 2033 transitions. Word has length 188 [2022-01-10 15:52:11,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:11,224 INFO L470 AbstractCegarLoop]: Abstraction has 1484 states and 2033 transitions. [2022-01-10 15:52:11,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:52:11,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 2033 transitions. [2022-01-10 15:52:11,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2022-01-10 15:52:11,227 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:11,228 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:11,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 15:52:11,228 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:11,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:11,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1584301588, now seen corresponding path program 1 times [2022-01-10 15:52:11,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:11,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957600937] [2022-01-10 15:52:11,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:11,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:11,325 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2022-01-10 15:52:11,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:11,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957600937] [2022-01-10 15:52:11,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957600937] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:11,325 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:11,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:11,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762386965] [2022-01-10 15:52:11,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:11,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:11,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:11,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:11,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:11,327 INFO L87 Difference]: Start difference. First operand 1484 states and 2033 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:11,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:11,369 INFO L93 Difference]: Finished difference Result 4256 states and 5867 transitions. [2022-01-10 15:52:11,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:11,370 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 218 [2022-01-10 15:52:11,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:11,380 INFO L225 Difference]: With dead ends: 4256 [2022-01-10 15:52:11,380 INFO L226 Difference]: Without dead ends: 2812 [2022-01-10 15:52:11,383 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:11,384 INFO L933 BasicCegarLoop]: 319 mSDtfsCounter, 125 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:11,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 482 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:52:11,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2812 states. [2022-01-10 15:52:11,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2812 to 2810. [2022-01-10 15:52:11,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2810 states, 2809 states have (on average 1.3787824848700605) internal successors, (3873), 2809 states have internal predecessors, (3873), 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:11,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 3873 transitions. [2022-01-10 15:52:11,451 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 3873 transitions. Word has length 218 [2022-01-10 15:52:11,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:11,451 INFO L470 AbstractCegarLoop]: Abstraction has 2810 states and 3873 transitions. [2022-01-10 15:52:11,451 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:11,452 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 3873 transitions. [2022-01-10 15:52:11,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2022-01-10 15:52:11,456 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:11,457 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:11,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 15:52:11,457 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:11,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:11,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1864651477, now seen corresponding path program 1 times [2022-01-10 15:52:11,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:11,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152007986] [2022-01-10 15:52:11,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:11,458 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:11,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:11,540 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-01-10 15:52:11,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:11,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152007986] [2022-01-10 15:52:11,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152007986] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:11,541 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:11,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:11,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691284766] [2022-01-10 15:52:11,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:11,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:11,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:11,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:11,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:11,543 INFO L87 Difference]: Start difference. First operand 2810 states and 3873 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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:11,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:11,700 INFO L93 Difference]: Finished difference Result 5880 states and 8110 transitions. [2022-01-10 15:52:11,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:11,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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 218 [2022-01-10 15:52:11,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:11,710 INFO L225 Difference]: With dead ends: 5880 [2022-01-10 15:52:11,711 INFO L226 Difference]: Without dead ends: 3110 [2022-01-10 15:52:11,715 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:11,716 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 11 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:11,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 261 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:11,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3110 states. [2022-01-10 15:52:11,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3110 to 3094. [2022-01-10 15:52:11,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3094 states, 3093 states have (on average 1.3569350145489816) internal successors, (4197), 3093 states have internal predecessors, (4197), 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:11,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3094 states to 3094 states and 4197 transitions. [2022-01-10 15:52:11,801 INFO L78 Accepts]: Start accepts. Automaton has 3094 states and 4197 transitions. Word has length 218 [2022-01-10 15:52:11,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:11,802 INFO L470 AbstractCegarLoop]: Abstraction has 3094 states and 4197 transitions. [2022-01-10 15:52:11,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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:11,802 INFO L276 IsEmpty]: Start isEmpty. Operand 3094 states and 4197 transitions. [2022-01-10 15:52:11,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2022-01-10 15:52:11,810 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:11,810 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 15:52:11,811 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:11,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:11,811 INFO L85 PathProgramCache]: Analyzing trace with hash 767217325, now seen corresponding path program 1 times [2022-01-10 15:52:11,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:11,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463746305] [2022-01-10 15:52:11,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:11,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:11,903 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2022-01-10 15:52:11,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:11,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463746305] [2022-01-10 15:52:11,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463746305] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:11,905 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:11,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:11,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219521405] [2022-01-10 15:52:11,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:11,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:11,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:11,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:11,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:11,907 INFO L87 Difference]: Start difference. First operand 3094 states and 4197 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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:12,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:12,061 INFO L93 Difference]: Finished difference Result 6296 states and 8542 transitions. [2022-01-10 15:52:12,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:12,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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 242 [2022-01-10 15:52:12,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:12,074 INFO L225 Difference]: With dead ends: 6296 [2022-01-10 15:52:12,074 INFO L226 Difference]: Without dead ends: 3242 [2022-01-10 15:52:12,078 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:12,079 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 10 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:12,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 260 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:12,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3242 states. [2022-01-10 15:52:12,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3242 to 3226. [2022-01-10 15:52:12,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3226 states, 3225 states have (on average 1.3485271317829457) internal successors, (4349), 3225 states have internal predecessors, (4349), 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:12,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3226 states to 3226 states and 4349 transitions. [2022-01-10 15:52:12,164 INFO L78 Accepts]: Start accepts. Automaton has 3226 states and 4349 transitions. Word has length 242 [2022-01-10 15:52:12,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:12,164 INFO L470 AbstractCegarLoop]: Abstraction has 3226 states and 4349 transitions. [2022-01-10 15:52:12,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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:12,165 INFO L276 IsEmpty]: Start isEmpty. Operand 3226 states and 4349 transitions. [2022-01-10 15:52:12,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-01-10 15:52:12,171 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:12,171 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 15:52:12,172 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:12,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:12,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1203543425, now seen corresponding path program 1 times [2022-01-10 15:52:12,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:12,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113770209] [2022-01-10 15:52:12,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:12,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:12,266 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-01-10 15:52:12,267 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:12,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113770209] [2022-01-10 15:52:12,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113770209] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:12,267 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:12,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:12,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058948843] [2022-01-10 15:52:12,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:12,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:12,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:12,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:12,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:12,269 INFO L87 Difference]: Start difference. First operand 3226 states and 4349 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:12,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:12,438 INFO L93 Difference]: Finished difference Result 6812 states and 9322 transitions. [2022-01-10 15:52:12,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:12,438 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 253 [2022-01-10 15:52:12,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:12,451 INFO L225 Difference]: With dead ends: 6812 [2022-01-10 15:52:12,451 INFO L226 Difference]: Without dead ends: 3626 [2022-01-10 15:52:12,457 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:12,458 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 44 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:12,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 253 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:12,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3626 states. [2022-01-10 15:52:12,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3626 to 3538. [2022-01-10 15:52:12,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3538 states, 3537 states have (on average 1.3336160588068986) internal successors, (4717), 3537 states have internal predecessors, (4717), 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:12,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3538 states to 3538 states and 4717 transitions. [2022-01-10 15:52:12,590 INFO L78 Accepts]: Start accepts. Automaton has 3538 states and 4717 transitions. Word has length 253 [2022-01-10 15:52:12,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:12,591 INFO L470 AbstractCegarLoop]: Abstraction has 3538 states and 4717 transitions. [2022-01-10 15:52:12,591 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:12,591 INFO L276 IsEmpty]: Start isEmpty. Operand 3538 states and 4717 transitions. [2022-01-10 15:52:12,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2022-01-10 15:52:12,598 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:12,598 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:12,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 15:52:12,598 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:12,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:12,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1856155328, now seen corresponding path program 1 times [2022-01-10 15:52:12,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:12,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305100454] [2022-01-10 15:52:12,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:12,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:12,692 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-01-10 15:52:12,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:12,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305100454] [2022-01-10 15:52:12,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305100454] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:12,693 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:12,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:12,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201321375] [2022-01-10 15:52:12,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:12,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:12,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:12,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:12,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:12,694 INFO L87 Difference]: Start difference. First operand 3538 states and 4717 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:12,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:12,868 INFO L93 Difference]: Finished difference Result 7444 states and 9866 transitions. [2022-01-10 15:52:12,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:12,868 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 267 [2022-01-10 15:52:12,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:12,882 INFO L225 Difference]: With dead ends: 7444 [2022-01-10 15:52:12,883 INFO L226 Difference]: Without dead ends: 3946 [2022-01-10 15:52:12,888 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:12,888 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 135 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:12,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 139 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:12,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3946 states. [2022-01-10 15:52:12,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3946 to 3658. [2022-01-10 15:52:12,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3658 states, 3657 states have (on average 1.3292316106097894) internal successors, (4861), 3657 states have internal predecessors, (4861), 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:12,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3658 states to 3658 states and 4861 transitions. [2022-01-10 15:52:12,977 INFO L78 Accepts]: Start accepts. Automaton has 3658 states and 4861 transitions. Word has length 267 [2022-01-10 15:52:12,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:12,977 INFO L470 AbstractCegarLoop]: Abstraction has 3658 states and 4861 transitions. [2022-01-10 15:52:12,977 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:12,977 INFO L276 IsEmpty]: Start isEmpty. Operand 3658 states and 4861 transitions. [2022-01-10 15:52:12,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-01-10 15:52:12,985 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:12,986 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:12,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 15:52:12,986 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:12,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:12,986 INFO L85 PathProgramCache]: Analyzing trace with hash 197071636, now seen corresponding path program 1 times [2022-01-10 15:52:12,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:12,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309626608] [2022-01-10 15:52:12,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:12,987 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:13,075 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 395 proven. 0 refuted. 0 times theorem prover too weak. 401 trivial. 0 not checked. [2022-01-10 15:52:13,076 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:13,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309626608] [2022-01-10 15:52:13,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309626608] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:13,076 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:13,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:13,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710734464] [2022-01-10 15:52:13,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:13,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:13,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:13,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:13,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:13,077 INFO L87 Difference]: Start difference. First operand 3658 states and 4861 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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:13,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:13,197 INFO L93 Difference]: Finished difference Result 10390 states and 13895 transitions. [2022-01-10 15:52:13,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:13,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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 268 [2022-01-10 15:52:13,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:13,212 INFO L225 Difference]: With dead ends: 10390 [2022-01-10 15:52:13,212 INFO L226 Difference]: Without dead ends: 6772 [2022-01-10 15:52:13,217 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:13,218 INFO L933 BasicCegarLoop]: 308 mSDtfsCounter, 83 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:13,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 469 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:52:13,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6772 states. [2022-01-10 15:52:13,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6772 to 6770. [2022-01-10 15:52:13,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6770 states, 6769 states have (on average 1.3380115231201064) internal successors, (9057), 6769 states have internal predecessors, (9057), 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:13,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6770 states to 6770 states and 9057 transitions. [2022-01-10 15:52:13,380 INFO L78 Accepts]: Start accepts. Automaton has 6770 states and 9057 transitions. Word has length 268 [2022-01-10 15:52:13,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:13,381 INFO L470 AbstractCegarLoop]: Abstraction has 6770 states and 9057 transitions. [2022-01-10 15:52:13,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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:13,381 INFO L276 IsEmpty]: Start isEmpty. Operand 6770 states and 9057 transitions. [2022-01-10 15:52:13,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-01-10 15:52:13,392 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:13,392 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:13,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 15:52:13,393 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:13,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:13,393 INFO L85 PathProgramCache]: Analyzing trace with hash 709395099, now seen corresponding path program 1 times [2022-01-10 15:52:13,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:13,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547878741] [2022-01-10 15:52:13,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:13,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:13,471 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2022-01-10 15:52:13,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:13,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547878741] [2022-01-10 15:52:13,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547878741] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:13,471 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:13,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:13,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317462313] [2022-01-10 15:52:13,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:13,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:13,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:13,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:13,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:13,473 INFO L87 Difference]: Start difference. First operand 6770 states and 9057 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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:13,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:13,681 INFO L93 Difference]: Finished difference Result 13508 states and 18058 transitions. [2022-01-10 15:52:13,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:13,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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:13,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:13,697 INFO L225 Difference]: With dead ends: 13508 [2022-01-10 15:52:13,697 INFO L226 Difference]: Without dead ends: 6778 [2022-01-10 15:52:13,707 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:13,708 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 11 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:13,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 256 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:13,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6778 states. [2022-01-10 15:52:13,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6778 to 6746. [2022-01-10 15:52:13,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6746 states, 6745 states have (on average 1.3107487027427724) internal successors, (8841), 6745 states have internal predecessors, (8841), 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:13,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6746 states to 6746 states and 8841 transitions. [2022-01-10 15:52:13,890 INFO L78 Accepts]: Start accepts. Automaton has 6746 states and 8841 transitions. Word has length 269 [2022-01-10 15:52:13,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:13,890 INFO L470 AbstractCegarLoop]: Abstraction has 6746 states and 8841 transitions. [2022-01-10 15:52:13,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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:13,891 INFO L276 IsEmpty]: Start isEmpty. Operand 6746 states and 8841 transitions. [2022-01-10 15:52:13,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2022-01-10 15:52:13,902 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:13,902 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 15:52:13,902 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:13,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:13,903 INFO L85 PathProgramCache]: Analyzing trace with hash -889204247, now seen corresponding path program 1 times [2022-01-10 15:52:13,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:13,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484162125] [2022-01-10 15:52:13,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:13,903 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:14,007 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-01-10 15:52:14,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:14,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484162125] [2022-01-10 15:52:14,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484162125] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 15:52:14,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168794323] [2022-01-10 15:52:14,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:14,008 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 15:52:14,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 15:52:14,015 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:14,027 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:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:14,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 1199 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 15:52:14,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 15:52:14,789 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-01-10 15:52:14,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 15:52:15,187 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-01-10 15:52:15,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168794323] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 15:52:15,187 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 15:52:15,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-10 15:52:15,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603544461] [2022-01-10 15:52:15,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 15:52:15,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 15:52:15,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:15,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 15:52:15,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 15:52:15,189 INFO L87 Difference]: Start difference. First operand 6746 states and 8841 transitions. Second operand has 6 states, 6 states have (on average 35.166666666666664) internal successors, (211), 6 states have internal predecessors, (211), 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:15,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:15,758 INFO L93 Difference]: Finished difference Result 17882 states and 23823 transitions. [2022-01-10 15:52:15,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 15:52:15,759 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 35.166666666666664) internal successors, (211), 6 states have internal predecessors, (211), 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 292 [2022-01-10 15:52:15,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:15,782 INFO L225 Difference]: With dead ends: 17882 [2022-01-10 15:52:15,782 INFO L226 Difference]: Without dead ends: 11120 [2022-01-10 15:52:15,794 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 584 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-01-10 15:52:15,795 INFO L933 BasicCegarLoop]: 326 mSDtfsCounter, 330 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:15,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [330 Valid, 744 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 15:52:15,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11120 states. [2022-01-10 15:52:15,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11120 to 9582. [2022-01-10 15:52:16,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9582 states, 9581 states have (on average 1.330654420206659) internal successors, (12749), 9581 states have internal predecessors, (12749), 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:16,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9582 states to 9582 states and 12749 transitions. [2022-01-10 15:52:16,021 INFO L78 Accepts]: Start accepts. Automaton has 9582 states and 12749 transitions. Word has length 292 [2022-01-10 15:52:16,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:16,022 INFO L470 AbstractCegarLoop]: Abstraction has 9582 states and 12749 transitions. [2022-01-10 15:52:16,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 35.166666666666664) internal successors, (211), 6 states have internal predecessors, (211), 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:16,022 INFO L276 IsEmpty]: Start isEmpty. Operand 9582 states and 12749 transitions. [2022-01-10 15:52:16,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2022-01-10 15:52:16,038 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:16,038 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:16,067 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:16,259 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,SelfDestructingSolverStorable20 [2022-01-10 15:52:16,260 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:16,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:16,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1077284439, now seen corresponding path program 2 times [2022-01-10 15:52:16,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:16,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673892053] [2022-01-10 15:52:16,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:16,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:16,380 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 407 proven. 5 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2022-01-10 15:52:16,381 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:16,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673892053] [2022-01-10 15:52:16,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673892053] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 15:52:16,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365397397] [2022-01-10 15:52:16,381 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 15:52:16,381 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 15:52:16,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 15:52:16,384 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:16,403 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:16,638 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 15:52:16,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 15:52:16,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 1275 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 15:52:16,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 15:52:16,999 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 811 trivial. 0 not checked. [2022-01-10 15:52:16,999 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 15:52:17,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365397397] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:17,000 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 15:52:17,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-10 15:52:17,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11140355] [2022-01-10 15:52:17,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:17,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:17,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:17,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:17,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 15:52:17,003 INFO L87 Difference]: Start difference. First operand 9582 states and 12749 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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:17,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:17,194 INFO L93 Difference]: Finished difference Result 18360 states and 24050 transitions. [2022-01-10 15:52:17,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:17,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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 305 [2022-01-10 15:52:17,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:17,212 INFO L225 Difference]: With dead ends: 18360 [2022-01-10 15:52:17,213 INFO L226 Difference]: Without dead ends: 8818 [2022-01-10 15:52:17,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 15:52:17,226 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 13 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:17,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 247 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:17,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8818 states. [2022-01-10 15:52:17,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8818 to 8770. [2022-01-10 15:52:17,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8770 states, 8769 states have (on average 1.284639069449196) internal successors, (11265), 8769 states have internal predecessors, (11265), 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:17,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8770 states to 8770 states and 11265 transitions. [2022-01-10 15:52:17,392 INFO L78 Accepts]: Start accepts. Automaton has 8770 states and 11265 transitions. Word has length 305 [2022-01-10 15:52:17,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:17,392 INFO L470 AbstractCegarLoop]: Abstraction has 8770 states and 11265 transitions. [2022-01-10 15:52:17,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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:17,393 INFO L276 IsEmpty]: Start isEmpty. Operand 8770 states and 11265 transitions. [2022-01-10 15:52:17,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2022-01-10 15:52:17,409 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:17,409 INFO L514 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 15:52:17,437 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:17,623 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,SelfDestructingSolverStorable21 [2022-01-10 15:52:17,623 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:17,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:17,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1093334706, now seen corresponding path program 1 times [2022-01-10 15:52:17,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:17,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085675927] [2022-01-10 15:52:17,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:17,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:17,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 954 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-01-10 15:52:17,726 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:17,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085675927] [2022-01-10 15:52:17,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085675927] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 15:52:17,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373990652] [2022-01-10 15:52:17,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:17,726 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 15:52:17,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 15:52:17,727 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:17,729 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:18,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:18,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 1534 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 15:52:18,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 15:52:18,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 954 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-01-10 15:52:18,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 15:52:19,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 954 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-01-10 15:52:19,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373990652] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 15:52:19,006 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 15:52:19,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-10 15:52:19,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891084603] [2022-01-10 15:52:19,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 15:52:19,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 15:52:19,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:19,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 15:52:19,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 15:52:19,008 INFO L87 Difference]: Start difference. First operand 8770 states and 11265 transitions. Second operand has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 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:19,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:19,369 INFO L93 Difference]: Finished difference Result 19748 states and 25247 transitions. [2022-01-10 15:52:19,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 15:52:19,370 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 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:19,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:19,390 INFO L225 Difference]: With dead ends: 19748 [2022-01-10 15:52:19,390 INFO L226 Difference]: Without dead ends: 11010 [2022-01-10 15:52:19,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 748 GetRequests, 743 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 15:52:19,404 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 329 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:19,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [329 Valid, 570 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 15:52:19,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11010 states. [2022-01-10 15:52:19,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11010 to 9573. [2022-01-10 15:52:19,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9573 states, 9572 states have (on average 1.282804011700794) internal successors, (12279), 9572 states have internal predecessors, (12279), 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:19,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9573 states to 9573 states and 12279 transitions. [2022-01-10 15:52:19,633 INFO L78 Accepts]: Start accepts. Automaton has 9573 states and 12279 transitions. Word has length 372 [2022-01-10 15:52:19,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:19,633 INFO L470 AbstractCegarLoop]: Abstraction has 9573 states and 12279 transitions. [2022-01-10 15:52:19,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 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:19,634 INFO L276 IsEmpty]: Start isEmpty. Operand 9573 states and 12279 transitions. [2022-01-10 15:52:19,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2022-01-10 15:52:19,653 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:19,653 INFO L514 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:52:19,682 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:19,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 15:52:19,879 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:19,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:19,879 INFO L85 PathProgramCache]: Analyzing trace with hash 272817591, now seen corresponding path program 1 times [2022-01-10 15:52:19,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:19,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694286704] [2022-01-10 15:52:19,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:19,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:19,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:19,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 884 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2022-01-10 15:52:19,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:19,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694286704] [2022-01-10 15:52:19,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694286704] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:52:19,976 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:52:19,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:52:19,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527361432] [2022-01-10 15:52:19,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:52:19,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:52:19,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:19,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:52:19,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:52:19,978 INFO L87 Difference]: Start difference. First operand 9573 states and 12279 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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:20,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:20,172 INFO L93 Difference]: Finished difference Result 17213 states and 21675 transitions. [2022-01-10 15:52:20,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:52:20,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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 411 [2022-01-10 15:52:20,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:20,179 INFO L225 Difference]: With dead ends: 17213 [2022-01-10 15:52:20,179 INFO L226 Difference]: Without dead ends: 3752 [2022-01-10 15:52:20,191 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:20,192 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 39 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:20,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 261 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 15:52:20,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3752 states. [2022-01-10 15:52:20,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3752 to 3558. [2022-01-10 15:52:20,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3558 states, 3557 states have (on average 1.2620185549620466) internal successors, (4489), 3557 states have internal predecessors, (4489), 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:20,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 4489 transitions. [2022-01-10 15:52:20,253 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 4489 transitions. Word has length 411 [2022-01-10 15:52:20,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:20,253 INFO L470 AbstractCegarLoop]: Abstraction has 3558 states and 4489 transitions. [2022-01-10 15:52:20,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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:20,253 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 4489 transitions. [2022-01-10 15:52:20,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2022-01-10 15:52:20,260 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:52:20,260 INFO L514 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-10 15:52:20,260 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:52:20,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:52:20,261 INFO L85 PathProgramCache]: Analyzing trace with hash 2006100480, now seen corresponding path program 1 times [2022-01-10 15:52:20,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:52:20,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527172150] [2022-01-10 15:52:20,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:20,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:52:20,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:20,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2022-01-10 15:52:20,374 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:52:20,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527172150] [2022-01-10 15:52:20,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527172150] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 15:52:20,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411127130] [2022-01-10 15:52:20,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:52:20,374 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 15:52:20,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 15:52:20,376 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 15:52:20,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 15:52:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:52:20,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 1735 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 15:52:20,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 15:52:21,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2022-01-10 15:52:21,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 15:52:21,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2022-01-10 15:52:21,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411127130] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 15:52:21,760 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 15:52:21,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-01-10 15:52:21,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273285066] [2022-01-10 15:52:21,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 15:52:21,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 15:52:21,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:52:21,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 15:52:21,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-10 15:52:21,764 INFO L87 Difference]: Start difference. First operand 3558 states and 4489 transitions. Second operand has 7 states, 7 states have (on average 43.285714285714285) internal successors, (303), 7 states have internal predecessors, (303), 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:21,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:52:21,978 INFO L93 Difference]: Finished difference Result 4000 states and 5049 transitions. [2022-01-10 15:52:21,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 15:52:21,979 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 43.285714285714285) internal successors, (303), 7 states have internal predecessors, (303), 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 442 [2022-01-10 15:52:21,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:52:21,979 INFO L225 Difference]: With dead ends: 4000 [2022-01-10 15:52:21,979 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 15:52:21,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 890 GetRequests, 883 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-10 15:52:21,982 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 100 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 15:52:21,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 514 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 15:52:21,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 15:52:21,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 15:52:21,983 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:21,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 15:52:21,983 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 442 [2022-01-10 15:52:21,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:52:21,983 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 15:52:21,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 43.285714285714285) internal successors, (303), 7 states have internal predecessors, (303), 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:21,984 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 15:52:21,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 15:52:21,986 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 15:52:22,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-10 15:52:22,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 15:52:22,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 15:52:25,565 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 15:52:25,565 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 15:52:25,565 INFO L858 garLoopResultBuilder]: For program point L94(lines 94 100) no Hoare annotation was computed. [2022-01-10 15:52:25,565 INFO L858 garLoopResultBuilder]: For program point L97-2(lines 94 100) no Hoare annotation was computed. [2022-01-10 15:52:25,565 INFO L858 garLoopResultBuilder]: For program point L97(lines 97 99) no Hoare annotation was computed. [2022-01-10 15:52:25,565 INFO L858 garLoopResultBuilder]: For program point L102(lines 102 106) no Hoare annotation was computed. [2022-01-10 15:52:25,565 INFO L858 garLoopResultBuilder]: For program point L103(lines 103 105) no Hoare annotation was computed. [2022-01-10 15:52:25,565 INFO L858 garLoopResultBuilder]: For program point L108-1(lines 86 556) no Hoare annotation was computed. [2022-01-10 15:52:25,565 INFO L861 garLoopResultBuilder]: At program point L545(lines 107 546) the Hoare annotation is: true [2022-01-10 15:52:25,565 INFO L858 garLoopResultBuilder]: For program point L109(line 109) no Hoare annotation was computed. [2022-01-10 15:52:25,565 INFO L858 garLoopResultBuilder]: For program point L550(lines 550 552) no Hoare annotation was computed. [2022-01-10 15:52:25,566 INFO L858 garLoopResultBuilder]: For program point L111(lines 111 525) no Hoare annotation was computed. [2022-01-10 15:52:25,566 INFO L858 garLoopResultBuilder]: For program point L550-2(lines 550 552) no Hoare annotation was computed. [2022-01-10 15:52:25,566 INFO L854 garLoopResultBuilder]: At program point L112(lines 111 525) the Hoare annotation is: (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) (<= 4560 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) [2022-01-10 15:52:25,566 INFO L858 garLoopResultBuilder]: For program point L114(lines 114 524) no Hoare annotation was computed. [2022-01-10 15:52:25,566 INFO L861 garLoopResultBuilder]: At program point L555(lines 22 557) the Hoare annotation is: true [2022-01-10 15:52:25,566 INFO L854 garLoopResultBuilder]: At program point L216(lines 114 524) the Hoare annotation is: (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) [2022-01-10 15:52:25,566 INFO L858 garLoopResultBuilder]: For program point L117(lines 117 523) no Hoare annotation was computed. [2022-01-10 15:52:25,566 INFO L861 garLoopResultBuilder]: At program point L566(lines 558 568) the Hoare annotation is: true [2022-01-10 15:52:25,566 INFO L858 garLoopResultBuilder]: For program point L221(lines 221 223) no Hoare annotation was computed. [2022-01-10 15:52:25,566 INFO L858 garLoopResultBuilder]: For program point L120(lines 120 522) no Hoare annotation was computed. [2022-01-10 15:52:25,566 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 15:52:25,566 INFO L858 garLoopResultBuilder]: For program point L221-2(lines 221 223) no Hoare annotation was computed. [2022-01-10 15:52:25,566 INFO L858 garLoopResultBuilder]: For program point L123(lines 123 521) no Hoare annotation was computed. [2022-01-10 15:52:25,566 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 15:52:25,566 INFO L858 garLoopResultBuilder]: For program point L226(lines 226 229) no Hoare annotation was computed. [2022-01-10 15:52:25,566 INFO L858 garLoopResultBuilder]: For program point L126(lines 126 520) no Hoare annotation was computed. [2022-01-10 15:52:25,567 INFO L858 garLoopResultBuilder]: For program point L232(lines 232 243) no Hoare annotation was computed. [2022-01-10 15:52:25,567 INFO L854 garLoopResultBuilder]: At program point L130(lines 126 520) the Hoare annotation is: (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) (not (<= 4400 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (<= 4352 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) [2022-01-10 15:52:25,567 INFO L858 garLoopResultBuilder]: For program point L129(lines 129 519) no Hoare annotation was computed. [2022-01-10 15:52:25,567 INFO L858 garLoopResultBuilder]: For program point L234(lines 234 237) no Hoare annotation was computed. [2022-01-10 15:52:25,567 INFO L858 garLoopResultBuilder]: For program point L232-2(lines 211 490) no Hoare annotation was computed. [2022-01-10 15:52:25,567 INFO L858 garLoopResultBuilder]: For program point L260(lines 260 262) no Hoare annotation was computed. [2022-01-10 15:52:25,567 INFO L858 garLoopResultBuilder]: For program point L132(lines 132 518) no Hoare annotation was computed. [2022-01-10 15:52:25,567 INFO L858 garLoopResultBuilder]: For program point L238(lines 238 241) no Hoare annotation was computed. [2022-01-10 15:52:25,567 INFO L858 garLoopResultBuilder]: For program point L248(lines 248 251) no Hoare annotation was computed. [2022-01-10 15:52:25,567 INFO L858 garLoopResultBuilder]: For program point L260-2(lines 211 490) no Hoare annotation was computed. [2022-01-10 15:52:25,567 INFO L854 garLoopResultBuilder]: At program point L136(lines 132 518) the Hoare annotation is: (and (not (<= 4400 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (<= 4352 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|) (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 1)) [2022-01-10 15:52:25,567 INFO L858 garLoopResultBuilder]: For program point L135(lines 135 517) no Hoare annotation was computed. [2022-01-10 15:52:25,568 INFO L854 garLoopResultBuilder]: At program point L491(lines 108 544) the Hoare annotation is: (let ((.cse1 (<= 4560 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse7 (<= 4560 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int|)) (.cse10 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 3)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse9 (= 4512 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse11 (= 4528 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4352)) (.cse5 (<= 4352 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4)) (.cse12 (= 4400 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse3 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 (= 4496 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (and .cse8 (= 4416 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|) .cse3) (and .cse8 .cse3 (= 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (and .cse3 .cse0 .cse6 .cse1 .cse7) (and .cse9 .cse2) (and (= 4384 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|) (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 1)) (and (= 4480 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|) .cse3) (and .cse6 .cse10) (and .cse8 .cse3 .cse10) (and .cse8 (< 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|) .cse3 .cse0) (and .cse3 .cse11) (and (= 4464 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|) .cse3) (and .cse3 .cse9) (and .cse12 .cse3 .cse2) (and .cse11 .cse2) (and (= 4368 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|) (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0)) (and (= 3 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int|) .cse4 .cse5 .cse2) (and .cse8 .cse12 .cse3 .cse6))) [2022-01-10 15:52:25,568 INFO L858 garLoopResultBuilder]: For program point L268(lines 268 270) no Hoare annotation was computed. [2022-01-10 15:52:25,568 INFO L858 garLoopResultBuilder]: For program point L275(lines 275 277) no Hoare annotation was computed. [2022-01-10 15:52:25,568 INFO L858 garLoopResultBuilder]: For program point L138(lines 138 516) no Hoare annotation was computed. [2022-01-10 15:52:25,568 INFO L858 garLoopResultBuilder]: For program point L527(lines 527 541) no Hoare annotation was computed. [2022-01-10 15:52:25,568 INFO L858 garLoopResultBuilder]: For program point L526(lines 526 542) no Hoare annotation was computed. [2022-01-10 15:52:25,568 INFO L858 garLoopResultBuilder]: For program point L275-2(lines 211 490) no Hoare annotation was computed. [2022-01-10 15:52:25,568 INFO L854 garLoopResultBuilder]: At program point L142(lines 138 516) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse2 (<= 4352 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) .cse0 .cse1 .cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560)))) [2022-01-10 15:52:25,568 INFO L858 garLoopResultBuilder]: For program point L141(lines 141 515) no Hoare annotation was computed. [2022-01-10 15:52:25,568 INFO L858 garLoopResultBuilder]: For program point L528(lines 528 533) no Hoare annotation was computed. [2022-01-10 15:52:25,568 INFO L858 garLoopResultBuilder]: For program point L281(lines 281 285) no Hoare annotation was computed. [2022-01-10 15:52:25,568 INFO L858 garLoopResultBuilder]: For program point L290-1(lines 290 300) no Hoare annotation was computed. [2022-01-10 15:52:25,568 INFO L858 garLoopResultBuilder]: For program point L294(lines 294 296) no Hoare annotation was computed. [2022-01-10 15:52:25,568 INFO L858 garLoopResultBuilder]: For program point L144(lines 144 514) no Hoare annotation was computed. [2022-01-10 15:52:25,569 INFO L858 garLoopResultBuilder]: For program point L530(lines 530 532) no Hoare annotation was computed. [2022-01-10 15:52:25,569 INFO L858 garLoopResultBuilder]: For program point L528-2(lines 527 541) no Hoare annotation was computed. [2022-01-10 15:52:25,569 INFO L858 garLoopResultBuilder]: For program point L281-2(lines 281 285) no Hoare annotation was computed. [2022-01-10 15:52:25,569 INFO L858 garLoopResultBuilder]: For program point L294-2(lines 292 300) no Hoare annotation was computed. [2022-01-10 15:52:25,569 INFO L854 garLoopResultBuilder]: At program point L148(lines 144 514) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560) (<= 4352 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) [2022-01-10 15:52:25,569 INFO L858 garLoopResultBuilder]: For program point L147(lines 147 513) no Hoare annotation was computed. [2022-01-10 15:52:25,569 INFO L858 garLoopResultBuilder]: For program point L535(lines 535 539) no Hoare annotation was computed. [2022-01-10 15:52:25,569 INFO L858 garLoopResultBuilder]: For program point L307(lines 307 309) no Hoare annotation was computed. [2022-01-10 15:52:25,569 INFO L858 garLoopResultBuilder]: For program point L150(lines 150 512) no Hoare annotation was computed. [2022-01-10 15:52:25,569 INFO L858 garLoopResultBuilder]: For program point L307-2(lines 211 490) no Hoare annotation was computed. [2022-01-10 15:52:25,569 INFO L854 garLoopResultBuilder]: At program point L154(lines 150 512) the Hoare annotation is: (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560) (<= 4352 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) [2022-01-10 15:52:25,569 INFO L858 garLoopResultBuilder]: For program point L153(lines 153 511) no Hoare annotation was computed. [2022-01-10 15:52:25,569 INFO L858 garLoopResultBuilder]: For program point L315(lines 315 318) no Hoare annotation was computed. [2022-01-10 15:52:25,569 INFO L858 garLoopResultBuilder]: For program point L323(lines 323 325) no Hoare annotation was computed. [2022-01-10 15:52:25,570 INFO L858 garLoopResultBuilder]: For program point L156(lines 156 510) no Hoare annotation was computed. [2022-01-10 15:52:25,570 INFO L854 garLoopResultBuilder]: At program point L324(lines 86 556) the Hoare annotation is: false [2022-01-10 15:52:25,570 INFO L858 garLoopResultBuilder]: For program point L326(lines 326 328) no Hoare annotation was computed. [2022-01-10 15:52:25,570 INFO L854 garLoopResultBuilder]: At program point L160(lines 156 510) the Hoare annotation is: (let ((.cse0 (< 4432 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) (.cse1 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560))) (or (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560)) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) .cse0 .cse1 .cse2))) [2022-01-10 15:52:25,570 INFO L858 garLoopResultBuilder]: For program point L159(lines 159 509) no Hoare annotation was computed. [2022-01-10 15:52:25,570 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 554) no Hoare annotation was computed. [2022-01-10 15:52:25,570 INFO L858 garLoopResultBuilder]: For program point L335(lines 335 337) no Hoare annotation was computed. [2022-01-10 15:52:25,570 INFO L858 garLoopResultBuilder]: For program point L162(lines 162 508) no Hoare annotation was computed. [2022-01-10 15:52:25,570 INFO L858 garLoopResultBuilder]: For program point L335-2(lines 211 490) no Hoare annotation was computed. [2022-01-10 15:52:25,570 INFO L854 garLoopResultBuilder]: At program point L172(lines 162 508) the Hoare annotation is: (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560) (<= 4464 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) [2022-01-10 15:52:25,570 INFO L858 garLoopResultBuilder]: For program point L165(lines 165 507) no Hoare annotation was computed. [2022-01-10 15:52:25,570 INFO L858 garLoopResultBuilder]: For program point L341(lines 341 345) no Hoare annotation was computed. [2022-01-10 15:52:25,570 INFO L858 garLoopResultBuilder]: For program point L353(lines 353 355) no Hoare annotation was computed. [2022-01-10 15:52:25,571 INFO L858 garLoopResultBuilder]: For program point L168(lines 168 506) no Hoare annotation was computed. [2022-01-10 15:52:25,571 INFO L858 garLoopResultBuilder]: For program point L341-2(lines 341 345) no Hoare annotation was computed. [2022-01-10 15:52:25,571 INFO L858 garLoopResultBuilder]: For program point L171(lines 171 505) no Hoare annotation was computed. [2022-01-10 15:52:25,571 INFO L858 garLoopResultBuilder]: For program point L174(lines 174 504) no Hoare annotation was computed. [2022-01-10 15:52:25,571 INFO L854 garLoopResultBuilder]: At program point L178(lines 174 504) the Hoare annotation is: (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560) (<= 4464 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) [2022-01-10 15:52:25,571 INFO L858 garLoopResultBuilder]: For program point L177(lines 177 503) no Hoare annotation was computed. [2022-01-10 15:52:25,571 INFO L858 garLoopResultBuilder]: For program point L362(lines 362 364) no Hoare annotation was computed. [2022-01-10 15:52:25,571 INFO L858 garLoopResultBuilder]: For program point L180(lines 180 502) no Hoare annotation was computed. [2022-01-10 15:52:25,571 INFO L858 garLoopResultBuilder]: For program point L366(lines 366 371) no Hoare annotation was computed. [2022-01-10 15:52:25,571 INFO L854 garLoopResultBuilder]: At program point L184(lines 180 502) the Hoare annotation is: (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0) (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560) (<= 4464 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|)) [2022-01-10 15:52:25,571 INFO L858 garLoopResultBuilder]: For program point L183(lines 183 501) no Hoare annotation was computed. [2022-01-10 15:52:25,571 INFO L858 garLoopResultBuilder]: For program point L366-2(lines 366 371) no Hoare annotation was computed. [2022-01-10 15:52:25,571 INFO L858 garLoopResultBuilder]: For program point L377(lines 377 379) no Hoare annotation was computed. [2022-01-10 15:52:25,571 INFO L858 garLoopResultBuilder]: For program point L186(lines 186 500) no Hoare annotation was computed. [2022-01-10 15:52:25,572 INFO L854 garLoopResultBuilder]: At program point L190(lines 186 500) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (<= 4464 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0) .cse0 .cse1))) [2022-01-10 15:52:25,572 INFO L858 garLoopResultBuilder]: For program point L189(lines 189 499) no Hoare annotation was computed. [2022-01-10 15:52:25,572 INFO L858 garLoopResultBuilder]: For program point L387(lines 387 389) no Hoare annotation was computed. [2022-01-10 15:52:25,572 INFO L858 garLoopResultBuilder]: For program point L192(lines 192 498) no Hoare annotation was computed. [2022-01-10 15:52:25,572 INFO L858 garLoopResultBuilder]: For program point L393(lines 393 397) no Hoare annotation was computed. [2022-01-10 15:52:25,572 INFO L854 garLoopResultBuilder]: At program point L196(lines 192 498) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (<= 4464 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0) .cse0 .cse1))) [2022-01-10 15:52:25,572 INFO L858 garLoopResultBuilder]: For program point L195(lines 195 497) no Hoare annotation was computed. [2022-01-10 15:52:25,572 INFO L858 garLoopResultBuilder]: For program point L393-2(lines 211 490) no Hoare annotation was computed. [2022-01-10 15:52:25,573 INFO L858 garLoopResultBuilder]: For program point L410(lines 410 412) no Hoare annotation was computed. [2022-01-10 15:52:25,573 INFO L858 garLoopResultBuilder]: For program point L198(lines 198 496) no Hoare annotation was computed. [2022-01-10 15:52:25,573 INFO L858 garLoopResultBuilder]: For program point L402(lines 402 405) no Hoare annotation was computed. [2022-01-10 15:52:25,573 INFO L858 garLoopResultBuilder]: For program point L417(lines 417 431) no Hoare annotation was computed. [2022-01-10 15:52:25,573 INFO L854 garLoopResultBuilder]: At program point L202(lines 198 496) the Hoare annotation is: (let ((.cse3 (< |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 12292)) (.cse2 (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4560)) (.cse1 (<= 4560 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)) (and (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 4) .cse2 .cse3 .cse1) (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 0) .cse3 .cse1) (and .cse2 .cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) .cse1))) [2022-01-10 15:52:25,573 INFO L858 garLoopResultBuilder]: For program point L201(lines 201 495) no Hoare annotation was computed. [2022-01-10 15:52:25,573 INFO L858 garLoopResultBuilder]: For program point L421(lines 421 427) no Hoare annotation was computed. [2022-01-10 15:52:25,573 INFO L858 garLoopResultBuilder]: For program point L417-1(lines 417 431) no Hoare annotation was computed. [2022-01-10 15:52:25,573 INFO L858 garLoopResultBuilder]: For program point L437(lines 437 439) no Hoare annotation was computed. [2022-01-10 15:52:25,573 INFO L858 garLoopResultBuilder]: For program point L204(lines 204 494) no Hoare annotation was computed. [2022-01-10 15:52:25,573 INFO L858 garLoopResultBuilder]: For program point L440(lines 440 444) no Hoare annotation was computed. [2022-01-10 15:52:25,573 INFO L854 garLoopResultBuilder]: At program point L205(lines 204 494) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int| 4352)) (.cse1 (<= 4352 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__state~0#1Int|))) (or (and (= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__hit~0#1Int| 0) .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int| 4560) (<= 4560 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int|)) (and (= 3 |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0#1Int|) .cse0 .cse1 (<= |ULTIMATE.start_ULTIMATE.start_ssl3_connect_~blastFlag~0#1Int| 2)))) [2022-01-10 15:52:25,573 INFO L858 garLoopResultBuilder]: For program point L207(lines 207 493) no Hoare annotation was computed. [2022-01-10 15:52:25,573 INFO L858 garLoopResultBuilder]: For program point L440-2(lines 440 444) no Hoare annotation was computed. [2022-01-10 15:52:25,573 INFO L858 garLoopResultBuilder]: For program point L450(lines 450 461) no Hoare annotation was computed. [2022-01-10 15:52:25,573 INFO L861 garLoopResultBuilder]: At program point L208(lines 207 493) the Hoare annotation is: true [2022-01-10 15:52:25,574 INFO L861 garLoopResultBuilder]: At program point L210(lines 209 493) the Hoare annotation is: true [2022-01-10 15:52:25,574 INFO L858 garLoopResultBuilder]: For program point L455(lines 455 458) no Hoare annotation was computed. [2022-01-10 15:52:25,574 INFO L858 garLoopResultBuilder]: For program point L450-2(lines 450 461) no Hoare annotation was computed. [2022-01-10 15:52:25,574 INFO L858 garLoopResultBuilder]: For program point L466-1(lines 466 468) no Hoare annotation was computed. [2022-01-10 15:52:25,574 INFO L858 garLoopResultBuilder]: For program point L472(lines 472 474) no Hoare annotation was computed. [2022-01-10 15:52:25,574 INFO L858 garLoopResultBuilder]: For program point L472-2(lines 472 474) no Hoare annotation was computed. [2022-01-10 15:52:25,574 INFO L858 garLoopResultBuilder]: For program point L478(lines 478 480) no Hoare annotation was computed. [2022-01-10 15:52:25,574 INFO L858 garLoopResultBuilder]: For program point L478-2(lines 478 480) no Hoare annotation was computed. [2022-01-10 15:52:25,574 INFO L858 garLoopResultBuilder]: For program point L483(lines 483 485) no Hoare annotation was computed. [2022-01-10 15:52:25,578 INFO L732 BasicCegarLoop]: Path program histogram: [2, 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:25,579 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 15:52:25,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 03:52:25 BasicIcfg [2022-01-10 15:52:25,627 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 15:52:25,627 INFO L158 Benchmark]: Toolchain (without parser) took 18999.77ms. Allocated memory was 201.3MB in the beginning and 561.0MB in the end (delta: 359.7MB). Free memory was 143.3MB in the beginning and 277.8MB in the end (delta: -134.4MB). Peak memory consumption was 323.8MB. Max. memory is 8.0GB. [2022-01-10 15:52:25,627 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 159.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 15:52:25,627 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.38ms. Allocated memory was 201.3MB in the beginning and 259.0MB in the end (delta: 57.7MB). Free memory was 143.1MB in the beginning and 226.1MB in the end (delta: -83.0MB). Peak memory consumption was 9.1MB. Max. memory is 8.0GB. [2022-01-10 15:52:25,628 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.76ms. Allocated memory is still 259.0MB. Free memory was 226.1MB in the beginning and 223.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 15:52:25,628 INFO L158 Benchmark]: Boogie Preprocessor took 35.61ms. Allocated memory is still 259.0MB. Free memory was 222.9MB in the beginning and 221.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 15:52:25,628 INFO L158 Benchmark]: RCFGBuilder took 571.90ms. Allocated memory is still 259.0MB. Free memory was 220.8MB in the beginning and 195.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-01-10 15:52:25,628 INFO L158 Benchmark]: IcfgTransformer took 213.33ms. Allocated memory is still 259.0MB. Free memory was 195.7MB in the beginning and 182.5MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-01-10 15:52:25,628 INFO L158 Benchmark]: TraceAbstraction took 17729.02ms. Allocated memory was 259.0MB in the beginning and 561.0MB in the end (delta: 302.0MB). Free memory was 182.0MB in the beginning and 277.8MB in the end (delta: -95.7MB). Peak memory consumption was 305.2MB. Max. memory is 8.0GB. [2022-01-10 15:52:25,629 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.12ms. Allocated memory is still 201.3MB. Free memory is still 159.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 394.38ms. Allocated memory was 201.3MB in the beginning and 259.0MB in the end (delta: 57.7MB). Free memory was 143.1MB in the beginning and 226.1MB in the end (delta: -83.0MB). Peak memory consumption was 9.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.76ms. Allocated memory is still 259.0MB. Free memory was 226.1MB in the beginning and 223.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.61ms. Allocated memory is still 259.0MB. Free memory was 222.9MB in the beginning and 221.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 571.90ms. Allocated memory is still 259.0MB. Free memory was 220.8MB in the beginning and 195.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * IcfgTransformer took 213.33ms. Allocated memory is still 259.0MB. Free memory was 195.7MB in the beginning and 182.5MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 17729.02ms. Allocated memory was 259.0MB in the beginning and 561.0MB in the end (delta: 302.0MB). Free memory was 182.0MB in the beginning and 277.8MB in the end (delta: -95.7MB). Peak memory consumption was 305.2MB. 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: 554]: 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, 127 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.6s, OverallIterations: 25, TraceHistogramMax: 18, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2012 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2012 mSDsluCounter, 7969 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3240 mSDsCounter, 521 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2877 IncrementalHoareTripleChecker+Invalid, 3398 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 521 mSolverCounterUnsat, 4729 mSDtfsCounter, 2877 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2599 GetRequests, 2557 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9582occurred in iteration=21, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 25 MinimizatonAttempts, 3801 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 259 NumberOfFragments, 462 HoareAnnotationTreeSize, 22 FomulaSimplifications, 10280 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 22 FomulaSimplificationsInter, 9426 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 6242 NumberOfCodeBlocks, 6242 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 7316 ConstructedInterpolants, 0 QuantifiedInterpolants, 10109 SizeOfPredicates, 3 NumberOfNonLiveVariables, 5743 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 32 InterpolantComputations, 22 PerfectInterpolantSequences, 24391/24507 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: 198]: Loop Invariant Derived loop invariant: ((((~bvule32(blastFlag, 2bv32) && ~bvule32(s__state, 4560bv32)) && ~bvule32(4560bv32, s__state)) || (((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4560bv32, s__state))) || ((blastFlag == 0bv32 && ~bvule32(4560bv32, s__state)) && ~bvult64(s__state, 12292bv32))) || (((0bv32 == s__hit && ~bvule32(blastFlag, 4bv32)) && ~bvule32(4560bv32, s__state)) && ~bvult64(s__state, 12292bv32)) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: blastFlag == 0bv32 && ~bvule32(4560bv32, s__state) - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: ((((((((((((((((((((~bvule32(blastFlag, 2bv32) && 0bv32 == s__hit) && s__state == 4400bv32) || (0bv32 == s__hit && 4528bv32 == s__state)) || ((~bvule32(blastFlag, 2bv32) && ~bvule32(s__state, 4560bv32)) && ~bvule32(4560bv32, s__state))) || (~bvule32(blastFlag, 2bv32) && 4528bv32 == s__state)) || (((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && 0bv32 == s__hit) && ~bvule32(blastFlag, 4bv32)) && s__state == 4400bv32)) || (~bvule32(blastFlag, 2bv32) && 4512bv32 == s__state)) || ((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(4352bv32, s__state)) && 0bv32 == s__hit) && ~bvule32(4560bv32, s__s3__tmp__next_state___0)) && ~bvule32(s__state, 4352bv32))) || (0bv32 == s__hit && s__state == 4496bv32)) || ((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvule32(4560bv32, s__s3__tmp__next_state___0)) && ~bvule32(4560bv32, s__state))) || (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(blastFlag, 4bv32)) && ~bvult64(4432bv32, s__state))) || (0bv32 == s__hit && 4464bv32 == s__state)) || ((0bv32 == s__hit && ~bvule32(blastFlag, 4bv32)) && 4432bv32 == s__state)) || ((0bv32 == s__hit && ~bvule32(s__state, 3bv32)) && ~bvule32(blastFlag, 4bv32))) || (0bv32 == s__hit && 4512bv32 == s__state)) || (~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 3bv32))) || (((~bvule32(blastFlag, 2bv32) && ~bvule32(4352bv32, s__state)) && 3bv32 == s__s3__tmp__next_state___0) && ~bvule32(s__state, 4352bv32))) || ((s__state == 4416bv32 && 0bv32 == s__hit) && ~bvule32(blastFlag, 4bv32))) || (blastFlag == 0bv32 && s__state == 4368bv32)) || (blastFlag == 1bv32 && s__state == 4384bv32)) || (0bv32 == s__hit && 4480bv32 == s__state) - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: blastFlag == 0bv32 - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: (((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && 0bv32 == s__hit) && ~bvult64(4432bv32, s__state)) || (((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(blastFlag, 4bv32)) && ~bvult64(4432bv32, s__state)) - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: ((~bvule32(s__state, 4560bv32) && ~bvule32(4352bv32, s__state)) && 0bv32 == s__hit) && ~bvule32(blastFlag, 4bv32) - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: (~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4464bv32, s__state) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: ((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(4352bv32, s__state)) && 0bv32 == s__hit) && ~bvule32(4560bv32, s__s3__tmp__next_state___0)) && ~bvule32(s__state, 4352bv32)) || (((~bvule32(blastFlag, 2bv32) && ~bvule32(4352bv32, s__state)) && 3bv32 == s__s3__tmp__next_state___0) && ~bvule32(s__state, 4352bv32)) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (blastFlag == 0bv32 && ~bvule32(4352bv32, s__state)) && !~bvule32(4400bv32, s__state) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 558]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((~bvule32(blastFlag, 2bv32) && ~bvule32(s__state, 4560bv32)) && ~bvule32(4464bv32, s__state)) || ((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4464bv32, s__state)) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4464bv32, s__state) - InvariantResult [Line: 144]: Loop Invariant Derived loop invariant: ((~bvule32(s__state, 4560bv32) && ~bvule32(4352bv32, s__state)) && 0bv32 == s__hit) && ~bvule32(blastFlag, 4bv32) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((~bvule32(blastFlag, 2bv32) && ~bvule32(s__state, 4560bv32)) && ~bvule32(4464bv32, s__state)) || ((~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4464bv32, s__state)) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (blastFlag == 1bv32 && ~bvule32(4352bv32, s__state)) && !~bvule32(4400bv32, s__state) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (((~bvule32(blastFlag, 2bv32) && ~bvule32(s__state, 4560bv32)) && ~bvule32(4352bv32, s__state)) && 0bv32 == s__hit) || ((((~bvule32(s__s3__tmp__next_state___0, 4560bv32) && ~bvule32(s__state, 4560bv32)) && ~bvule32(4352bv32, s__state)) && 0bv32 == s__hit) && ~bvule32(blastFlag, 4bv32)) - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (~bvule32(s__state, 4560bv32) && 0bv32 == s__hit) && ~bvule32(4464bv32, s__state) RESULT: Ultimate proved your program to be correct! [2022-01-10 15:52:25,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...