/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_BITWISE.epf -i ../../../trunk/examples/svcomp/seq-pthread/cs_stateful-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 13:22:59,733 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 13:22:59,734 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 13:22:59,776 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 13:22:59,777 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 13:22:59,777 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 13:22:59,778 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 13:22:59,780 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 13:22:59,781 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 13:22:59,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 13:22:59,782 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 13:22:59,783 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 13:22:59,784 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 13:22:59,784 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 13:22:59,785 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 13:22:59,786 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 13:22:59,787 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 13:22:59,787 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 13:22:59,789 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 13:22:59,790 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 13:22:59,797 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 13:22:59,801 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 13:22:59,802 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 13:22:59,803 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 13:22:59,805 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 13:22:59,805 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 13:22:59,806 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 13:22:59,806 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 13:22:59,807 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 13:22:59,807 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 13:22:59,807 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 13:22:59,808 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 13:22:59,809 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 13:22:59,809 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 13:22:59,810 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 13:22:59,810 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 13:22:59,811 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 13:22:59,814 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 13:22:59,815 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 13:22:59,815 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 13:22:59,816 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 13:22:59,820 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf [2022-01-10 13:22:59,853 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 13:22:59,854 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 13:22:59,854 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 13:22:59,854 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 13:22:59,855 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 13:22:59,857 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 13:22:59,857 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 13:22:59,857 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 13:22:59,858 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 13:22:59,858 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 13:22:59,858 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 13:22:59,859 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 13:22:59,859 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 13:22:59,859 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 13:22:59,859 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 13:22:59,859 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 13:22:59,859 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 13:22:59,859 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 13:22:59,859 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 13:22:59,860 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 13:22:59,860 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 13:22:59,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 13:22:59,860 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 13:22:59,860 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 13:22:59,860 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 13:22:59,861 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 13:22:59,861 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 13:22:59,861 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 13:22:59,861 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 13:22:59,861 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 13:22:59,861 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 13:22:59,861 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 13:22:59,863 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 13:22:59,863 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_BITWISE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 13:23:00,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 13:23:00,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 13:23:00,096 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 13:23:00,097 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 13:23:00,098 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 13:23:00,099 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-pthread/cs_stateful-1.i [2022-01-10 13:23:00,164 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1acc05e67/fbb2a4033a144ac3874c5c62fd357dce/FLAG8d7fe5535 [2022-01-10 13:23:00,565 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 13:23:00,566 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_stateful-1.i [2022-01-10 13:23:00,576 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1acc05e67/fbb2a4033a144ac3874c5c62fd357dce/FLAG8d7fe5535 [2022-01-10 13:23:00,902 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1acc05e67/fbb2a4033a144ac3874c5c62fd357dce [2022-01-10 13:23:00,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 13:23:00,905 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 13:23:00,906 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 13:23:00,906 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 13:23:00,909 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 13:23:00,910 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:23:00" (1/1) ... [2022-01-10 13:23:00,910 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14536b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:00, skipping insertion in model container [2022-01-10 13:23:00,911 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:23:00" (1/1) ... [2022-01-10 13:23:00,917 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 13:23:00,949 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 13:23:01,202 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_stateful-1.i[23400,23413] [2022-01-10 13:23:01,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 13:23:01,343 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 13:23:01,377 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_stateful-1.i[23400,23413] [2022-01-10 13:23:01,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 13:23:01,480 INFO L208 MainTranslator]: Completed translation [2022-01-10 13:23:01,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:01 WrapperNode [2022-01-10 13:23:01,480 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 13:23:01,481 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 13:23:01,481 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 13:23:01,482 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 13:23:01,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:01" (1/1) ... [2022-01-10 13:23:01,523 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:01" (1/1) ... [2022-01-10 13:23:01,613 INFO L137 Inliner]: procedures = 148, calls = 231, calls flagged for inlining = 51, calls inlined = 141, statements flattened = 2612 [2022-01-10 13:23:01,613 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 13:23:01,614 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 13:23:01,614 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 13:23:01,614 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 13:23:01,621 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:01" (1/1) ... [2022-01-10 13:23:01,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:01" (1/1) ... [2022-01-10 13:23:01,632 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:01" (1/1) ... [2022-01-10 13:23:01,633 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:01" (1/1) ... [2022-01-10 13:23:01,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:01" (1/1) ... [2022-01-10 13:23:01,723 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:01" (1/1) ... [2022-01-10 13:23:01,730 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:01" (1/1) ... [2022-01-10 13:23:01,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 13:23:01,742 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 13:23:01,742 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 13:23:01,742 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 13:23:01,743 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:01" (1/1) ... [2022-01-10 13:23:01,755 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 13:23:01,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 13:23:01,776 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 13:23:01,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 13:23:01,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-01-10 13:23:01,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 13:23:01,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 13:23:01,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 13:23:01,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 13:23:01,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 13:23:01,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-01-10 13:23:01,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 13:23:01,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 13:23:01,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-10 13:23:01,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 13:23:01,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-01-10 13:23:01,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 13:23:01,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 13:23:01,997 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 13:23:01,998 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 13:23:02,014 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 13:23:02,015 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 13:23:02,039 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 13:23:02,040 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 13:23:02,059 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 13:23:02,060 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 13:23:07,289 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##706: assume !~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);assume false; [2022-01-10 13:23:07,289 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##707: 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-10 13:23:07,289 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##713: assume !~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);assume false; [2022-01-10 13:23:07,290 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##714: 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-10 13:23:07,290 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-10: assume { :end_inline___CS_cs } true; [2022-01-10 13:23:07,290 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-11: assume { :end_inline___CS_cs } true; [2022-01-10 13:23:07,290 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-12: assume { :end_inline___CS_cs } true; [2022-01-10 13:23:07,290 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-38: assume { :end_inline___CS_cs } true; [2022-01-10 13:23:07,290 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-39: assume { :end_inline___CS_cs } true; [2022-01-10 13:23:07,290 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-40: assume { :end_inline___CS_cs } true; [2022-01-10 13:23:07,290 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-66: assume { :end_inline___CS_cs } true; [2022-01-10 13:23:07,290 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-67: assume { :end_inline___CS_cs } true; [2022-01-10 13:23:07,290 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-68: assume { :end_inline___CS_cs } true; [2022-01-10 13:23:07,291 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-30: assume !~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);assume false; [2022-01-10 13:23:07,291 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-30: assume !!~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32); [2022-01-10 13:23:07,291 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-32: ~__CS_round~0 := ~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1))[8:0]; [2022-01-10 13:23:07,291 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-30: 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-10 13:23:07,291 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-30: 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-10 13:23:07,291 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-32: ~__CS_ret~0 := __CS_cs_#t~ite5#1[8:0];havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2022-01-10 13:23:07,291 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-10 13:23:07,291 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-10 13:23:07,292 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-10 13:23:07,292 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-10 13:23:07,292 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-10 13:23:07,292 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-10 13:23:07,292 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-108: assume !~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);assume false; [2022-01-10 13:23:07,292 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-108: assume !!~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32); [2022-01-10 13:23:07,292 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-110: ~__CS_round~0 := ~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1))[8:0]; [2022-01-10 13:23:07,292 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##419: 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-10 13:23:07,293 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##418: assume !~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);assume false; [2022-01-10 13:23:07,293 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##426: 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-10 13:23:07,293 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##425: assume !~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);assume false; [2022-01-10 13:23:07,293 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-114: 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-10 13:23:07,293 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-114: 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-10 13:23:07,293 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-116: ~__CS_ret~0 := __CS_cs_#t~ite5#1[8:0];havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2022-01-10 13:23:07,293 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-117: 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-10 13:23:07,293 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-117: 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-10 13:23:07,293 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-119: ~__CS_ret~0 := __CS_cs_#t~ite5#1[8:0];havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2022-01-10 13:23:07,294 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-120: 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-10 13:23:07,294 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-120: 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-10 13:23:07,294 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-122: ~__CS_ret~0 := __CS_cs_#t~ite5#1[8:0];havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2022-01-10 13:23:07,294 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-186: assume !~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);assume false; [2022-01-10 13:23:07,294 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-186: assume !!~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32); [2022-01-10 13:23:07,294 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-188: ~__CS_round~0 := ~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1))[8:0]; [2022-01-10 13:23:07,294 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-198: 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-10 13:23:07,294 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-198: 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-10 13:23:07,295 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-200: ~__CS_ret~0 := __CS_cs_#t~ite5#1[8:0];havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2022-01-10 13:23:07,295 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-201: 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-10 13:23:07,295 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-201: 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-10 13:23:07,295 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-203: ~__CS_ret~0 := __CS_cs_#t~ite5#1[8:0];havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2022-01-10 13:23:07,295 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-204: 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-10 13:23:07,295 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-204: 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-10 13:23:07,295 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L563-206: ~__CS_ret~0 := __CS_cs_#t~ite5#1[8:0];havoc __CS_cs_#t~nondet4#1;havoc __CS_cs_#t~ite5#1; [2022-01-10 13:23:07,295 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L742: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);main_thread_#res#1.base, main_thread_#res#1.offset := 0bv64, 0bv64;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-01-10 13:23:07,295 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L742: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0)); [2022-01-10 13:23:07,296 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-2: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);main_thread_#res#1.base, main_thread_#res#1.offset := 0bv64, 0bv64;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-01-10 13:23:07,296 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-2: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0)); [2022-01-10 13:23:07,296 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-4: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);main_thread_#res#1.base, main_thread_#res#1.offset := 0bv64, 0bv64;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-01-10 13:23:07,296 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L742-4: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0)); [2022-01-10 13:23:07,296 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L744: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);main_thread_#res#1.base, main_thread_#res#1.offset := 0bv64, 0bv64;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-01-10 13:23:07,296 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L744: 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-10 13:23:07,296 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-2: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);main_thread_#res#1.base, main_thread_#res#1.offset := 0bv64, 0bv64;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-01-10 13:23:07,296 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-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-10 13:23:07,297 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-4: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);main_thread_#res#1.base, main_thread_#res#1.offset := 0bv64, 0bv64;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-01-10 13:23:07,297 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L744-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-10 13:23:07,297 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L746: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);main_thread_#res#1.base, main_thread_#res#1.offset := 0bv64, 0bv64;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-01-10 13:23:07,297 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L746: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0)); [2022-01-10 13:23:07,297 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-2: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);main_thread_#res#1.base, main_thread_#res#1.offset := 0bv64, 0bv64;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-01-10 13:23:07,297 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-2: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0)); [2022-01-10 13:23:07,297 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-4: assume 0bv32 != ~zero_extendFrom8To32(~__CS_ret~0);main_thread_#res#1.base, main_thread_#res#1.offset := 0bv64, 0bv64;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-01-10 13:23:07,297 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-4: assume !(0bv32 != ~zero_extendFrom8To32(~__CS_ret~0)); [2022-01-10 13:23:07,297 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##131: 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-10 13:23:07,298 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##130: assume !~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);assume false; [2022-01-10 13:23:07,298 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##137: assume !~bvslt32(~bvadd32(~zero_extendFrom8To32(~__CS_round~0), ~zero_extendFrom8To32(__CS_cs_~k~0#1)), 2bv32);assume false; [2022-01-10 13:23:07,298 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##138: 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-10 13:23:07,298 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 13:23:07,309 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 13:23:07,309 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-10 13:23:07,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:23:07 BoogieIcfgContainer [2022-01-10 13:23:07,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 13:23:07,312 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 13:23:07,312 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 13:23:07,313 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 13:23:07,315 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:23:07" (1/1) ... [2022-01-10 13:23:07,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 01:23:07 BasicIcfg [2022-01-10 13:23:07,741 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 13:23:07,743 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 13:23:07,743 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 13:23:07,745 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 13:23:07,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:23:00" (1/4) ... [2022-01-10 13:23:07,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e668e8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:23:07, skipping insertion in model container [2022-01-10 13:23:07,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:01" (2/4) ... [2022-01-10 13:23:07,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e668e8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:23:07, skipping insertion in model container [2022-01-10 13:23:07,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:23:07" (3/4) ... [2022-01-10 13:23:07,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e668e8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:23:07, skipping insertion in model container [2022-01-10 13:23:07,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 01:23:07" (4/4) ... [2022-01-10 13:23:07,750 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_stateful-1.iTransformedIcfg [2022-01-10 13:23:07,754 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 13:23:07,755 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 13:23:07,800 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 13:23:07,807 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 13:23:07,808 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 13:23:07,837 INFO L276 IsEmpty]: Start isEmpty. Operand has 647 states, 645 states have (on average 1.4945736434108527) internal successors, (964), 646 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:23:07,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 13:23:07,857 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:23:07,858 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] [2022-01-10 13:23:07,858 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:23:07,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:23:07,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1121678212, now seen corresponding path program 1 times [2022-01-10 13:23:07,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:23:07,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792793308] [2022-01-10 13:23:07,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:23:07,872 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:23:08,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:23:08,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 13:23:08,341 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:23:08,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792793308] [2022-01-10 13:23:08,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792793308] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:23:08,342 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:23:08,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:23:08,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050335251] [2022-01-10 13:23:08,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:23:08,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 13:23:08,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:23:08,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 13:23:08,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 13:23:08,370 INFO L87 Difference]: Start difference. First operand has 647 states, 645 states have (on average 1.4945736434108527) internal successors, (964), 646 states have internal predecessors, (964), 0 states have call successors, (0), 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 16.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:23:08,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:23:08,435 INFO L93 Difference]: Finished difference Result 1292 states and 1926 transitions. [2022-01-10 13:23:08,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 13:23:08,437 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2022-01-10 13:23:08,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:23:08,451 INFO L225 Difference]: With dead ends: 1292 [2022-01-10 13:23:08,451 INFO L226 Difference]: Without dead ends: 643 [2022-01-10 13:23:08,456 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-10 13:23:08,459 INFO L933 BasicCegarLoop]: 870 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, 870 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-10 13:23:08,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:23:08,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2022-01-10 13:23:08,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2022-01-10 13:23:08,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 642 states have (on average 1.3489096573208723) internal successors, (866), 642 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:23:08,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 866 transitions. [2022-01-10 13:23:08,557 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 866 transitions. Word has length 32 [2022-01-10 13:23:08,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:23:08,557 INFO L470 AbstractCegarLoop]: Abstraction has 643 states and 866 transitions. [2022-01-10 13:23:08,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:23:08,558 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 866 transitions. [2022-01-10 13:23:08,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 13:23:08,567 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:23:08,567 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] [2022-01-10 13:23:08,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 13:23:08,568 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:23:08,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:23:08,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1623012839, now seen corresponding path program 1 times [2022-01-10 13:23:08,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:23:08,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301650366] [2022-01-10 13:23:08,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:23:08,570 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:23:09,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:23:09,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 13:23:09,961 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:23:09,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301650366] [2022-01-10 13:23:09,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301650366] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:23:09,961 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:23:09,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 13:23:09,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10332159] [2022-01-10 13:23:09,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:23:09,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 13:23:09,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:23:09,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 13:23:09,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 13:23:09,966 INFO L87 Difference]: Start difference. First operand 643 states and 866 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:23:10,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:23:10,155 INFO L93 Difference]: Finished difference Result 1177 states and 1582 transitions. [2022-01-10 13:23:10,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 13:23:10,156 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2022-01-10 13:23:10,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:23:10,162 INFO L225 Difference]: With dead ends: 1177 [2022-01-10 13:23:10,162 INFO L226 Difference]: Without dead ends: 1126 [2022-01-10 13:23:10,163 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-10 13:23:10,181 INFO L933 BasicCegarLoop]: 1255 mSDtfsCounter, 808 mSDsluCounter, 1946 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 3201 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 13:23:10,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [808 Valid, 3201 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 13:23:10,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2022-01-10 13:23:10,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1123. [2022-01-10 13:23:10,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 1122 states have (on average 1.3333333333333333) internal successors, (1496), 1122 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:23:10,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1496 transitions. [2022-01-10 13:23:10,241 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1496 transitions. Word has length 32 [2022-01-10 13:23:10,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:23:10,241 INFO L470 AbstractCegarLoop]: Abstraction has 1123 states and 1496 transitions. [2022-01-10 13:23:10,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:23:10,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1496 transitions. [2022-01-10 13:23:10,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 13:23:10,247 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:23:10,247 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] [2022-01-10 13:23:10,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 13:23:10,247 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:23:10,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:23:10,248 INFO L85 PathProgramCache]: Analyzing trace with hash -299677721, now seen corresponding path program 1 times [2022-01-10 13:23:10,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:23:10,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291898157] [2022-01-10 13:23:10,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:23:10,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:23:10,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:23:11,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 13:23:11,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:23:11,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291898157] [2022-01-10 13:23:11,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291898157] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:23:11,225 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:23:11,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 13:23:11,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684004233] [2022-01-10 13:23:11,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:23:11,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 13:23:11,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:23:11,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 13:23:11,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 13:23:11,227 INFO L87 Difference]: Start difference. First operand 1123 states and 1496 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:23:11,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:23:11,866 INFO L93 Difference]: Finished difference Result 2927 states and 3872 transitions. [2022-01-10 13:23:11,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 13:23:11,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-01-10 13:23:11,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:23:11,873 INFO L225 Difference]: With dead ends: 2927 [2022-01-10 13:23:11,874 INFO L226 Difference]: Without dead ends: 2026 [2022-01-10 13:23:11,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-10 13:23:11,877 INFO L933 BasicCegarLoop]: 789 mSDtfsCounter, 1990 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1990 SdHoareTripleChecker+Valid, 1784 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 13:23:11,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1990 Valid, 1784 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 13:23:11,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2022-01-10 13:23:11,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 1039. [2022-01-10 13:23:11,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1039 states, 1038 states have (on average 1.3323699421965318) internal successors, (1383), 1038 states have internal predecessors, (1383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:23:11,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1383 transitions. [2022-01-10 13:23:11,932 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1383 transitions. Word has length 66 [2022-01-10 13:23:11,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:23:11,933 INFO L470 AbstractCegarLoop]: Abstraction has 1039 states and 1383 transitions. [2022-01-10 13:23:11,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:23:11,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1383 transitions. [2022-01-10 13:23:11,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 13:23:11,935 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:23:11,935 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] [2022-01-10 13:23:11,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 13:23:11,935 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:23:11,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:23:11,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1433079279, now seen corresponding path program 1 times [2022-01-10 13:23:11,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:23:11,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768658153] [2022-01-10 13:23:11,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:23:11,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:23:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:23:12,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 13:23:12,827 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:23:12,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768658153] [2022-01-10 13:23:12,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768658153] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:23:12,828 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:23:12,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 13:23:12,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166135456] [2022-01-10 13:23:12,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:23:12,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 13:23:12,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:23:12,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 13:23:12,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 13:23:12,829 INFO L87 Difference]: Start difference. First operand 1039 states and 1383 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:23:14,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:23:14,495 INFO L93 Difference]: Finished difference Result 2634 states and 3452 transitions. [2022-01-10 13:23:14,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 13:23:14,496 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-01-10 13:23:14,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:23:14,501 INFO L225 Difference]: With dead ends: 2634 [2022-01-10 13:23:14,501 INFO L226 Difference]: Without dead ends: 1522 [2022-01-10 13:23:14,503 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-10 13:23:14,508 INFO L933 BasicCegarLoop]: 587 mSDtfsCounter, 892 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 1442 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-10 13:23:14,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [892 Valid, 1442 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-10 13:23:14,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2022-01-10 13:23:14,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1438. [2022-01-10 13:23:14,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1438 states, 1437 states have (on average 1.2372999304105776) internal successors, (1778), 1437 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:23:14,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 1778 transitions. [2022-01-10 13:23:14,542 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 1778 transitions. Word has length 66 [2022-01-10 13:23:14,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:23:14,542 INFO L470 AbstractCegarLoop]: Abstraction has 1438 states and 1778 transitions. [2022-01-10 13:23:14,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:23:14,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 1778 transitions. [2022-01-10 13:23:14,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-10 13:23:14,546 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:23:14,546 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] [2022-01-10 13:23:14,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 13:23:14,547 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:23:14,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:23:14,547 INFO L85 PathProgramCache]: Analyzing trace with hash -43912082, now seen corresponding path program 1 times [2022-01-10 13:23:14,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:23:14,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565563206] [2022-01-10 13:23:14,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:23:14,548 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:23:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:23:15,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 13:23:15,280 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:23:15,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565563206] [2022-01-10 13:23:15,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565563206] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:23:15,280 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:23:15,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 13:23:15,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183404427] [2022-01-10 13:23:15,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:23:15,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 13:23:15,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:23:15,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 13:23:15,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 13:23:15,281 INFO L87 Difference]: Start difference. First operand 1438 states and 1778 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:23:15,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:23:15,818 INFO L93 Difference]: Finished difference Result 3878 states and 4773 transitions. [2022-01-10 13:23:15,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 13:23:15,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-01-10 13:23:15,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:23:15,827 INFO L225 Difference]: With dead ends: 3878 [2022-01-10 13:23:15,827 INFO L226 Difference]: Without dead ends: 2634 [2022-01-10 13:23:15,829 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-10 13:23:15,831 INFO L933 BasicCegarLoop]: 742 mSDtfsCounter, 1488 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 13:23:15,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1488 Valid, 1737 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 13:23:15,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2022-01-10 13:23:15,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 1308. [2022-01-10 13:23:15,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1308 states, 1307 states have (on average 1.2364192807957153) internal successors, (1616), 1307 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:23:15,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 1616 transitions. [2022-01-10 13:23:15,882 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 1616 transitions. Word has length 67 [2022-01-10 13:23:15,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:23:15,882 INFO L470 AbstractCegarLoop]: Abstraction has 1308 states and 1616 transitions. [2022-01-10 13:23:15,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:23:15,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1616 transitions. [2022-01-10 13:23:15,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-10 13:23:15,884 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:23:15,884 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] [2022-01-10 13:23:15,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 13:23:15,884 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:23:15,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:23:15,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1521224962, now seen corresponding path program 1 times [2022-01-10 13:23:15,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:23:15,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272460524] [2022-01-10 13:23:15,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:23:15,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:23:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:23:16,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 13:23:16,576 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:23:16,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272460524] [2022-01-10 13:23:16,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272460524] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:23:16,576 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:23:16,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 13:23:16,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373149020] [2022-01-10 13:23:16,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:23:16,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 13:23:16,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:23:16,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 13:23:16,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 13:23:16,578 INFO L87 Difference]: Start difference. First operand 1308 states and 1616 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:23:18,592 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-10 13:23:19,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:23:19,313 INFO L93 Difference]: Finished difference Result 3296 states and 4044 transitions. [2022-01-10 13:23:19,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 13:23:19,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-01-10 13:23:19,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:23:19,325 INFO L225 Difference]: With dead ends: 3296 [2022-01-10 13:23:19,325 INFO L226 Difference]: Without dead ends: 2623 [2022-01-10 13:23:19,328 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-10 13:23:19,330 INFO L933 BasicCegarLoop]: 709 mSDtfsCounter, 996 mSDsluCounter, 1386 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 996 SdHoareTripleChecker+Valid, 2095 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-01-10 13:23:19,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [996 Valid, 2095 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-01-10 13:23:19,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2022-01-10 13:23:19,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 1458. [2022-01-10 13:23:19,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1458 states, 1457 states have (on average 1.2436513383665064) internal successors, (1812), 1457 states have internal predecessors, (1812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:23:19,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 1812 transitions. [2022-01-10 13:23:19,395 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 1812 transitions. Word has length 67 [2022-01-10 13:23:19,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:23:19,396 INFO L470 AbstractCegarLoop]: Abstraction has 1458 states and 1812 transitions. [2022-01-10 13:23:19,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:23:19,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 1812 transitions. [2022-01-10 13:23:19,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-10 13:23:19,398 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:23:19,398 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] [2022-01-10 13:23:19,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 13:23:19,398 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:23:19,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:23:19,399 INFO L85 PathProgramCache]: Analyzing trace with hash -773938782, now seen corresponding path program 1 times [2022-01-10 13:23:19,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:23:19,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467082859] [2022-01-10 13:23:19,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:23:19,399 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:23:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:23:21,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 13:23:21,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:23:21,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467082859] [2022-01-10 13:23:21,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467082859] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:23:21,610 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:23:21,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 13:23:21,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980215952] [2022-01-10 13:23:21,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:23:21,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:23:21,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:23:21,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:23:21,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:23:21,612 INFO L87 Difference]: Start difference. First operand 1458 states and 1812 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:23:21,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:23:21,724 INFO L93 Difference]: Finished difference Result 2914 states and 3622 transitions. [2022-01-10 13:23:21,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:23:21,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-01-10 13:23:21,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:23:21,731 INFO L225 Difference]: With dead ends: 2914 [2022-01-10 13:23:21,731 INFO L226 Difference]: Without dead ends: 1463 [2022-01-10 13:23:21,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:23:21,735 INFO L933 BasicCegarLoop]: 717 mSDtfsCounter, 5 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1432 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.1s IncrementalHoareTripleChecker+Time [2022-01-10 13:23:21,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 1432 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 13:23:21,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2022-01-10 13:23:21,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1459. [2022-01-10 13:23:21,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1459 states, 1458 states have (on average 1.2434842249657065) internal successors, (1813), 1458 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-10 13:23:21,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 1813 transitions. [2022-01-10 13:23:21,780 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 1813 transitions. Word has length 67 [2022-01-10 13:23:21,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:23:21,780 INFO L470 AbstractCegarLoop]: Abstraction has 1459 states and 1813 transitions. [2022-01-10 13:23:21,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:23:21,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 1813 transitions. [2022-01-10 13:23:21,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-10 13:23:21,782 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:23:21,782 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] [2022-01-10 13:23:21,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 13:23:21,782 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:23:21,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:23:21,783 INFO L85 PathProgramCache]: Analyzing trace with hash 282684474, now seen corresponding path program 1 times [2022-01-10 13:23:21,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:23:21,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22081008] [2022-01-10 13:23:21,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:23:21,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:23:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:23:24,992 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-10 13:23:24,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:23:24,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22081008] [2022-01-10 13:23:24,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22081008] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:23:24,992 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:23:24,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 13:23:24,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550388035] [2022-01-10 13:23:24,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:23:24,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:23:24,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:23:24,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:23:24,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:23:24,993 INFO L87 Difference]: Start difference. First operand 1459 states and 1813 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:23:25,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:23:25,052 INFO L93 Difference]: Finished difference Result 2917 states and 3626 transitions. [2022-01-10 13:23:25,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:23:25,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2022-01-10 13:23:25,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:23:25,058 INFO L225 Difference]: With dead ends: 2917 [2022-01-10 13:23:25,058 INFO L226 Difference]: Without dead ends: 1461 [2022-01-10 13:23:25,060 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:23:25,060 INFO L933 BasicCegarLoop]: 719 mSDtfsCounter, 1 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1435 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-10 13:23:25,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 1435 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:23:25,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2022-01-10 13:23:25,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 1460. [2022-01-10 13:23:25,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1460 states, 1459 states have (on average 1.2433173406442768) internal successors, (1814), 1459 states have internal predecessors, (1814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:23:25,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 1814 transitions. [2022-01-10 13:23:25,101 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 1814 transitions. Word has length 71 [2022-01-10 13:23:25,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:23:25,101 INFO L470 AbstractCegarLoop]: Abstraction has 1460 states and 1814 transitions. [2022-01-10 13:23:25,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:23:25,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 1814 transitions. [2022-01-10 13:23:25,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-10 13:23:25,103 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:23:25,103 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] [2022-01-10 13:23:25,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 13:23:25,103 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:23:25,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:23:25,104 INFO L85 PathProgramCache]: Analyzing trace with hash -2045583458, now seen corresponding path program 1 times [2022-01-10 13:23:25,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:23:25,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864622461] [2022-01-10 13:23:25,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:23:25,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:23:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:23:29,004 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-10 13:23:29,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:23:29,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864622461] [2022-01-10 13:23:29,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864622461] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:23:29,005 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:23:29,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 13:23:29,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135771369] [2022-01-10 13:23:29,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:23:29,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 13:23:29,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:23:29,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 13:23:29,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-10 13:23:29,006 INFO L87 Difference]: Start difference. First operand 1460 states and 1814 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:23:30,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:23:30,677 INFO L93 Difference]: Finished difference Result 2832 states and 3487 transitions. [2022-01-10 13:23:30,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 13:23:30,677 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2022-01-10 13:23:30,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:23:30,683 INFO L225 Difference]: With dead ends: 2832 [2022-01-10 13:23:30,683 INFO L226 Difference]: Without dead ends: 1716 [2022-01-10 13:23:30,685 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-10 13:23:30,685 INFO L933 BasicCegarLoop]: 480 mSDtfsCounter, 828 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 1404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-10 13:23:30,686 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [828 Valid, 1425 Invalid, 1404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-10 13:23:30,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2022-01-10 13:23:30,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1592. [2022-01-10 13:23:30,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1592 states, 1591 states have (on average 1.2407291011942174) internal successors, (1974), 1591 states have internal predecessors, (1974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:23:30,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 1974 transitions. [2022-01-10 13:23:30,746 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 1974 transitions. Word has length 73 [2022-01-10 13:23:30,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:23:30,746 INFO L470 AbstractCegarLoop]: Abstraction has 1592 states and 1974 transitions. [2022-01-10 13:23:30,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:23:30,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 1974 transitions. [2022-01-10 13:23:30,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-10 13:23:30,748 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:23:30,748 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] [2022-01-10 13:23:30,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 13:23:30,749 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:23:30,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:23:30,749 INFO L85 PathProgramCache]: Analyzing trace with hash -2014563651, now seen corresponding path program 1 times [2022-01-10 13:23:30,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:23:30,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120184303] [2022-01-10 13:23:30,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:23:30,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:23:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:23:33,380 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-10 13:23:33,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:23:33,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120184303] [2022-01-10 13:23:33,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120184303] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 13:23:33,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083886898] [2022-01-10 13:23:33,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:23:33,381 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 13:23:33,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 13:23:33,387 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 13:23:33,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 13:23:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:23:34,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 2807 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-10 13:23:34,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 13:23:34,830 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-10 13:23:34,830 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 13:23:34,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083886898] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:23:34,830 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 13:23:34,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-01-10 13:23:34,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315643151] [2022-01-10 13:23:34,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:23:34,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 13:23:34,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:23:34,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 13:23:34,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 13:23:34,832 INFO L87 Difference]: Start difference. First operand 1592 states and 1974 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:23:35,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:23:35,138 INFO L93 Difference]: Finished difference Result 2490 states and 3066 transitions. [2022-01-10 13:23:35,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 13:23:35,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2022-01-10 13:23:35,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:23:35,143 INFO L225 Difference]: With dead ends: 2490 [2022-01-10 13:23:35,143 INFO L226 Difference]: Without dead ends: 1592 [2022-01-10 13:23:35,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 13:23:35,145 INFO L933 BasicCegarLoop]: 638 mSDtfsCounter, 710 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 13:23:35,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [710 Valid, 1273 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 13:23:35,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2022-01-10 13:23:35,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1592. [2022-01-10 13:23:35,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1592 states, 1591 states have (on average 1.240100565681961) internal successors, (1973), 1591 states have internal predecessors, (1973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:23:35,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 1973 transitions. [2022-01-10 13:23:35,214 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 1973 transitions. Word has length 73 [2022-01-10 13:23:35,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:23:35,214 INFO L470 AbstractCegarLoop]: Abstraction has 1592 states and 1973 transitions. [2022-01-10 13:23:35,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 13:23:35,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 1973 transitions. [2022-01-10 13:23:35,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-10 13:23:35,216 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:23:35,216 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] [2022-01-10 13:23:35,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 13:23:35,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-10 13:23:35,444 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:23:35,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:23:35,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1734767477, now seen corresponding path program 1 times [2022-01-10 13:23:35,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:23:35,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774980993] [2022-01-10 13:23:35,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:23:35,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:23:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:23:38,165 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-10 13:23:38,165 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:23:38,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774980993] [2022-01-10 13:23:38,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774980993] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 13:23:38,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396792712] [2022-01-10 13:23:38,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:23:38,166 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 13:23:38,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 13:23:38,167 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 13:23:38,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process