/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_SUM.epf -i ../../../trunk/examples/svcomp/seq-pthread/cs_lazy.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 06:50:14,745 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 06:50:14,747 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 06:50:14,813 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 06:50:14,814 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 06:50:14,815 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 06:50:14,816 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 06:50:14,818 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 06:50:14,819 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 06:50:14,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 06:50:14,822 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 06:50:14,826 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 06:50:14,826 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 06:50:14,833 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 06:50:14,835 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 06:50:14,839 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 06:50:14,840 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 06:50:14,841 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 06:50:14,842 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 06:50:14,843 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 06:50:14,844 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 06:50:14,846 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 06:50:14,848 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 06:50:14,849 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 06:50:14,855 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 06:50:14,855 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 06:50:14,856 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 06:50:14,857 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 06:50:14,858 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 06:50:14,859 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 06:50:14,859 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 06:50:14,859 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 06:50:14,861 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 06:50:14,861 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 06:50:14,863 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 06:50:14,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 06:50:14,863 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 06:50:14,863 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 06:50:14,864 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 06:50:14,864 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 06:50:14,865 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 06:50:14,866 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 06:50:14,887 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 06:50:14,887 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 06:50:14,887 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 06:50:14,887 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 06:50:14,888 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 06:50:14,888 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 06:50:14,889 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 06:50:14,889 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 06:50:14,889 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 06:50:14,889 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 06:50:14,889 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 06:50:14,889 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 06:50:14,889 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 06:50:14,889 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 06:50:14,890 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 06:50:14,890 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 06:50:14,890 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 06:50:14,890 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 06:50:14,890 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 06:50:14,890 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 06:50:14,890 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 06:50:14,890 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 06:50:14,891 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 06:50:14,891 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 06:50:14,891 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 06:50:14,891 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 06:50:14,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 06:50:14,891 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 06:50:14,891 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 06:50:14,891 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 06:50:14,891 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 06:50:14,892 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 06:50:14,892 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 06:50:14,892 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM 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-11 06:50:15,119 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 06:50:15,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 06:50:15,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 06:50:15,139 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 06:50:15,141 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 06:50:15,142 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-pthread/cs_lazy.i [2022-01-11 06:50:15,203 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4c58f293/f22334bf824b41f786b37c7630618b57/FLAG8bdf5544f [2022-01-11 06:50:15,585 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 06:50:15,586 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_lazy.i [2022-01-11 06:50:15,607 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4c58f293/f22334bf824b41f786b37c7630618b57/FLAG8bdf5544f [2022-01-11 06:50:15,934 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4c58f293/f22334bf824b41f786b37c7630618b57 [2022-01-11 06:50:15,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 06:50:15,937 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 06:50:15,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 06:50:15,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 06:50:15,942 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 06:50:15,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 06:50:15" (1/1) ... [2022-01-11 06:50:15,943 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4432b931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:50:15, skipping insertion in model container [2022-01-11 06:50:15,943 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 06:50:15" (1/1) ... [2022-01-11 06:50:15,949 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 06:50:15,990 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 06:50:16,226 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_lazy.i[23394,23407] [2022-01-11 06:50:16,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 06:50:16,351 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 06:50:16,395 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_lazy.i[23394,23407] [2022-01-11 06:50:16,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 06:50:16,494 INFO L208 MainTranslator]: Completed translation [2022-01-11 06:50:16,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:50:16 WrapperNode [2022-01-11 06:50:16,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 06:50:16,495 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 06:50:16,495 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 06:50:16,496 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 06:50:16,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:50:16" (1/1) ... [2022-01-11 06:50:16,534 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:50:16" (1/1) ... [2022-01-11 06:50:16,646 INFO L137 Inliner]: procedures = 149, calls = 212, calls flagged for inlining = 48, calls inlined = 171, statements flattened = 3129 [2022-01-11 06:50:16,647 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 06:50:16,648 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 06:50:16,648 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 06:50:16,648 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 06:50:16,655 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:50:16" (1/1) ... [2022-01-11 06:50:16,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:50:16" (1/1) ... [2022-01-11 06:50:16,693 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:50:16" (1/1) ... [2022-01-11 06:50:16,694 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:50:16" (1/1) ... [2022-01-11 06:50:16,783 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:50:16" (1/1) ... [2022-01-11 06:50:16,809 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:50:16" (1/1) ... [2022-01-11 06:50:16,817 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:50:16" (1/1) ... [2022-01-11 06:50:16,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 06:50:16,841 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 06:50:16,842 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 06:50:16,842 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 06:50:16,844 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:50:16" (1/1) ... [2022-01-11 06:50:16,852 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 06:50:16,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 06:50:16,881 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-11 06:50:16,891 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-11 06:50:16,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-01-11 06:50:16,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-11 06:50:16,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 06:50:16,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-11 06:50:16,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-11 06:50:16,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-11 06:50:16,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-01-11 06:50:16,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-11 06:50:16,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-11 06:50:16,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-11 06:50:16,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 06:50:16,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-01-11 06:50:16,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 06:50:16,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 06:50:17,102 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 06:50:17,104 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 06:50:17,129 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 06:50:17,130 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 06:50:17,164 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 06:50:17,164 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 06:50:17,182 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 06:50:17,182 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 06:50:17,200 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 06:50:17,200 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-11 06:50:23,600 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##686: assume !!~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);~__CS_round~0 := ~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1))[8:0]; [2022-01-11 06:50:23,601 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##685: assume !~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);assume false; [2022-01-11 06:50:23,601 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##693: assume !!~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);~__CS_round~0 := ~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1))[8:0]; [2022-01-11 06:50:23,601 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##692: assume !~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);assume false; [2022-01-11 06:50:23,601 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-11: assume { :end_inline___CS_cs } true; [2022-01-11 06:50:23,601 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-12: assume { :end_inline___CS_cs } true; [2022-01-11 06:50:23,601 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-13: assume { :end_inline___CS_cs } true; [2022-01-11 06:50:23,601 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-35: assume { :end_inline___CS_cs } true; [2022-01-11 06:50:23,601 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-36: assume { :end_inline___CS_cs } true; [2022-01-11 06:50:23,602 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-37: assume { :end_inline___CS_cs } true; [2022-01-11 06:50:23,602 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-59: assume { :end_inline___CS_cs } true; [2022-01-11 06:50:23,602 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-60: assume { :end_inline___CS_cs } true; [2022-01-11 06:50:23,602 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-61: assume { :end_inline___CS_cs } true; [2022-01-11 06:50:23,602 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-83: assume { :end_inline___CS_cs } true; [2022-01-11 06:50:23,602 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-84: assume { :end_inline___CS_cs } true; [2022-01-11 06:50:23,602 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-85: assume { :end_inline___CS_cs } true; [2022-01-11 06:50:23,602 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-33: assume !~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);assume false; [2022-01-11 06:50:23,602 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-33: assume !!~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32); [2022-01-11 06:50:23,602 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-35: ~__CS_round~0 := ~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1))[8:0]; [2022-01-11 06:50:23,603 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-33: assume 0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0);__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret_PREEMPTED~0); [2022-01-11 06:50:23,603 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-33: assume !(0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0));__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret~0); [2022-01-11 06:50:23,603 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-35: ~__CS_ret~0 := __CS_cs_#t~ite5#1[8:0];havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2022-01-11 06:50:23,603 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-36: assume 0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0);__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret_PREEMPTED~0); [2022-01-11 06:50:23,603 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-36: assume !(0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0));__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret~0); [2022-01-11 06:50:23,603 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-99: assume !~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);assume false; [2022-01-11 06:50:23,603 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-99: assume !!~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32); [2022-01-11 06:50:23,603 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-38: ~__CS_ret~0 := __CS_cs_#t~ite5#1[8:0];havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2022-01-11 06:50:23,604 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-39: assume 0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0);__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret_PREEMPTED~0); [2022-01-11 06:50:23,604 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-39: assume !(0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0));__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret~0); [2022-01-11 06:50:23,604 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-101: ~__CS_round~0 := ~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1))[8:0]; [2022-01-11 06:50:23,604 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-41: ~__CS_ret~0 := __CS_cs_#t~ite5#1[8:0];havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2022-01-11 06:50:23,604 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##421: assume !!~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);~__CS_round~0 := ~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1))[8:0]; [2022-01-11 06:50:23,604 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##420: assume !~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);assume false; [2022-01-11 06:50:23,604 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##427: assume !~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);assume false; [2022-01-11 06:50:23,604 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##428: assume !!~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);~__CS_round~0 := ~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1))[8:0]; [2022-01-11 06:50:23,605 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-165: assume !~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);assume false; [2022-01-11 06:50:23,605 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-165: assume !!~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32); [2022-01-11 06:50:23,605 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-105: assume 0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0);__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret_PREEMPTED~0); [2022-01-11 06:50:23,605 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-105: assume !(0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0));__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret~0); [2022-01-11 06:50:23,605 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-167: ~__CS_round~0 := ~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1))[8:0]; [2022-01-11 06:50:23,605 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-107: ~__CS_ret~0 := __CS_cs_#t~ite5#1[8:0];havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2022-01-11 06:50:23,605 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-108: assume 0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0);__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret_PREEMPTED~0); [2022-01-11 06:50:23,605 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-108: assume !(0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0));__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret~0); [2022-01-11 06:50:23,605 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-110: ~__CS_ret~0 := __CS_cs_#t~ite5#1[8:0];havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2022-01-11 06:50:23,606 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-111: assume 0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0);__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret_PREEMPTED~0); [2022-01-11 06:50:23,606 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-111: assume !(0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0));__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret~0); [2022-01-11 06:50:23,606 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-113: ~__CS_ret~0 := __CS_cs_#t~ite5#1[8:0];havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2022-01-11 06:50:23,606 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-231: assume !~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);assume false; [2022-01-11 06:50:23,606 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-231: assume !!~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32); [2022-01-11 06:50:23,606 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-233: ~__CS_round~0 := ~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1))[8:0]; [2022-01-11 06:50:23,606 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-177: assume 0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0);__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret_PREEMPTED~0); [2022-01-11 06:50:23,607 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-177: assume !(0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0));__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret~0); [2022-01-11 06:50:23,607 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-179: ~__CS_ret~0 := __CS_cs_#t~ite5#1[8:0];havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2022-01-11 06:50:23,607 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-180: assume 0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0);__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret_PREEMPTED~0); [2022-01-11 06:50:23,607 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-180: assume !(0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0));__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret~0); [2022-01-11 06:50:23,607 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-182: ~__CS_ret~0 := __CS_cs_#t~ite5#1[8:0];havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2022-01-11 06:50:23,607 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-183: assume 0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0);__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret_PREEMPTED~0); [2022-01-11 06:50:23,607 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-183: assume !(0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0));__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret~0); [2022-01-11 06:50:23,607 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-185: ~__CS_ret~0 := __CS_cs_#t~ite5#1[8:0];havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2022-01-11 06:50:23,607 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-249: assume 0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0);__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret_PREEMPTED~0); [2022-01-11 06:50:23,608 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-249: assume !(0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0));__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret~0); [2022-01-11 06:50:23,608 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-251: ~__CS_ret~0 := __CS_cs_#t~ite5#1[8:0];havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2022-01-11 06:50:23,608 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-252: assume 0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0);__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret_PREEMPTED~0); [2022-01-11 06:50:23,608 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-252: assume !(0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0));__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret~0); [2022-01-11 06:50:23,608 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-254: ~__CS_ret~0 := __CS_cs_#t~ite5#1[8:0];havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2022-01-11 06:50:23,608 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-255: assume 0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0);__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret_PREEMPTED~0); [2022-01-11 06:50:23,608 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-255: assume !(0bv32 != __CS_cs_#t~nondet4#1 && 1bv32 == ~zero_extendFrom8To32(~__CS_round~0));__CS_cs_#t~ite5#1 := ~zero_extendFrom8To32(~__CS_ret~0); [2022-01-11 06:50:23,608 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-257: ~__CS_ret~0 := __CS_cs_#t~ite5#1[8:0];havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2022-01-11 06:50:23,608 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L710: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);thread3_#res#1.base, thread3_#res#1.offset := 0bv64, 0bv64; [2022-01-11 06:50:23,609 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L710: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0)); [2022-01-11 06:50:23,609 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-2: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);thread3_#res#1.base, thread3_#res#1.offset := 0bv64, 0bv64; [2022-01-11 06:50:23,609 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-2: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0)); [2022-01-11 06:50:23,609 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-4: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);thread3_#res#1.base, thread3_#res#1.offset := 0bv64, 0bv64; [2022-01-11 06:50:23,610 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-4: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0)); [2022-01-11 06:50:23,610 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-6: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);thread3_#res#1.base, thread3_#res#1.offset := 0bv64, 0bv64; [2022-01-11 06:50:23,611 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-6: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0)); [2022-01-11 06:50:23,611 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L712: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);thread3_#res#1.base, thread3_#res#1.offset := 0bv64, 0bv64; [2022-01-11 06:50:23,611 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L712: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0));assume { :begin_inline___CS_cs } true;havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_#t~ite5#1, __CS_cs_~k~0#1;__CS_cs_~k~0#1 := __CS_cs_#t~nondet3#1;havoc __CS_cs_#t~nondet3#1; [2022-01-11 06:50:23,611 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L712-2: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);thread3_#res#1.base, thread3_#res#1.offset := 0bv64, 0bv64; [2022-01-11 06:50:23,611 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L712-2: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0));assume { :begin_inline___CS_cs } true;havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_#t~ite5#1, __CS_cs_~k~0#1;__CS_cs_~k~0#1 := __CS_cs_#t~nondet3#1;havoc __CS_cs_#t~nondet3#1; [2022-01-11 06:50:23,611 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L712-4: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);thread3_#res#1.base, thread3_#res#1.offset := 0bv64, 0bv64; [2022-01-11 06:50:23,611 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L712-4: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0));assume { :begin_inline___CS_cs } true;havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_#t~ite5#1, __CS_cs_~k~0#1;__CS_cs_~k~0#1 := __CS_cs_#t~nondet3#1;havoc __CS_cs_#t~nondet3#1; [2022-01-11 06:50:23,611 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L712-6: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);thread3_#res#1.base, thread3_#res#1.offset := 0bv64, 0bv64; [2022-01-11 06:50:23,611 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L712-6: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0));assume { :begin_inline___CS_cs } true;havoc __CS_cs_#t~nondet3#1, __CS_cs_#t~nondet4#1, __CS_cs_#t~ite5#1, __CS_cs_~k~0#1;__CS_cs_~k~0#1 := __CS_cs_#t~nondet3#1;havoc __CS_cs_#t~nondet3#1; [2022-01-11 06:50:23,612 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L714: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);thread3_#res#1.base, thread3_#res#1.offset := 0bv64, 0bv64; [2022-01-11 06:50:23,612 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L714: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0)); [2022-01-11 06:50:23,612 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-2: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);thread3_#res#1.base, thread3_#res#1.offset := 0bv64, 0bv64; [2022-01-11 06:50:23,612 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-2: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0)); [2022-01-11 06:50:23,612 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-4: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);thread3_#res#1.base, thread3_#res#1.offset := 0bv64, 0bv64; [2022-01-11 06:50:23,612 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-4: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0)); [2022-01-11 06:50:23,612 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-6: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);thread3_#res#1.base, thread3_#res#1.offset := 0bv64, 0bv64; [2022-01-11 06:50:23,613 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-6: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0)); [2022-01-11 06:50:23,613 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##951: assume !!~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);~__CS_round~0 := ~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1))[8:0]; [2022-01-11 06:50:23,613 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##950: assume !~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);assume false; [2022-01-11 06:50:23,613 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##958: assume !!~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);~__CS_round~0 := ~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1))[8:0]; [2022-01-11 06:50:23,613 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##957: assume !~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);assume false; [2022-01-11 06:50:23,613 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##155: assume !~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);assume false; [2022-01-11 06:50:23,613 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##156: assume !!~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);~__CS_round~0 := ~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1))[8:0]; [2022-01-11 06:50:23,614 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##162: assume !~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);assume false; [2022-01-11 06:50:23,615 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##163: assume !!~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);~__CS_round~0 := ~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1))[8:0]; [2022-01-11 06:50:23,617 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 06:50:23,635 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 06:50:23,638 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-11 06:50:23,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 06:50:23 BoogieIcfgContainer [2022-01-11 06:50:23,641 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 06:50:23,641 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 06:50:23,641 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 06:50:23,644 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 06:50:23,647 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 06:50:23" (1/1) ... [2022-01-11 06:50:24,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 06:50:24 BasicIcfg [2022-01-11 06:50:24,156 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 06:50:24,157 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 06:50:24,157 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 06:50:24,160 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 06:50:24,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 06:50:15" (1/4) ... [2022-01-11 06:50:24,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26dac7e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 06:50:24, skipping insertion in model container [2022-01-11 06:50:24,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 06:50:16" (2/4) ... [2022-01-11 06:50:24,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26dac7e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 06:50:24, skipping insertion in model container [2022-01-11 06:50:24,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 06:50:23" (3/4) ... [2022-01-11 06:50:24,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26dac7e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 06:50:24, skipping insertion in model container [2022-01-11 06:50:24,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 06:50:24" (4/4) ... [2022-01-11 06:50:24,162 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_lazy.iTransformedIcfg [2022-01-11 06:50:24,166 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 06:50:24,166 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 06:50:24,204 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 06:50:24,210 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-11 06:50:24,210 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 06:50:24,233 INFO L276 IsEmpty]: Start isEmpty. Operand has 771 states, 769 states have (on average 1.504551365409623) internal successors, (1157), 770 states have internal predecessors, (1157), 0 states have call successors, (0), 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-11 06:50:24,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-11 06:50:24,245 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:50:24,246 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:50:24,246 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:50:24,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:50:24,251 INFO L85 PathProgramCache]: Analyzing trace with hash -25123560, now seen corresponding path program 1 times [2022-01-11 06:50:24,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:50:24,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398228843] [2022-01-11 06:50:24,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:50:24,259 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:50:24,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:50:24,566 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-11 06:50:24,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:50:24,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398228843] [2022-01-11 06:50:24,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398228843] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:50:24,568 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:50:24,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 06:50:24,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083450701] [2022-01-11 06:50:24,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:50:24,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-11 06:50:24,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:50:24,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-11 06:50:24,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-11 06:50:24,613 INFO L87 Difference]: Start difference. First operand has 771 states, 769 states have (on average 1.504551365409623) internal successors, (1157), 770 states have internal predecessors, (1157), 0 states have call successors, (0), 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 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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-11 06:50:24,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:50:24,698 INFO L93 Difference]: Finished difference Result 1540 states and 2312 transitions. [2022-01-11 06:50:24,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-11 06:50:24,704 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2022-01-11 06:50:24,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:50:24,719 INFO L225 Difference]: With dead ends: 1540 [2022-01-11 06:50:24,719 INFO L226 Difference]: Without dead ends: 767 [2022-01-11 06:50:24,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-11 06:50:24,729 INFO L933 BasicCegarLoop]: 1048 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:50:24,729 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:50:24,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2022-01-11 06:50:24,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 767. [2022-01-11 06:50:24,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 766 states have (on average 1.3629242819843341) internal successors, (1044), 766 states have internal predecessors, (1044), 0 states have call successors, (0), 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-11 06:50:24,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1044 transitions. [2022-01-11 06:50:24,803 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1044 transitions. Word has length 34 [2022-01-11 06:50:24,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:50:24,804 INFO L470 AbstractCegarLoop]: Abstraction has 767 states and 1044 transitions. [2022-01-11 06:50:24,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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-11 06:50:24,804 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1044 transitions. [2022-01-11 06:50:24,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-11 06:50:24,806 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:50:24,807 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:50:24,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 06:50:24,807 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:50:24,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:50:24,808 INFO L85 PathProgramCache]: Analyzing trace with hash -496267283, now seen corresponding path program 1 times [2022-01-11 06:50:24,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:50:24,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930613136] [2022-01-11 06:50:24,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:50:24,809 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:50:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:50:25,452 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-11 06:50:25,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:50:25,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930613136] [2022-01-11 06:50:25,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930613136] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:50:25,454 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:50:25,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:50:25,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513125454] [2022-01-11 06:50:25,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:50:25,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 06:50:25,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:50:25,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 06:50:25,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 06:50:25,458 INFO L87 Difference]: Start difference. First operand 767 states and 1044 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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-11 06:50:25,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:50:25,695 INFO L93 Difference]: Finished difference Result 1404 states and 1908 transitions. [2022-01-11 06:50:25,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 06:50:25,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2022-01-11 06:50:25,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:50:25,703 INFO L225 Difference]: With dead ends: 1404 [2022-01-11 06:50:25,703 INFO L226 Difference]: Without dead ends: 1343 [2022-01-11 06:50:25,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 06:50:25,706 INFO L933 BasicCegarLoop]: 1330 mSDtfsCounter, 971 mSDsluCounter, 2158 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 3488 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 06:50:25,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [971 Valid, 3488 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-11 06:50:25,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2022-01-11 06:50:25,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1340. [2022-01-11 06:50:25,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1340 states, 1339 states have (on average 1.3539955190440627) internal successors, (1813), 1339 states have internal predecessors, (1813), 0 states have call successors, (0), 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-11 06:50:25,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1813 transitions. [2022-01-11 06:50:25,751 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1813 transitions. Word has length 34 [2022-01-11 06:50:25,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:50:25,752 INFO L470 AbstractCegarLoop]: Abstraction has 1340 states and 1813 transitions. [2022-01-11 06:50:25,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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-11 06:50:25,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1813 transitions. [2022-01-11 06:50:25,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-01-11 06:50:25,756 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:50:25,756 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:50:25,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 06:50:25,756 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:50:25,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:50:25,757 INFO L85 PathProgramCache]: Analyzing trace with hash -2138829916, now seen corresponding path program 1 times [2022-01-11 06:50:25,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:50:25,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857873471] [2022-01-11 06:50:25,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:50:25,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:50:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:50:26,322 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-11 06:50:26,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:50:26,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857873471] [2022-01-11 06:50:26,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857873471] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:50:26,323 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:50:26,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 06:50:26,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866451383] [2022-01-11 06:50:26,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:50:26,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 06:50:26,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:50:26,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 06:50:26,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 06:50:26,325 INFO L87 Difference]: Start difference. First operand 1340 states and 1813 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 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-11 06:50:27,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:50:27,553 INFO L93 Difference]: Finished difference Result 3721 states and 5015 transitions. [2022-01-11 06:50:27,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 06:50:27,556 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 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 62 [2022-01-11 06:50:27,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:50:27,567 INFO L225 Difference]: With dead ends: 3721 [2022-01-11 06:50:27,567 INFO L226 Difference]: Without dead ends: 2580 [2022-01-11 06:50:27,575 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-11 06:50:27,578 INFO L933 BasicCegarLoop]: 1080 mSDtfsCounter, 2370 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2370 SdHoareTripleChecker+Valid, 2397 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-11 06:50:27,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2370 Valid, 2397 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-11 06:50:27,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2022-01-11 06:50:27,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 1293. [2022-01-11 06:50:27,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1293 states, 1292 states have (on average 1.3544891640866874) internal successors, (1750), 1292 states have internal predecessors, (1750), 0 states have call successors, (0), 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-11 06:50:27,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 1750 transitions. [2022-01-11 06:50:27,641 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 1750 transitions. Word has length 62 [2022-01-11 06:50:27,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:50:27,641 INFO L470 AbstractCegarLoop]: Abstraction has 1293 states and 1750 transitions. [2022-01-11 06:50:27,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 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-11 06:50:27,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1750 transitions. [2022-01-11 06:50:27,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-01-11 06:50:27,645 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:50:27,645 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:50:27,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 06:50:27,646 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:50:27,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:50:27,646 INFO L85 PathProgramCache]: Analyzing trace with hash -444156981, now seen corresponding path program 1 times [2022-01-11 06:50:27,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:50:27,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555358736] [2022-01-11 06:50:27,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:50:27,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:50:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:50:28,014 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-11 06:50:28,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:50:28,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555358736] [2022-01-11 06:50:28,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555358736] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:50:28,015 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:50:28,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:50:28,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522303774] [2022-01-11 06:50:28,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:50:28,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 06:50:28,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:50:28,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 06:50:28,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 06:50:28,018 INFO L87 Difference]: Start difference. First operand 1293 states and 1750 transitions. Second operand has 4 states, 4 states have (on average 15.5) 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-11 06:50:30,035 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-11 06:50:31,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:50:31,774 INFO L93 Difference]: Finished difference Result 3407 states and 4590 transitions. [2022-01-11 06:50:31,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 06:50:31,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) 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 62 [2022-01-11 06:50:31,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:50:31,786 INFO L225 Difference]: With dead ends: 3407 [2022-01-11 06:50:31,787 INFO L226 Difference]: Without dead ends: 2603 [2022-01-11 06:50:31,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 06:50:31,798 INFO L933 BasicCegarLoop]: 1073 mSDtfsCounter, 1260 mSDsluCounter, 1919 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1260 SdHoareTripleChecker+Valid, 2992 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-01-11 06:50:31,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1260 Valid, 2992 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 1 Unknown, 0 Unchecked, 3.6s Time] [2022-01-11 06:50:31,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2603 states. [2022-01-11 06:50:31,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 1404. [2022-01-11 06:50:31,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1404 states, 1403 states have (on average 1.3592302209550962) internal successors, (1907), 1403 states have internal predecessors, (1907), 0 states have call successors, (0), 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-11 06:50:31,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 1907 transitions. [2022-01-11 06:50:31,851 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 1907 transitions. Word has length 62 [2022-01-11 06:50:31,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:50:31,852 INFO L470 AbstractCegarLoop]: Abstraction has 1404 states and 1907 transitions. [2022-01-11 06:50:31,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) 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-11 06:50:31,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1907 transitions. [2022-01-11 06:50:31,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-01-11 06:50:31,854 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:50:31,854 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:50:31,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 06:50:31,854 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:50:31,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:50:31,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1341211864, now seen corresponding path program 1 times [2022-01-11 06:50:31,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:50:31,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992037184] [2022-01-11 06:50:31,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:50:31,858 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:50:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:50:32,145 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-11 06:50:32,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:50:32,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992037184] [2022-01-11 06:50:32,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992037184] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:50:32,146 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:50:32,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:50:32,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997796890] [2022-01-11 06:50:32,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:50:32,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 06:50:32,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:50:32,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 06:50:32,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 06:50:32,148 INFO L87 Difference]: Start difference. First operand 1404 states and 1907 transitions. Second operand has 4 states, 4 states have (on average 15.5) 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-11 06:50:34,161 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-11 06:50:35,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:50:35,582 INFO L93 Difference]: Finished difference Result 2955 states and 3968 transitions. [2022-01-11 06:50:35,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 06:50:35,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) 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 62 [2022-01-11 06:50:35,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:50:35,595 INFO L225 Difference]: With dead ends: 2955 [2022-01-11 06:50:35,595 INFO L226 Difference]: Without dead ends: 2518 [2022-01-11 06:50:35,596 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 06:50:35,596 INFO L933 BasicCegarLoop]: 1071 mSDtfsCounter, 1201 mSDsluCounter, 1917 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1201 SdHoareTripleChecker+Valid, 2988 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-01-11 06:50:35,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1201 Valid, 2988 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2022-01-11 06:50:35,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2518 states. [2022-01-11 06:50:35,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2518 to 1694. [2022-01-11 06:50:35,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1694 states, 1693 states have (on average 1.362669816893089) internal successors, (2307), 1693 states have internal predecessors, (2307), 0 states have call successors, (0), 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-11 06:50:35,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 2307 transitions. [2022-01-11 06:50:35,650 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 2307 transitions. Word has length 62 [2022-01-11 06:50:35,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:50:35,652 INFO L470 AbstractCegarLoop]: Abstraction has 1694 states and 2307 transitions. [2022-01-11 06:50:35,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) 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-11 06:50:35,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 2307 transitions. [2022-01-11 06:50:35,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-01-11 06:50:35,655 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:50:35,656 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 06:50:35,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 06:50:35,656 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:50:35,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:50:35,657 INFO L85 PathProgramCache]: Analyzing trace with hash -221770809, now seen corresponding path program 1 times [2022-01-11 06:50:35,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:50:35,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660975350] [2022-01-11 06:50:35,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:50:35,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:50:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:50:35,971 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-11 06:50:35,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:50:35,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660975350] [2022-01-11 06:50:35,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660975350] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:50:35,972 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:50:35,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:50:35,973 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197162374] [2022-01-11 06:50:35,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:50:35,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 06:50:35,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:50:35,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 06:50:35,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 06:50:35,975 INFO L87 Difference]: Start difference. First operand 1694 states and 2307 transitions. Second operand has 4 states, 4 states have (on average 15.5) 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-11 06:50:37,986 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-11 06:50:39,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:50:39,294 INFO L93 Difference]: Finished difference Result 2524 states and 3390 transitions. [2022-01-11 06:50:39,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 06:50:39,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) 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 62 [2022-01-11 06:50:39,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:50:39,308 INFO L225 Difference]: With dead ends: 2524 [2022-01-11 06:50:39,308 INFO L226 Difference]: Without dead ends: 2428 [2022-01-11 06:50:39,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 06:50:39,310 INFO L933 BasicCegarLoop]: 1069 mSDtfsCounter, 1066 mSDsluCounter, 1838 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1066 SdHoareTripleChecker+Valid, 2907 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-01-11 06:50:39,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1066 Valid, 2907 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2022-01-11 06:50:39,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2428 states. [2022-01-11 06:50:39,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2428 to 1984. [2022-01-11 06:50:39,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1984 states, 1983 states have (on average 1.3645990922844176) internal successors, (2706), 1983 states have internal predecessors, (2706), 0 states have call successors, (0), 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-11 06:50:39,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1984 states to 1984 states and 2706 transitions. [2022-01-11 06:50:39,371 INFO L78 Accepts]: Start accepts. Automaton has 1984 states and 2706 transitions. Word has length 62 [2022-01-11 06:50:39,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:50:39,371 INFO L470 AbstractCegarLoop]: Abstraction has 1984 states and 2706 transitions. [2022-01-11 06:50:39,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) 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-11 06:50:39,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1984 states and 2706 transitions. [2022-01-11 06:50:39,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-11 06:50:39,375 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:50:39,375 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 06:50:39,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 06:50:39,376 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:50:39,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:50:39,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1734215574, now seen corresponding path program 1 times [2022-01-11 06:50:39,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:50:39,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38982976] [2022-01-11 06:50:39,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:50:39,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:50:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:50:39,792 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-11 06:50:39,793 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:50:39,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38982976] [2022-01-11 06:50:39,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38982976] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:50:39,793 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:50:39,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 06:50:39,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924192174] [2022-01-11 06:50:39,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:50:39,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 06:50:39,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:50:39,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 06:50:39,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 06:50:39,795 INFO L87 Difference]: Start difference. First operand 1984 states and 2706 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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-11 06:50:41,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:50:41,189 INFO L93 Difference]: Finished difference Result 3804 states and 5144 transitions. [2022-01-11 06:50:41,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 06:50:41,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2022-01-11 06:50:41,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:50:41,200 INFO L225 Difference]: With dead ends: 3804 [2022-01-11 06:50:41,200 INFO L226 Difference]: Without dead ends: 2319 [2022-01-11 06:50:41,202 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-11 06:50:41,203 INFO L933 BasicCegarLoop]: 1016 mSDtfsCounter, 2152 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2152 SdHoareTripleChecker+Valid, 2333 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-11 06:50:41,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2152 Valid, 2333 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-11 06:50:41,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2022-01-11 06:50:41,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 1946. [2022-01-11 06:50:41,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1946 states, 1945 states have (on average 1.365038560411311) internal successors, (2655), 1945 states have internal predecessors, (2655), 0 states have call successors, (0), 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-11 06:50:41,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2655 transitions. [2022-01-11 06:50:41,259 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2655 transitions. Word has length 69 [2022-01-11 06:50:41,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:50:41,259 INFO L470 AbstractCegarLoop]: Abstraction has 1946 states and 2655 transitions. [2022-01-11 06:50:41,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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-11 06:50:41,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2655 transitions. [2022-01-11 06:50:41,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-11 06:50:41,263 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:50:41,263 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 06:50:41,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 06:50:41,264 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:50:41,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:50:41,264 INFO L85 PathProgramCache]: Analyzing trace with hash 466381726, now seen corresponding path program 1 times [2022-01-11 06:50:41,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:50:41,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553116247] [2022-01-11 06:50:41,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:50:41,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:50:41,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:50:41,528 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-11 06:50:41,528 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:50:41,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553116247] [2022-01-11 06:50:41,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553116247] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:50:41,529 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:50:41,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 06:50:41,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168559245] [2022-01-11 06:50:41,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:50:41,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 06:50:41,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:50:41,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 06:50:41,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 06:50:41,530 INFO L87 Difference]: Start difference. First operand 1946 states and 2655 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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-11 06:50:43,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:50:43,874 INFO L93 Difference]: Finished difference Result 5022 states and 6714 transitions. [2022-01-11 06:50:43,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 06:50:43,874 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2022-01-11 06:50:43,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:50:43,885 INFO L225 Difference]: With dead ends: 5022 [2022-01-11 06:50:43,885 INFO L226 Difference]: Without dead ends: 3044 [2022-01-11 06:50:43,889 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-11 06:50:43,890 INFO L933 BasicCegarLoop]: 743 mSDtfsCounter, 1509 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 423 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1509 SdHoareTripleChecker+Valid, 1832 SdHoareTripleChecker+Invalid, 1456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 423 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-11 06:50:43,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1509 Valid, 1832 Invalid, 1456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [423 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-01-11 06:50:43,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3044 states. [2022-01-11 06:50:43,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3044 to 2528. [2022-01-11 06:50:43,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2528 states, 2527 states have (on average 1.2742382271468145) internal successors, (3220), 2527 states have internal predecessors, (3220), 0 states have call successors, (0), 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-11 06:50:43,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2528 states to 2528 states and 3220 transitions. [2022-01-11 06:50:43,966 INFO L78 Accepts]: Start accepts. Automaton has 2528 states and 3220 transitions. Word has length 69 [2022-01-11 06:50:43,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:50:43,966 INFO L470 AbstractCegarLoop]: Abstraction has 2528 states and 3220 transitions. [2022-01-11 06:50:43,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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-11 06:50:43,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2528 states and 3220 transitions. [2022-01-11 06:50:43,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-11 06:50:43,971 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:50:43,971 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 06:50:43,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 06:50:43,972 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:50:43,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:50:43,972 INFO L85 PathProgramCache]: Analyzing trace with hash 179181729, now seen corresponding path program 1 times [2022-01-11 06:50:43,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:50:43,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606422123] [2022-01-11 06:50:43,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:50:43,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:50:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:50:44,379 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-11 06:50:44,379 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:50:44,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606422123] [2022-01-11 06:50:44,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606422123] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:50:44,380 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:50:44,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 06:50:44,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220720104] [2022-01-11 06:50:44,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:50:44,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-11 06:50:44,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:50:44,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-11 06:50:44,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-11 06:50:44,381 INFO L87 Difference]: Start difference. First operand 2528 states and 3220 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 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-11 06:50:47,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:50:47,351 INFO L93 Difference]: Finished difference Result 5571 states and 7054 transitions. [2022-01-11 06:50:47,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-11 06:50:47,352 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2022-01-11 06:50:47,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:50:47,362 INFO L225 Difference]: With dead ends: 5571 [2022-01-11 06:50:47,362 INFO L226 Difference]: Without dead ends: 3189 [2022-01-11 06:50:47,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-01-11 06:50:47,367 INFO L933 BasicCegarLoop]: 795 mSDtfsCounter, 1359 mSDsluCounter, 1654 mSDsCounter, 0 mSdLazyCounter, 1480 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1359 SdHoareTripleChecker+Valid, 2449 SdHoareTripleChecker+Invalid, 1860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 1480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-01-11 06:50:47,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1359 Valid, 2449 Invalid, 1860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 1480 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-01-11 06:50:47,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3189 states. [2022-01-11 06:50:47,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3189 to 2772. [2022-01-11 06:50:47,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2772 states, 2771 states have (on average 1.270299530855287) internal successors, (3520), 2771 states have internal predecessors, (3520), 0 states have call successors, (0), 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-11 06:50:47,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2772 states to 2772 states and 3520 transitions. [2022-01-11 06:50:47,456 INFO L78 Accepts]: Start accepts. Automaton has 2772 states and 3520 transitions. Word has length 69 [2022-01-11 06:50:47,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:50:47,457 INFO L470 AbstractCegarLoop]: Abstraction has 2772 states and 3520 transitions. [2022-01-11 06:50:47,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 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-11 06:50:47,457 INFO L276 IsEmpty]: Start isEmpty. Operand 2772 states and 3520 transitions. [2022-01-11 06:50:47,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-11 06:50:47,462 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:50:47,462 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 06:50:47,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 06:50:47,462 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:50:47,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:50:47,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1465315903, now seen corresponding path program 1 times [2022-01-11 06:50:47,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:50:47,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207425463] [2022-01-11 06:50:47,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:50:47,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:50:47,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:50:47,811 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-11 06:50:47,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:50:47,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207425463] [2022-01-11 06:50:47,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207425463] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:50:47,811 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:50:47,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 06:50:47,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314686274] [2022-01-11 06:50:47,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:50:47,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 06:50:47,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:50:47,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 06:50:47,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 06:50:47,813 INFO L87 Difference]: Start difference. First operand 2772 states and 3520 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 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-11 06:50:49,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:50:49,165 INFO L93 Difference]: Finished difference Result 5253 states and 6629 transitions. [2022-01-11 06:50:49,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 06:50:49,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 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 70 [2022-01-11 06:50:49,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:50:49,181 INFO L225 Difference]: With dead ends: 5253 [2022-01-11 06:50:49,181 INFO L226 Difference]: Without dead ends: 3154 [2022-01-11 06:50:49,185 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 06:50:49,186 INFO L933 BasicCegarLoop]: 1000 mSDtfsCounter, 1582 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1582 SdHoareTripleChecker+Valid, 2317 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-11 06:50:49,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1582 Valid, 2317 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-11 06:50:49,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3154 states. [2022-01-11 06:50:49,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3154 to 2713. [2022-01-11 06:50:49,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2713 states, 2712 states have (on average 1.2710176991150441) internal successors, (3447), 2712 states have internal predecessors, (3447), 0 states have call successors, (0), 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-11 06:50:49,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2713 states to 2713 states and 3447 transitions. [2022-01-11 06:50:49,283 INFO L78 Accepts]: Start accepts. Automaton has 2713 states and 3447 transitions. Word has length 70 [2022-01-11 06:50:49,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:50:49,284 INFO L470 AbstractCegarLoop]: Abstraction has 2713 states and 3447 transitions. [2022-01-11 06:50:49,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 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-11 06:50:49,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2713 states and 3447 transitions. [2022-01-11 06:50:49,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-11 06:50:49,288 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:50:49,289 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 06:50:49,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 06:50:49,289 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:50:49,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:50:49,290 INFO L85 PathProgramCache]: Analyzing trace with hash -210681262, now seen corresponding path program 1 times [2022-01-11 06:50:49,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:50:49,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791039594] [2022-01-11 06:50:49,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:50:49,291 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:50:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:50:50,003 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-11 06:50:50,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:50:50,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791039594] [2022-01-11 06:50:50,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791039594] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:50:50,004 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:50:50,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:50:50,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174353262] [2022-01-11 06:50:50,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:50:50,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:50:50,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:50:50,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:50:50,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:50:50,005 INFO L87 Difference]: Start difference. First operand 2713 states and 3447 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-11 06:50:50,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:50:50,153 INFO L93 Difference]: Finished difference Result 5424 states and 6892 transitions. [2022-01-11 06:50:50,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:50:50,155 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 70 [2022-01-11 06:50:50,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:50:50,179 INFO L225 Difference]: With dead ends: 5424 [2022-01-11 06:50:50,179 INFO L226 Difference]: Without dead ends: 2718 [2022-01-11 06:50:50,183 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-11 06:50:50,184 INFO L933 BasicCegarLoop]: 903 mSDtfsCounter, 5 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1804 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:50:50,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 1804 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:50:50,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2718 states. [2022-01-11 06:50:50,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2718 to 2714. [2022-01-11 06:50:50,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2714 states, 2713 states have (on average 1.2709178031699226) internal successors, (3448), 2713 states have internal predecessors, (3448), 0 states have call successors, (0), 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-11 06:50:50,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 3448 transitions. [2022-01-11 06:50:50,273 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 3448 transitions. Word has length 70 [2022-01-11 06:50:50,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:50:50,274 INFO L470 AbstractCegarLoop]: Abstraction has 2714 states and 3448 transitions. [2022-01-11 06:50:50,274 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-11 06:50:50,274 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 3448 transitions. [2022-01-11 06:50:50,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-01-11 06:50:50,278 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:50:50,278 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 06:50:50,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 06:50:50,279 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:50:50,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:50:50,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1791385914, now seen corresponding path program 1 times [2022-01-11 06:50:50,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:50:50,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432576709] [2022-01-11 06:50:50,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:50:50,280 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:50:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:50:50,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 06:50:50,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:50:50,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432576709] [2022-01-11 06:50:50,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432576709] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:50:50,942 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:50:50,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:50:50,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137589056] [2022-01-11 06:50:50,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:50:50,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:50:50,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:50:50,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:50:50,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:50:50,943 INFO L87 Difference]: Start difference. First operand 2714 states and 3448 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:50:51,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:50:51,035 INFO L93 Difference]: Finished difference Result 5427 states and 6896 transitions. [2022-01-11 06:50:51,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:50:51,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-01-11 06:50:51,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:50:51,042 INFO L225 Difference]: With dead ends: 5427 [2022-01-11 06:50:51,042 INFO L226 Difference]: Without dead ends: 2716 [2022-01-11 06:50:51,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:50:51,047 INFO L933 BasicCegarLoop]: 905 mSDtfsCounter, 1 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1807 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 06:50:51,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 1807 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 06:50:51,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2022-01-11 06:50:51,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 2715. [2022-01-11 06:50:51,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2715 states, 2714 states have (on average 1.2708179808400883) internal successors, (3449), 2714 states have internal predecessors, (3449), 0 states have call successors, (0), 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-11 06:50:51,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2715 states to 2715 states and 3449 transitions. [2022-01-11 06:50:51,141 INFO L78 Accepts]: Start accepts. Automaton has 2715 states and 3449 transitions. Word has length 74 [2022-01-11 06:50:51,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:50:51,141 INFO L470 AbstractCegarLoop]: Abstraction has 2715 states and 3449 transitions. [2022-01-11 06:50:51,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:50:51,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2715 states and 3449 transitions. [2022-01-11 06:50:51,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-01-11 06:50:51,146 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:50:51,146 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 06:50:51,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 06:50:51,146 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:50:51,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:50:51,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1771860886, now seen corresponding path program 1 times [2022-01-11 06:50:51,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:50:51,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172744861] [2022-01-11 06:50:51,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:50:51,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:50:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:50:52,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 06:50:52,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:50:52,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172744861] [2022-01-11 06:50:52,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172744861] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:50:52,285 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:50:52,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 06:50:52,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481720323] [2022-01-11 06:50:52,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:50:52,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 06:50:52,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:50:52,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 06:50:52,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 06:50:52,286 INFO L87 Difference]: Start difference. First operand 2715 states and 3449 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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-11 06:50:54,509 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-11 06:50:56,640 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-11 06:50:58,833 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-11 06:51:01,379 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-11 06:51:03,544 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-11 06:51:04,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:51:04,177 INFO L93 Difference]: Finished difference Result 4570 states and 5794 transitions. [2022-01-11 06:51:04,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 06:51:04,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-01-11 06:51:04,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:51:04,181 INFO L225 Difference]: With dead ends: 4570 [2022-01-11 06:51:04,181 INFO L226 Difference]: Without dead ends: 2715 [2022-01-11 06:51:04,184 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-11 06:51:04,185 INFO L933 BasicCegarLoop]: 905 mSDtfsCounter, 0 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2022-01-11 06:51:04,185 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1672 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 5 Unknown, 0 Unchecked, 11.8s Time] [2022-01-11 06:51:04,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2715 states. [2022-01-11 06:51:04,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2715 to 2715. [2022-01-11 06:51:04,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2715 states, 2714 states have (on average 1.2704495210022109) internal successors, (3448), 2714 states have internal predecessors, (3448), 0 states have call successors, (0), 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-11 06:51:04,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2715 states to 2715 states and 3448 transitions. [2022-01-11 06:51:04,264 INFO L78 Accepts]: Start accepts. Automaton has 2715 states and 3448 transitions. Word has length 76 [2022-01-11 06:51:04,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:51:04,264 INFO L470 AbstractCegarLoop]: Abstraction has 2715 states and 3448 transitions. [2022-01-11 06:51:04,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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-11 06:51:04,265 INFO L276 IsEmpty]: Start isEmpty. Operand 2715 states and 3448 transitions. [2022-01-11 06:51:04,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-01-11 06:51:04,269 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:51:04,269 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 06:51:04,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 06:51:04,269 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:51:04,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:51:04,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1982339350, now seen corresponding path program 1 times [2022-01-11 06:51:04,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:51:04,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596906864] [2022-01-11 06:51:04,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:51:04,270 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:51:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:51:05,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 06:51:05,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:51:05,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596906864] [2022-01-11 06:51:05,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596906864] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 06:51:05,860 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 06:51:05,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 06:51:05,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141175991] [2022-01-11 06:51:05,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 06:51:05,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-11 06:51:05,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 06:51:05,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-11 06:51:05,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-11 06:51:05,861 INFO L87 Difference]: Start difference. First operand 2715 states and 3448 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:51:08,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 06:51:08,381 INFO L93 Difference]: Finished difference Result 5614 states and 7077 transitions. [2022-01-11 06:51:08,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 06:51:08,381 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2022-01-11 06:51:08,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 06:51:08,385 INFO L225 Difference]: With dead ends: 5614 [2022-01-11 06:51:08,385 INFO L226 Difference]: Without dead ends: 3231 [2022-01-11 06:51:08,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-01-11 06:51:08,389 INFO L933 BasicCegarLoop]: 643 mSDtfsCounter, 1996 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 1285 mSolverCounterSat, 492 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1996 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 1777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 492 IncrementalHoareTripleChecker+Valid, 1285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-01-11 06:51:08,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1996 Valid, 1788 Invalid, 1777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [492 Valid, 1285 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-01-11 06:51:08,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3231 states. [2022-01-11 06:51:08,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3231 to 3014. [2022-01-11 06:51:08,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3014 states, 3013 states have (on average 1.264852306671092) internal successors, (3811), 3013 states have internal predecessors, (3811), 0 states have call successors, (0), 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-11 06:51:08,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3014 states to 3014 states and 3811 transitions. [2022-01-11 06:51:08,493 INFO L78 Accepts]: Start accepts. Automaton has 3014 states and 3811 transitions. Word has length 87 [2022-01-11 06:51:08,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 06:51:08,494 INFO L470 AbstractCegarLoop]: Abstraction has 3014 states and 3811 transitions. [2022-01-11 06:51:08,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 06:51:08,494 INFO L276 IsEmpty]: Start isEmpty. Operand 3014 states and 3811 transitions. [2022-01-11 06:51:08,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-01-11 06:51:08,499 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 06:51:08,499 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 06:51:08,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 06:51:08,499 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 06:51:08,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 06:51:08,500 INFO L85 PathProgramCache]: Analyzing trace with hash -455575960, now seen corresponding path program 1 times [2022-01-11 06:51:08,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 06:51:08,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552399453] [2022-01-11 06:51:08,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:51:08,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 06:51:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 06:51:10,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 06:51:10,152 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 06:51:10,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552399453] [2022-01-11 06:51:10,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552399453] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 06:51:10,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472338301] [2022-01-11 06:51:10,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 06:51:10,153 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 06:51:10,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 06:51:10,159 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-11 06:51:10,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process