/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_NONE.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 21:41:53,024 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 21:41:53,026 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 21:41:53,057 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 21:41:53,058 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 21:41:53,058 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 21:41:53,059 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 21:41:53,060 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 21:41:53,062 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 21:41:53,062 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 21:41:53,063 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 21:41:53,082 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 21:41:53,082 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 21:41:53,083 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 21:41:53,084 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 21:41:53,084 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 21:41:53,085 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 21:41:53,085 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 21:41:53,086 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 21:41:53,087 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 21:41:53,088 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 21:41:53,091 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 21:41:53,092 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 21:41:53,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 21:41:53,094 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 21:41:53,094 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 21:41:53,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 21:41:53,095 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 21:41:53,095 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 21:41:53,096 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 21:41:53,096 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 21:41:53,097 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 21:41:53,097 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 21:41:53,098 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 21:41:53,098 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 21:41:53,098 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 21:41:53,099 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 21:41:53,099 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 21:41:53,099 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 21:41:53,100 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 21:41:53,100 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 21:41:53,102 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-10 21:41:53,117 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 21:41:53,118 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 21:41:53,118 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 21:41:53,118 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 21:41:53,119 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 21:41:53,119 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 21:41:53,119 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 21:41:53,119 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 21:41:53,119 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 21:41:53,119 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 21:41:53,119 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 21:41:53,119 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 21:41:53,119 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 21:41:53,119 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 21:41:53,119 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 21:41:53,120 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 21:41:53,120 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 21:41:53,120 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 21:41:53,120 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 21:41:53,120 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 21:41:53,120 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 21:41:53,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 21:41:53,120 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 21:41:53,120 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 21:41:53,120 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 21:41:53,120 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 21:41:53,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 21:41:53,121 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 21:41:53,121 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 21:41:53,121 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 21:41:53,121 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 21:41:53,121 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 21:41:53,121 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 21:41:53,122 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE 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 21:41:53,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 21:41:53,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 21:41:53,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 21:41:53,324 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 21:41:53,325 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 21:41:53,326 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2022-01-10 21:41:53,386 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d964cfa5c/438435af69f74bd4b7c742d21fb7baff/FLAGbf63ea63b [2022-01-10 21:41:53,735 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 21:41:53,735 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2022-01-10 21:41:53,763 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d964cfa5c/438435af69f74bd4b7c742d21fb7baff/FLAGbf63ea63b [2022-01-10 21:41:54,141 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d964cfa5c/438435af69f74bd4b7c742d21fb7baff [2022-01-10 21:41:54,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 21:41:54,143 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 21:41:54,147 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 21:41:54,147 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 21:41:54,149 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 21:41:54,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 09:41:54" (1/1) ... [2022-01-10 21:41:54,151 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2913dfa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:41:54, skipping insertion in model container [2022-01-10 21:41:54,151 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 09:41:54" (1/1) ... [2022-01-10 21:41:54,155 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 21:41:54,180 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 21:41:54,443 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c[29656,29669] [2022-01-10 21:41:54,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 21:41:54,454 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 21:41:54,520 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c[29656,29669] [2022-01-10 21:41:54,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 21:41:54,533 INFO L208 MainTranslator]: Completed translation [2022-01-10 21:41:54,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:41:54 WrapperNode [2022-01-10 21:41:54,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 21:41:54,534 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 21:41:54,535 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 21:41:54,535 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 21:41:54,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:41:54" (1/1) ... [2022-01-10 21:41:54,562 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:41:54" (1/1) ... [2022-01-10 21:41:54,609 INFO L137 Inliner]: procedures = 29, calls = 44, calls flagged for inlining = 39, calls inlined = 77, statements flattened = 1380 [2022-01-10 21:41:54,610 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 21:41:54,611 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 21:41:54,611 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 21:41:54,611 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 21:41:54,616 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:41:54" (1/1) ... [2022-01-10 21:41:54,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:41:54" (1/1) ... [2022-01-10 21:41:54,631 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:41:54" (1/1) ... [2022-01-10 21:41:54,632 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:41:54" (1/1) ... [2022-01-10 21:41:54,647 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:41:54" (1/1) ... [2022-01-10 21:41:54,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:41:54" (1/1) ... [2022-01-10 21:41:54,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:41:54" (1/1) ... [2022-01-10 21:41:54,666 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 21:41:54,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 21:41:54,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 21:41:54,667 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 21:41:54,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:41:54" (1/1) ... [2022-01-10 21:41:54,689 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 21:41:54,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 21:41:54,715 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 21:41:54,717 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 21:41:54,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 21:41:54,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 21:41:54,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 21:41:54,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 21:41:54,898 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 21:41:54,899 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 21:41:54,905 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:54,909 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:54,920 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:54,925 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:54,929 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:54,948 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:54,952 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:54,956 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:54,960 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:54,963 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:54,966 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:54,979 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-10 21:41:55,536 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2022-01-10 21:41:55,537 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2022-01-10 21:41:55,537 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##279: assume false; [2022-01-10 21:41:55,537 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##280: assume !false; [2022-01-10 21:41:55,538 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##219: assume false; [2022-01-10 21:41:55,538 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##220: assume !false; [2022-01-10 21:41:55,538 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##302: assume !false; [2022-01-10 21:41:55,538 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##301: assume false; [2022-01-10 21:41:55,538 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##322: assume !false; [2022-01-10 21:41:55,538 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##321: assume false; [2022-01-10 21:41:55,538 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-01-10 21:41:55,538 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-01-10 21:41:55,539 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##191: assume false; [2022-01-10 21:41:55,539 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##192: assume !false; [2022-01-10 21:41:55,539 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume !false; [2022-01-10 21:41:55,539 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##45: assume false; [2022-01-10 21:41:55,539 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##140: assume false; [2022-01-10 21:41:55,539 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##141: assume !false; [2022-01-10 21:41:55,539 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##389: assume !false; [2022-01-10 21:41:55,539 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##388: assume false; [2022-01-10 21:41:55,539 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-01-10 21:41:55,539 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-01-10 21:41:55,539 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##162: assume !false; [2022-01-10 21:41:55,540 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##161: assume false; [2022-01-10 21:41:55,540 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 21:41:55,551 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 21:41:55,552 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-10 21:41:55,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:41:55 BoogieIcfgContainer [2022-01-10 21:41:55,554 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 21:41:55,554 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 21:41:55,554 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 21:41:55,555 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 21:41:55,557 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:41:55" (1/1) ... [2022-01-10 21:41:55,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 09:41:55 BasicIcfg [2022-01-10 21:41:55,727 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 21:41:55,728 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 21:41:55,728 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 21:41:55,730 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 21:41:55,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 09:41:54" (1/4) ... [2022-01-10 21:41:55,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b268a16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 09:41:55, skipping insertion in model container [2022-01-10 21:41:55,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:41:54" (2/4) ... [2022-01-10 21:41:55,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b268a16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 09:41:55, skipping insertion in model container [2022-01-10 21:41:55,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:41:55" (3/4) ... [2022-01-10 21:41:55,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b268a16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 09:41:55, skipping insertion in model container [2022-01-10 21:41:55,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 09:41:55" (4/4) ... [2022-01-10 21:41:55,731 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-2.cTransformedIcfg [2022-01-10 21:41:55,735 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 21:41:55,735 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-01-10 21:41:55,773 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 21:41:55,777 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 21:41:55,778 INFO L340 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2022-01-10 21:41:55,791 INFO L276 IsEmpty]: Start isEmpty. Operand has 371 states, 340 states have (on average 1.5676470588235294) internal successors, (533), 370 states have internal predecessors, (533), 0 states have call successors, (0), 0 states 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 21:41:55,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-10 21:41:55,795 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:55,795 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:55,795 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 21:41:55,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:55,799 INFO L85 PathProgramCache]: Analyzing trace with hash -112579135, now seen corresponding path program 1 times [2022-01-10 21:41:55,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:55,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745042983] [2022-01-10 21:41:55,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:55,805 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:55,943 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 21:41:55,943 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:55,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745042983] [2022-01-10 21:41:55,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745042983] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:55,944 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:55,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:55,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653135605] [2022-01-10 21:41:55,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:55,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:55,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:55,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:55,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:55,967 INFO L87 Difference]: Start difference. First operand has 371 states, 340 states have (on average 1.5676470588235294) internal successors, (533), 370 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states 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 21:41:56,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:56,255 INFO L93 Difference]: Finished difference Result 634 states and 903 transitions. [2022-01-10 21:41:56,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:56,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-01-10 21:41:56,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:56,265 INFO L225 Difference]: With dead ends: 634 [2022-01-10 21:41:56,265 INFO L226 Difference]: Without dead ends: 335 [2022-01-10 21:41:56,267 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 21:41:56,269 INFO L933 BasicCegarLoop]: 465 mSDtfsCounter, 8 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:56,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 809 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 21:41:56,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-01-10 21:41:56,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2022-01-10 21:41:56,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 305 states have (on average 1.4852459016393442) internal successors, (453), 334 states have internal predecessors, (453), 0 states have call successors, (0), 0 states 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 21:41:56,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 453 transitions. [2022-01-10 21:41:56,312 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 453 transitions. Word has length 12 [2022-01-10 21:41:56,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:56,313 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 453 transitions. [2022-01-10 21:41:56,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states 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 21:41:56,313 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 453 transitions. [2022-01-10 21:41:56,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 21:41:56,313 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:56,313 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:56,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 21:41:56,314 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 21:41:56,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:56,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1972005888, now seen corresponding path program 1 times [2022-01-10 21:41:56,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:56,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945950800] [2022-01-10 21:41:56,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:56,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:56,426 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 21:41:56,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:56,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945950800] [2022-01-10 21:41:56,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945950800] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:56,427 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:56,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:56,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826828631] [2022-01-10 21:41:56,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:56,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:56,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:56,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:56,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:56,429 INFO L87 Difference]: Start difference. First operand 335 states and 453 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 21:41:56,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:56,618 INFO L93 Difference]: Finished difference Result 445 states and 589 transitions. [2022-01-10 21:41:56,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:56,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-01-10 21:41:56,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:56,620 INFO L225 Difference]: With dead ends: 445 [2022-01-10 21:41:56,620 INFO L226 Difference]: Without dead ends: 379 [2022-01-10 21:41:56,621 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 21:41:56,622 INFO L933 BasicCegarLoop]: 467 mSDtfsCounter, 198 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:56,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 659 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 21:41:56,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-01-10 21:41:56,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 362. [2022-01-10 21:41:56,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 342 states have (on average 1.432748538011696) internal successors, (490), 361 states have internal predecessors, (490), 0 states have call successors, (0), 0 states 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 21:41:56,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 490 transitions. [2022-01-10 21:41:56,654 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 490 transitions. Word has length 15 [2022-01-10 21:41:56,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:56,654 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 490 transitions. [2022-01-10 21:41:56,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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 21:41:56,654 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 490 transitions. [2022-01-10 21:41:56,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 21:41:56,655 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:56,655 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:56,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 21:41:56,655 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 21:41:56,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:56,655 INFO L85 PathProgramCache]: Analyzing trace with hash -792962119, now seen corresponding path program 1 times [2022-01-10 21:41:56,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:56,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017996605] [2022-01-10 21:41:56,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:56,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:56,706 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 21:41:56,707 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:56,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017996605] [2022-01-10 21:41:56,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017996605] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:56,707 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:56,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:56,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199083166] [2022-01-10 21:41:56,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:56,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:56,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:56,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:56,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:56,708 INFO L87 Difference]: Start difference. First operand 362 states and 490 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 21:41:56,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:56,744 INFO L93 Difference]: Finished difference Result 566 states and 747 transitions. [2022-01-10 21:41:56,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:56,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-01-10 21:41:56,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:56,747 INFO L225 Difference]: With dead ends: 566 [2022-01-10 21:41:56,747 INFO L226 Difference]: Without dead ends: 367 [2022-01-10 21:41:56,753 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 21:41:56,755 INFO L933 BasicCegarLoop]: 360 mSDtfsCounter, 337 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:56,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [337 Valid, 434 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:56,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-01-10 21:41:56,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 311. [2022-01-10 21:41:56,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 299 states have (on average 1.4214046822742474) internal successors, (425), 310 states have internal predecessors, (425), 0 states have call successors, (0), 0 states 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 21:41:56,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 425 transitions. [2022-01-10 21:41:56,774 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 425 transitions. Word has length 17 [2022-01-10 21:41:56,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:56,774 INFO L470 AbstractCegarLoop]: Abstraction has 311 states and 425 transitions. [2022-01-10 21:41:56,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 21:41:56,774 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 425 transitions. [2022-01-10 21:41:56,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 21:41:56,775 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:56,775 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] [2022-01-10 21:41:56,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 21:41:56,776 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 21:41:56,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:56,776 INFO L85 PathProgramCache]: Analyzing trace with hash 728776422, now seen corresponding path program 1 times [2022-01-10 21:41:56,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:56,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241946802] [2022-01-10 21:41:56,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:56,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:56,821 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 21:41:56,822 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:56,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241946802] [2022-01-10 21:41:56,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241946802] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:56,822 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:56,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:56,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73037385] [2022-01-10 21:41:56,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:56,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:56,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:56,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:56,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:56,823 INFO L87 Difference]: Start difference. First operand 311 states and 425 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states 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 21:41:56,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:56,918 INFO L93 Difference]: Finished difference Result 311 states and 425 transitions. [2022-01-10 21:41:56,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:56,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-01-10 21:41:56,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:56,919 INFO L225 Difference]: With dead ends: 311 [2022-01-10 21:41:56,920 INFO L226 Difference]: Without dead ends: 297 [2022-01-10 21:41:56,920 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:56,927 INFO L933 BasicCegarLoop]: 319 mSDtfsCounter, 84 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:56,929 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 515 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:56,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-01-10 21:41:56,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2022-01-10 21:41:56,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 292 states have (on average 1.4075342465753424) internal successors, (411), 296 states have internal predecessors, (411), 0 states have call successors, (0), 0 states 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 21:41:56,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 411 transitions. [2022-01-10 21:41:56,946 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 411 transitions. Word has length 23 [2022-01-10 21:41:56,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:56,946 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 411 transitions. [2022-01-10 21:41:56,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states 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 21:41:56,946 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 411 transitions. [2022-01-10 21:41:56,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-10 21:41:56,948 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:56,948 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] [2022-01-10 21:41:56,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 21:41:56,948 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 21:41:56,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:56,948 INFO L85 PathProgramCache]: Analyzing trace with hash -144259099, now seen corresponding path program 1 times [2022-01-10 21:41:56,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:56,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808073343] [2022-01-10 21:41:56,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:56,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:56,999 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 21:41:56,999 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:56,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808073343] [2022-01-10 21:41:57,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808073343] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:57,000 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:57,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:57,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58382751] [2022-01-10 21:41:57,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:57,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:57,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:57,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:57,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:57,002 INFO L87 Difference]: Start difference. First operand 297 states and 411 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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 21:41:57,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:57,027 INFO L93 Difference]: Finished difference Result 308 states and 425 transitions. [2022-01-10 21:41:57,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:57,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-01-10 21:41:57,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:57,029 INFO L225 Difference]: With dead ends: 308 [2022-01-10 21:41:57,029 INFO L226 Difference]: Without dead ends: 292 [2022-01-10 21:41:57,029 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 21:41:57,030 INFO L933 BasicCegarLoop]: 344 mSDtfsCounter, 338 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:57,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [338 Valid, 344 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:57,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-01-10 21:41:57,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 268. [2022-01-10 21:41:57,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 264 states have (on average 1.4393939393939394) internal successors, (380), 267 states have internal predecessors, (380), 0 states have call successors, (0), 0 states 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 21:41:57,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 380 transitions. [2022-01-10 21:41:57,042 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 380 transitions. Word has length 28 [2022-01-10 21:41:57,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:57,042 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 380 transitions. [2022-01-10 21:41:57,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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 21:41:57,042 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 380 transitions. [2022-01-10 21:41:57,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 21:41:57,046 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:57,047 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] [2022-01-10 21:41:57,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 21:41:57,047 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 21:41:57,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:57,047 INFO L85 PathProgramCache]: Analyzing trace with hash -130114860, now seen corresponding path program 1 times [2022-01-10 21:41:57,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:57,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346614306] [2022-01-10 21:41:57,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:57,048 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:57,127 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 21:41:57,127 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:57,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346614306] [2022-01-10 21:41:57,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346614306] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:57,128 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:57,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:57,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731953370] [2022-01-10 21:41:57,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:57,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:57,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:57,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:57,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:57,129 INFO L87 Difference]: Start difference. First operand 268 states and 380 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states 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 21:41:57,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:57,152 INFO L93 Difference]: Finished difference Result 333 states and 459 transitions. [2022-01-10 21:41:57,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:57,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-01-10 21:41:57,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:57,153 INFO L225 Difference]: With dead ends: 333 [2022-01-10 21:41:57,153 INFO L226 Difference]: Without dead ends: 282 [2022-01-10 21:41:57,153 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 21:41:57,155 INFO L933 BasicCegarLoop]: 360 mSDtfsCounter, 67 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:57,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 641 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:57,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-01-10 21:41:57,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 268. [2022-01-10 21:41:57,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 264 states have (on average 1.4356060606060606) internal successors, (379), 267 states have internal predecessors, (379), 0 states have call successors, (0), 0 states 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 21:41:57,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 379 transitions. [2022-01-10 21:41:57,168 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 379 transitions. Word has length 29 [2022-01-10 21:41:57,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:57,168 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 379 transitions. [2022-01-10 21:41:57,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states 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 21:41:57,168 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 379 transitions. [2022-01-10 21:41:57,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 21:41:57,169 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:57,169 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] [2022-01-10 21:41:57,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 21:41:57,170 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 21:41:57,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:57,170 INFO L85 PathProgramCache]: Analyzing trace with hash -177030601, now seen corresponding path program 1 times [2022-01-10 21:41:57,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:57,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996291233] [2022-01-10 21:41:57,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:57,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:57,216 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 21:41:57,216 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:57,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996291233] [2022-01-10 21:41:57,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996291233] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:57,217 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:57,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:57,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436091362] [2022-01-10 21:41:57,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:57,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:57,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:57,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:57,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:57,219 INFO L87 Difference]: Start difference. First operand 268 states and 379 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states 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 21:41:57,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:57,295 INFO L93 Difference]: Finished difference Result 283 states and 395 transitions. [2022-01-10 21:41:57,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:57,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-01-10 21:41:57,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:57,296 INFO L225 Difference]: With dead ends: 283 [2022-01-10 21:41:57,296 INFO L226 Difference]: Without dead ends: 255 [2022-01-10 21:41:57,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:57,297 INFO L933 BasicCegarLoop]: 342 mSDtfsCounter, 7 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:57,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 600 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:57,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-01-10 21:41:57,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2022-01-10 21:41:57,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 251 states have (on average 1.4103585657370519) internal successors, (354), 254 states have internal predecessors, (354), 0 states have call successors, (0), 0 states 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 21:41:57,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 354 transitions. [2022-01-10 21:41:57,306 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 354 transitions. Word has length 29 [2022-01-10 21:41:57,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:57,308 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 354 transitions. [2022-01-10 21:41:57,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states 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 21:41:57,308 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 354 transitions. [2022-01-10 21:41:57,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 21:41:57,310 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:57,311 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] [2022-01-10 21:41:57,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 21:41:57,312 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 21:41:57,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:57,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1280683895, now seen corresponding path program 1 times [2022-01-10 21:41:57,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:57,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212729005] [2022-01-10 21:41:57,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:57,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:57,357 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 21:41:57,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:57,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212729005] [2022-01-10 21:41:57,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212729005] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:57,358 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:57,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:57,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119720690] [2022-01-10 21:41:57,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:57,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:57,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:57,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:57,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:57,359 INFO L87 Difference]: Start difference. First operand 255 states and 354 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states 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 21:41:57,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:57,424 INFO L93 Difference]: Finished difference Result 275 states and 378 transitions. [2022-01-10 21:41:57,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:57,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-01-10 21:41:57,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:57,426 INFO L225 Difference]: With dead ends: 275 [2022-01-10 21:41:57,426 INFO L226 Difference]: Without dead ends: 252 [2022-01-10 21:41:57,426 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 21:41:57,426 INFO L933 BasicCegarLoop]: 339 mSDtfsCounter, 6 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:57,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 594 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:57,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-01-10 21:41:57,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2022-01-10 21:41:57,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 249 states have (on average 1.4056224899598393) internal successors, (350), 251 states have internal predecessors, (350), 0 states have call successors, (0), 0 states 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 21:41:57,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 350 transitions. [2022-01-10 21:41:57,435 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 350 transitions. Word has length 30 [2022-01-10 21:41:57,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:57,435 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 350 transitions. [2022-01-10 21:41:57,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states 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 21:41:57,435 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 350 transitions. [2022-01-10 21:41:57,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 21:41:57,435 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:57,436 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 21:41:57,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 21:41:57,436 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 21:41:57,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:57,436 INFO L85 PathProgramCache]: Analyzing trace with hash 191084148, now seen corresponding path program 1 times [2022-01-10 21:41:57,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:57,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093982017] [2022-01-10 21:41:57,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:57,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:57,468 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 21:41:57,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:57,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093982017] [2022-01-10 21:41:57,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093982017] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:57,469 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:57,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:57,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193440935] [2022-01-10 21:41:57,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:57,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:57,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:57,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:57,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:57,469 INFO L87 Difference]: Start difference. First operand 252 states and 350 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) 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 21:41:57,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:57,534 INFO L93 Difference]: Finished difference Result 264 states and 363 transitions. [2022-01-10 21:41:57,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:57,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) 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 21:41:57,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:57,536 INFO L225 Difference]: With dead ends: 264 [2022-01-10 21:41:57,536 INFO L226 Difference]: Without dead ends: 260 [2022-01-10 21:41:57,536 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 21:41:57,537 INFO L933 BasicCegarLoop]: 338 mSDtfsCounter, 15 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:57,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 587 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:57,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-01-10 21:41:57,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 254. [2022-01-10 21:41:57,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 251 states have (on average 1.3984063745019921) internal successors, (351), 253 states have internal predecessors, (351), 0 states have call successors, (0), 0 states 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 21:41:57,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 351 transitions. [2022-01-10 21:41:57,545 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 351 transitions. Word has length 32 [2022-01-10 21:41:57,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:57,545 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 351 transitions. [2022-01-10 21:41:57,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) 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 21:41:57,545 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 351 transitions. [2022-01-10 21:41:57,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 21:41:57,546 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:57,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] [2022-01-10 21:41:57,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 21:41:57,546 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 21:41:57,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:57,546 INFO L85 PathProgramCache]: Analyzing trace with hash 192070230, now seen corresponding path program 1 times [2022-01-10 21:41:57,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:57,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920695317] [2022-01-10 21:41:57,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:57,547 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:57,594 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 21:41:57,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:57,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920695317] [2022-01-10 21:41:57,595 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920695317] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:57,595 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:57,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 21:41:57,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783528319] [2022-01-10 21:41:57,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:57,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 21:41:57,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:57,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 21:41:57,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:41:57,596 INFO L87 Difference]: Start difference. First operand 254 states and 351 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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 21:41:57,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:57,748 INFO L93 Difference]: Finished difference Result 423 states and 547 transitions. [2022-01-10 21:41:57,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 21:41:57,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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 21:41:57,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:57,750 INFO L225 Difference]: With dead ends: 423 [2022-01-10 21:41:57,750 INFO L226 Difference]: Without dead ends: 370 [2022-01-10 21:41:57,751 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-10 21:41:57,751 INFO L933 BasicCegarLoop]: 308 mSDtfsCounter, 337 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:57,752 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [337 Valid, 1081 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:57,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-01-10 21:41:57,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 291. [2022-01-10 21:41:57,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 288 states have (on average 1.40625) internal successors, (405), 290 states have internal predecessors, (405), 0 states have call successors, (0), 0 states 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 21:41:57,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 405 transitions. [2022-01-10 21:41:57,766 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 405 transitions. Word has length 32 [2022-01-10 21:41:57,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:57,767 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 405 transitions. [2022-01-10 21:41:57,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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 21:41:57,770 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 405 transitions. [2022-01-10 21:41:57,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 21:41:57,772 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:57,772 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] [2022-01-10 21:41:57,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 21:41:57,772 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 21:41:57,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:57,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1794448013, now seen corresponding path program 1 times [2022-01-10 21:41:57,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:57,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707187785] [2022-01-10 21:41:57,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:57,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:57,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:57,824 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 21:41:57,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:57,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707187785] [2022-01-10 21:41:57,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707187785] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:57,824 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:57,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:57,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475437410] [2022-01-10 21:41:57,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:57,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:57,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:57,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:57,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:57,826 INFO L87 Difference]: Start difference. First operand 291 states and 405 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states 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 21:41:57,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:57,924 INFO L93 Difference]: Finished difference Result 352 states and 469 transitions. [2022-01-10 21:41:57,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:41:57,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2022-01-10 21:41:57,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:57,927 INFO L225 Difference]: With dead ends: 352 [2022-01-10 21:41:57,927 INFO L226 Difference]: Without dead ends: 347 [2022-01-10 21:41:57,927 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 21:41:57,927 INFO L933 BasicCegarLoop]: 308 mSDtfsCounter, 420 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:57,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [420 Valid, 564 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:57,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-01-10 21:41:57,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 319. [2022-01-10 21:41:57,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 316 states have (on average 1.370253164556962) internal successors, (433), 318 states have internal predecessors, (433), 0 states have call successors, (0), 0 states 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 21:41:57,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 433 transitions. [2022-01-10 21:41:57,952 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 433 transitions. Word has length 33 [2022-01-10 21:41:57,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:57,952 INFO L470 AbstractCegarLoop]: Abstraction has 319 states and 433 transitions. [2022-01-10 21:41:57,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states 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 21:41:57,952 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 433 transitions. [2022-01-10 21:41:57,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 21:41:57,953 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:57,953 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] [2022-01-10 21:41:57,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 21:41:57,953 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 21:41:57,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:57,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1627648189, now seen corresponding path program 1 times [2022-01-10 21:41:57,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:57,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379907601] [2022-01-10 21:41:57,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:57,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:57,990 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 21:41:57,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:57,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379907601] [2022-01-10 21:41:57,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379907601] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:57,990 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:57,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:57,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896676672] [2022-01-10 21:41:57,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:57,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:57,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:57,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:57,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:57,991 INFO L87 Difference]: Start difference. First operand 319 states and 433 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states 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 21:41:58,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:58,018 INFO L93 Difference]: Finished difference Result 336 states and 453 transitions. [2022-01-10 21:41:58,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:58,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2022-01-10 21:41:58,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:58,019 INFO L225 Difference]: With dead ends: 336 [2022-01-10 21:41:58,020 INFO L226 Difference]: Without dead ends: 302 [2022-01-10 21:41:58,020 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 21:41:58,021 INFO L933 BasicCegarLoop]: 330 mSDtfsCounter, 29 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:58,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 615 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:58,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-01-10 21:41:58,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2022-01-10 21:41:58,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 298 states have (on average 1.3724832214765101) internal successors, (409), 299 states have internal predecessors, (409), 0 states have call successors, (0), 0 states 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 21:41:58,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 409 transitions. [2022-01-10 21:41:58,036 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 409 transitions. Word has length 33 [2022-01-10 21:41:58,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:58,037 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 409 transitions. [2022-01-10 21:41:58,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states 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 21:41:58,037 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 409 transitions. [2022-01-10 21:41:58,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 21:41:58,038 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:58,038 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] [2022-01-10 21:41:58,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 21:41:58,038 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 21:41:58,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:58,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1658246525, now seen corresponding path program 1 times [2022-01-10 21:41:58,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:58,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100046351] [2022-01-10 21:41:58,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:58,038 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:58,125 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 21:41:58,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:58,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100046351] [2022-01-10 21:41:58,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100046351] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:58,126 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:58,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:58,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352686473] [2022-01-10 21:41:58,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:58,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:58,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:58,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:58,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:58,127 INFO L87 Difference]: Start difference. First operand 300 states and 409 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states 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 21:41:58,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:58,173 INFO L93 Difference]: Finished difference Result 331 states and 445 transitions. [2022-01-10 21:41:58,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:41:58,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2022-01-10 21:41:58,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:58,175 INFO L225 Difference]: With dead ends: 331 [2022-01-10 21:41:58,175 INFO L226 Difference]: Without dead ends: 294 [2022-01-10 21:41:58,175 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 21:41:58,176 INFO L933 BasicCegarLoop]: 325 mSDtfsCounter, 71 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:58,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 898 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:58,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-01-10 21:41:58,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2022-01-10 21:41:58,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 292 states have (on average 1.36986301369863) internal successors, (400), 293 states have internal predecessors, (400), 0 states have call successors, (0), 0 states 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 21:41:58,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 400 transitions. [2022-01-10 21:41:58,191 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 400 transitions. Word has length 33 [2022-01-10 21:41:58,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:58,191 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 400 transitions. [2022-01-10 21:41:58,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states 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 21:41:58,191 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 400 transitions. [2022-01-10 21:41:58,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 21:41:58,191 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:58,192 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:41:58,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 21:41:58,192 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 21:41:58,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:58,192 INFO L85 PathProgramCache]: Analyzing trace with hash -237502884, now seen corresponding path program 1 times [2022-01-10 21:41:58,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:58,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689953358] [2022-01-10 21:41:58,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:58,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:58,229 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 21:41:58,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:58,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689953358] [2022-01-10 21:41:58,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689953358] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:58,230 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:58,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:58,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268074919] [2022-01-10 21:41:58,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:58,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:58,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:58,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:58,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:58,231 INFO L87 Difference]: Start difference. First operand 294 states and 400 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:41:58,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:58,322 INFO L93 Difference]: Finished difference Result 300 states and 405 transitions. [2022-01-10 21:41:58,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:41:58,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-01-10 21:41:58,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:58,324 INFO L225 Difference]: With dead ends: 300 [2022-01-10 21:41:58,324 INFO L226 Difference]: Without dead ends: 266 [2022-01-10 21:41:58,324 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 21:41:58,324 INFO L933 BasicCegarLoop]: 271 mSDtfsCounter, 379 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:58,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [379 Valid, 454 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:58,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-01-10 21:41:58,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2022-01-10 21:41:58,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 264 states have (on average 1.3598484848484849) internal successors, (359), 265 states have internal predecessors, (359), 0 states have call successors, (0), 0 states 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 21:41:58,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 359 transitions. [2022-01-10 21:41:58,340 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 359 transitions. Word has length 34 [2022-01-10 21:41:58,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:58,340 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 359 transitions. [2022-01-10 21:41:58,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:41:58,340 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 359 transitions. [2022-01-10 21:41:58,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 21:41:58,340 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:58,340 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] [2022-01-10 21:41:58,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 21:41:58,341 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 21:41:58,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:58,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1230591941, now seen corresponding path program 1 times [2022-01-10 21:41:58,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:58,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215282808] [2022-01-10 21:41:58,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:58,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:58,410 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 21:41:58,411 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:58,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215282808] [2022-01-10 21:41:58,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215282808] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:58,411 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:58,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:58,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68067645] [2022-01-10 21:41:58,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:58,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:58,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:58,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:58,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:58,412 INFO L87 Difference]: Start difference. First operand 266 states and 359 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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 21:41:58,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:58,511 INFO L93 Difference]: Finished difference Result 305 states and 397 transitions. [2022-01-10 21:41:58,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:41:58,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2022-01-10 21:41:58,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:58,512 INFO L225 Difference]: With dead ends: 305 [2022-01-10 21:41:58,512 INFO L226 Difference]: Without dead ends: 300 [2022-01-10 21:41:58,514 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 21:41:58,514 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 469 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:58,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [469 Valid, 415 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:58,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-01-10 21:41:58,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 294. [2022-01-10 21:41:58,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 292 states have (on average 1.3253424657534247) internal successors, (387), 293 states have internal predecessors, (387), 0 states have call successors, (0), 0 states 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 21:41:58,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 387 transitions. [2022-01-10 21:41:58,533 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 387 transitions. Word has length 35 [2022-01-10 21:41:58,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:58,533 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 387 transitions. [2022-01-10 21:41:58,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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 21:41:58,534 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 387 transitions. [2022-01-10 21:41:58,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 21:41:58,534 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:58,534 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] [2022-01-10 21:41:58,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 21:41:58,534 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 21:41:58,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:58,535 INFO L85 PathProgramCache]: Analyzing trace with hash -2062382171, now seen corresponding path program 1 times [2022-01-10 21:41:58,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:58,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134647134] [2022-01-10 21:41:58,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:58,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:58,637 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 21:41:58,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:58,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134647134] [2022-01-10 21:41:58,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134647134] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:58,637 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:58,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 21:41:58,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046465204] [2022-01-10 21:41:58,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:58,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 21:41:58,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:58,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 21:41:58,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-10 21:41:58,638 INFO L87 Difference]: Start difference. First operand 294 states and 387 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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 21:41:58,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:58,903 INFO L93 Difference]: Finished difference Result 393 states and 486 transitions. [2022-01-10 21:41:58,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 21:41:58,903 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2022-01-10 21:41:58,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:58,904 INFO L225 Difference]: With dead ends: 393 [2022-01-10 21:41:58,904 INFO L226 Difference]: Without dead ends: 351 [2022-01-10 21:41:58,905 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-01-10 21:41:58,905 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 168 mSDsluCounter, 1654 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1943 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:58,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 1943 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 21:41:58,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-01-10 21:41:58,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 286. [2022-01-10 21:41:58,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 284 states have (on average 1.3204225352112675) internal successors, (375), 285 states have internal predecessors, (375), 0 states have call successors, (0), 0 states 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 21:41:58,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 375 transitions. [2022-01-10 21:41:58,922 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 375 transitions. Word has length 35 [2022-01-10 21:41:58,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:58,922 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 375 transitions. [2022-01-10 21:41:58,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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 21:41:58,923 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 375 transitions. [2022-01-10 21:41:58,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 21:41:58,923 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:58,923 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] [2022-01-10 21:41:58,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 21:41:58,923 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 21:41:58,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:58,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1620754808, now seen corresponding path program 1 times [2022-01-10 21:41:58,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:58,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252377689] [2022-01-10 21:41:58,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:58,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:58,966 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 21:41:58,966 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:58,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252377689] [2022-01-10 21:41:58,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252377689] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:58,966 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:58,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:58,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732481849] [2022-01-10 21:41:58,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:58,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:58,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:58,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:58,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:58,967 INFO L87 Difference]: Start difference. First operand 286 states and 375 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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 21:41:59,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:59,045 INFO L93 Difference]: Finished difference Result 303 states and 395 transitions. [2022-01-10 21:41:59,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:41:59,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2022-01-10 21:41:59,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:59,046 INFO L225 Difference]: With dead ends: 303 [2022-01-10 21:41:59,046 INFO L226 Difference]: Without dead ends: 272 [2022-01-10 21:41:59,046 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 21:41:59,047 INFO L933 BasicCegarLoop]: 273 mSDtfsCounter, 294 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:59,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 513 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:59,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-01-10 21:41:59,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2022-01-10 21:41:59,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 270 states have (on average 1.3222222222222222) internal successors, (357), 271 states have internal predecessors, (357), 0 states have call successors, (0), 0 states 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 21:41:59,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 357 transitions. [2022-01-10 21:41:59,062 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 357 transitions. Word has length 35 [2022-01-10 21:41:59,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:59,062 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 357 transitions. [2022-01-10 21:41:59,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states 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 21:41:59,062 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 357 transitions. [2022-01-10 21:41:59,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 21:41:59,063 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:59,063 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] [2022-01-10 21:41:59,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 21:41:59,063 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 21:41:59,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:59,063 INFO L85 PathProgramCache]: Analyzing trace with hash 2124051918, now seen corresponding path program 1 times [2022-01-10 21:41:59,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:59,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450896399] [2022-01-10 21:41:59,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:59,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:59,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:59,089 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 21:41:59,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:59,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450896399] [2022-01-10 21:41:59,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450896399] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:59,089 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:59,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:41:59,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531952048] [2022-01-10 21:41:59,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:59,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:41:59,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:59,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:41:59,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:41:59,090 INFO L87 Difference]: Start difference. First operand 272 states and 357 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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 21:41:59,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:59,167 INFO L93 Difference]: Finished difference Result 403 states and 503 transitions. [2022-01-10 21:41:59,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:41:59,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2022-01-10 21:41:59,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:59,169 INFO L225 Difference]: With dead ends: 403 [2022-01-10 21:41:59,169 INFO L226 Difference]: Without dead ends: 351 [2022-01-10 21:41:59,169 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 21:41:59,169 INFO L933 BasicCegarLoop]: 327 mSDtfsCounter, 61 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:59,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 589 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:59,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-01-10 21:41:59,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 277. [2022-01-10 21:41:59,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 275 states have (on average 1.32) internal successors, (363), 276 states have internal predecessors, (363), 0 states have call successors, (0), 0 states 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 21:41:59,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 363 transitions. [2022-01-10 21:41:59,192 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 363 transitions. Word has length 36 [2022-01-10 21:41:59,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:59,192 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 363 transitions. [2022-01-10 21:41:59,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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 21:41:59,192 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 363 transitions. [2022-01-10 21:41:59,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 21:41:59,193 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:59,193 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] [2022-01-10 21:41:59,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 21:41:59,193 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 21:41:59,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:59,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1674480819, now seen corresponding path program 1 times [2022-01-10 21:41:59,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:59,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627084090] [2022-01-10 21:41:59,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:59,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:59,255 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 21:41:59,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:59,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627084090] [2022-01-10 21:41:59,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627084090] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:59,256 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:59,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 21:41:59,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395242315] [2022-01-10 21:41:59,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:59,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 21:41:59,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:59,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 21:41:59,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 21:41:59,258 INFO L87 Difference]: Start difference. First operand 277 states and 363 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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 21:41:59,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:59,468 INFO L93 Difference]: Finished difference Result 325 states and 411 transitions. [2022-01-10 21:41:59,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 21:41:59,469 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2022-01-10 21:41:59,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:59,471 INFO L225 Difference]: With dead ends: 325 [2022-01-10 21:41:59,471 INFO L226 Difference]: Without dead ends: 251 [2022-01-10 21:41:59,471 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-01-10 21:41:59,472 INFO L933 BasicCegarLoop]: 293 mSDtfsCounter, 153 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:59,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 1584 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:59,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-01-10 21:41:59,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 219. [2022-01-10 21:41:59,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 217 states have (on average 1.3317972350230414) internal successors, (289), 218 states have internal predecessors, (289), 0 states have call successors, (0), 0 states 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 21:41:59,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 289 transitions. [2022-01-10 21:41:59,485 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 289 transitions. Word has length 36 [2022-01-10 21:41:59,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:59,485 INFO L470 AbstractCegarLoop]: Abstraction has 219 states and 289 transitions. [2022-01-10 21:41:59,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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 21:41:59,486 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 289 transitions. [2022-01-10 21:41:59,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 21:41:59,486 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:59,486 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] [2022-01-10 21:41:59,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 21:41:59,486 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 21:41:59,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:59,487 INFO L85 PathProgramCache]: Analyzing trace with hash 494208332, now seen corresponding path program 1 times [2022-01-10 21:41:59,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:59,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761744349] [2022-01-10 21:41:59,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:59,487 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:59,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:59,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:41:59,528 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:59,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761744349] [2022-01-10 21:41:59,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761744349] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:59,528 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:59,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:41:59,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048749805] [2022-01-10 21:41:59,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:59,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:41:59,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:59,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:41:59,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:41:59,529 INFO L87 Difference]: Start difference. First operand 219 states and 289 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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 21:41:59,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:59,592 INFO L93 Difference]: Finished difference Result 250 states and 319 transitions. [2022-01-10 21:41:59,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:41:59,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2022-01-10 21:41:59,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:59,594 INFO L225 Difference]: With dead ends: 250 [2022-01-10 21:41:59,594 INFO L226 Difference]: Without dead ends: 245 [2022-01-10 21:41:59,594 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 21:41:59,594 INFO L933 BasicCegarLoop]: 250 mSDtfsCounter, 277 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:59,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 434 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:41:59,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-01-10 21:41:59,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 219. [2022-01-10 21:41:59,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 217 states have (on average 1.3317972350230414) internal successors, (289), 218 states have internal predecessors, (289), 0 states have call successors, (0), 0 states 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 21:41:59,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 289 transitions. [2022-01-10 21:41:59,608 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 289 transitions. Word has length 36 [2022-01-10 21:41:59,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:59,608 INFO L470 AbstractCegarLoop]: Abstraction has 219 states and 289 transitions. [2022-01-10 21:41:59,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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 21:41:59,609 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 289 transitions. [2022-01-10 21:41:59,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 21:41:59,609 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:59,609 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] [2022-01-10 21:41:59,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 21:41:59,609 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 21:41:59,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:59,610 INFO L85 PathProgramCache]: Analyzing trace with hash -598156307, now seen corresponding path program 1 times [2022-01-10 21:41:59,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:59,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931023763] [2022-01-10 21:41:59,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:59,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:59,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:59,671 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 21:41:59,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:59,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931023763] [2022-01-10 21:41:59,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931023763] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:59,672 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:59,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 21:41:59,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318978423] [2022-01-10 21:41:59,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:59,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 21:41:59,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:59,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 21:41:59,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 21:41:59,673 INFO L87 Difference]: Start difference. First operand 219 states and 289 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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 21:41:59,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:41:59,842 INFO L93 Difference]: Finished difference Result 245 states and 317 transitions. [2022-01-10 21:41:59,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 21:41:59,842 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2022-01-10 21:41:59,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:41:59,844 INFO L225 Difference]: With dead ends: 245 [2022-01-10 21:41:59,844 INFO L226 Difference]: Without dead ends: 218 [2022-01-10 21:41:59,845 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-01-10 21:41:59,847 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 38 mSDsluCounter, 1147 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:41:59,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 1391 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:41:59,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-01-10 21:41:59,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2022-01-10 21:41:59,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 216 states have (on average 1.3287037037037037) internal successors, (287), 217 states have internal predecessors, (287), 0 states have call successors, (0), 0 states 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 21:41:59,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 287 transitions. [2022-01-10 21:41:59,862 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 287 transitions. Word has length 36 [2022-01-10 21:41:59,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:41:59,862 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 287 transitions. [2022-01-10 21:41:59,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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 21:41:59,862 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 287 transitions. [2022-01-10 21:41:59,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 21:41:59,863 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:41:59,863 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] [2022-01-10 21:41:59,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 21:41:59,863 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 21:41:59,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:41:59,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1319797027, now seen corresponding path program 1 times [2022-01-10 21:41:59,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:41:59,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322010157] [2022-01-10 21:41:59,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:41:59,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:41:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:41:59,937 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 21:41:59,937 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:41:59,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322010157] [2022-01-10 21:41:59,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322010157] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:41:59,937 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:41:59,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 21:41:59,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174791134] [2022-01-10 21:41:59,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:41:59,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 21:41:59,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:41:59,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 21:41:59,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:41:59,938 INFO L87 Difference]: Start difference. First operand 218 states and 287 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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 21:42:00,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:00,036 INFO L93 Difference]: Finished difference Result 309 states and 376 transitions. [2022-01-10 21:42:00,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 21:42:00,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-01-10 21:42:00,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:00,038 INFO L225 Difference]: With dead ends: 309 [2022-01-10 21:42:00,038 INFO L226 Difference]: Without dead ends: 282 [2022-01-10 21:42:00,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 21:42:00,039 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 154 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:00,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 935 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:42:00,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-01-10 21:42:00,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 218. [2022-01-10 21:42:00,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 216 states have (on average 1.3055555555555556) internal successors, (282), 217 states have internal predecessors, (282), 0 states have call successors, (0), 0 states 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 21:42:00,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 282 transitions. [2022-01-10 21:42:00,056 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 282 transitions. Word has length 37 [2022-01-10 21:42:00,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:00,056 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 282 transitions. [2022-01-10 21:42:00,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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 21:42:00,056 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 282 transitions. [2022-01-10 21:42:00,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 21:42:00,057 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:00,057 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] [2022-01-10 21:42:00,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 21:42:00,058 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 21:42:00,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:00,058 INFO L85 PathProgramCache]: Analyzing trace with hash 272521693, now seen corresponding path program 1 times [2022-01-10 21:42:00,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:00,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14881030] [2022-01-10 21:42:00,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:00,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:00,128 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 21:42:00,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:00,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14881030] [2022-01-10 21:42:00,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14881030] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:00,129 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:00,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 21:42:00,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256318527] [2022-01-10 21:42:00,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:00,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 21:42:00,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:00,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 21:42:00,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-10 21:42:00,130 INFO L87 Difference]: Start difference. First operand 218 states and 282 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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 21:42:00,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:00,283 INFO L93 Difference]: Finished difference Result 294 states and 362 transitions. [2022-01-10 21:42:00,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 21:42:00,283 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-01-10 21:42:00,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:00,284 INFO L225 Difference]: With dead ends: 294 [2022-01-10 21:42:00,284 INFO L226 Difference]: Without dead ends: 256 [2022-01-10 21:42:00,284 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-01-10 21:42:00,285 INFO L933 BasicCegarLoop]: 232 mSDtfsCounter, 140 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:00,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 1352 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:42:00,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-01-10 21:42:00,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 216. [2022-01-10 21:42:00,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 214 states have (on average 1.2990654205607477) internal successors, (278), 215 states have internal predecessors, (278), 0 states have call successors, (0), 0 states 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 21:42:00,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 278 transitions. [2022-01-10 21:42:00,300 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 278 transitions. Word has length 37 [2022-01-10 21:42:00,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:00,300 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 278 transitions. [2022-01-10 21:42:00,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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 21:42:00,300 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 278 transitions. [2022-01-10 21:42:00,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 21:42:00,301 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:00,301 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] [2022-01-10 21:42:00,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-10 21:42:00,301 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 21:42:00,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:00,301 INFO L85 PathProgramCache]: Analyzing trace with hash -407833728, now seen corresponding path program 1 times [2022-01-10 21:42:00,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:00,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483186133] [2022-01-10 21:42:00,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:00,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:00,362 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 21:42:00,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:00,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483186133] [2022-01-10 21:42:00,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483186133] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:00,363 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:00,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 21:42:00,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280083863] [2022-01-10 21:42:00,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:00,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 21:42:00,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:00,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 21:42:00,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 21:42:00,364 INFO L87 Difference]: Start difference. First operand 216 states and 278 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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 21:42:00,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:00,466 INFO L93 Difference]: Finished difference Result 232 states and 294 transitions. [2022-01-10 21:42:00,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 21:42:00,466 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-01-10 21:42:00,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:00,467 INFO L225 Difference]: With dead ends: 232 [2022-01-10 21:42:00,467 INFO L226 Difference]: Without dead ends: 192 [2022-01-10 21:42:00,467 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-10 21:42:00,468 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 36 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:00,468 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 1118 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:42:00,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-01-10 21:42:00,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2022-01-10 21:42:00,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 190 states have (on average 1.2894736842105263) internal successors, (245), 191 states have internal predecessors, (245), 0 states have call successors, (0), 0 states 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 21:42:00,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 245 transitions. [2022-01-10 21:42:00,481 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 245 transitions. Word has length 37 [2022-01-10 21:42:00,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:00,481 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 245 transitions. [2022-01-10 21:42:00,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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 21:42:00,481 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 245 transitions. [2022-01-10 21:42:00,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-10 21:42:00,482 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:00,482 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] [2022-01-10 21:42:00,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-10 21:42:00,482 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 21:42:00,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:00,482 INFO L85 PathProgramCache]: Analyzing trace with hash -2036928432, now seen corresponding path program 1 times [2022-01-10 21:42:00,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:00,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327675897] [2022-01-10 21:42:00,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:00,483 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:00,554 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 21:42:00,554 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:00,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327675897] [2022-01-10 21:42:00,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327675897] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:00,554 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:00,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 21:42:00,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364404462] [2022-01-10 21:42:00,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:00,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 21:42:00,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:00,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 21:42:00,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:42:00,555 INFO L87 Difference]: Start difference. First operand 192 states and 245 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:00,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:00,628 INFO L93 Difference]: Finished difference Result 242 states and 295 transitions. [2022-01-10 21:42:00,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 21:42:00,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-01-10 21:42:00,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:00,629 INFO L225 Difference]: With dead ends: 242 [2022-01-10 21:42:00,629 INFO L226 Difference]: Without dead ends: 236 [2022-01-10 21:42:00,629 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 21:42:00,630 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 113 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:00,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 808 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 21:42:00,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-01-10 21:42:00,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 192. [2022-01-10 21:42:00,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 190 states have (on average 1.2842105263157895) internal successors, (244), 191 states have internal predecessors, (244), 0 states have call successors, (0), 0 states 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 21:42:00,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 244 transitions. [2022-01-10 21:42:00,644 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 244 transitions. Word has length 38 [2022-01-10 21:42:00,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:00,644 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 244 transitions. [2022-01-10 21:42:00,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:00,644 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 244 transitions. [2022-01-10 21:42:00,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-10 21:42:00,644 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:00,644 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] [2022-01-10 21:42:00,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-10 21:42:00,645 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 21:42:00,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:00,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1189978890, now seen corresponding path program 1 times [2022-01-10 21:42:00,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:00,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58037627] [2022-01-10 21:42:00,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:00,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:00,697 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 21:42:00,697 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:00,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58037627] [2022-01-10 21:42:00,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58037627] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:00,698 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:00,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 21:42:00,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699969365] [2022-01-10 21:42:00,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:00,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 21:42:00,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:00,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 21:42:00,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 21:42:00,699 INFO L87 Difference]: Start difference. First operand 192 states and 244 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:00,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:00,854 INFO L93 Difference]: Finished difference Result 212 states and 264 transitions. [2022-01-10 21:42:00,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 21:42:00,854 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-01-10 21:42:00,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:00,855 INFO L225 Difference]: With dead ends: 212 [2022-01-10 21:42:00,855 INFO L226 Difference]: Without dead ends: 135 [2022-01-10 21:42:00,855 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-01-10 21:42:00,856 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 139 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:00,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 1024 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:42:00,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-01-10 21:42:00,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-01-10 21:42:00,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 133 states have (on average 1.2105263157894737) internal successors, (161), 134 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:00,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 161 transitions. [2022-01-10 21:42:00,875 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 161 transitions. Word has length 38 [2022-01-10 21:42:00,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:00,875 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 161 transitions. [2022-01-10 21:42:00,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:00,876 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 161 transitions. [2022-01-10 21:42:00,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-10 21:42:00,876 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:00,876 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] [2022-01-10 21:42:00,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-10 21:42:00,876 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 21:42:00,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:00,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1866619656, now seen corresponding path program 1 times [2022-01-10 21:42:00,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:00,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421792804] [2022-01-10 21:42:00,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:00,877 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:42:00,930 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 21:42:00,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:42:00,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421792804] [2022-01-10 21:42:00,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421792804] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:42:00,930 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:42:00,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 21:42:00,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627278100] [2022-01-10 21:42:00,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:42:00,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 21:42:00,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:42:00,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 21:42:00,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 21:42:00,931 INFO L87 Difference]: Start difference. First operand 135 states and 161 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:01,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:42:01,058 INFO L93 Difference]: Finished difference Result 191 states and 219 transitions. [2022-01-10 21:42:01,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 21:42:01,059 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-01-10 21:42:01,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:42:01,059 INFO L225 Difference]: With dead ends: 191 [2022-01-10 21:42:01,059 INFO L226 Difference]: Without dead ends: 162 [2022-01-10 21:42:01,060 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-01-10 21:42:01,060 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 323 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:42:01,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [323 Valid, 561 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 21:42:01,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-01-10 21:42:01,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 134. [2022-01-10 21:42:01,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 132 states have (on average 1.2045454545454546) internal successors, (159), 133 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:01,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 159 transitions. [2022-01-10 21:42:01,071 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 159 transitions. Word has length 38 [2022-01-10 21:42:01,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:42:01,071 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 159 transitions. [2022-01-10 21:42:01,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:42:01,072 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 159 transitions. [2022-01-10 21:42:01,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-10 21:42:01,072 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:42:01,072 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] [2022-01-10 21:42:01,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-10 21:42:01,072 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-01-10 21:42:01,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:42:01,072 INFO L85 PathProgramCache]: Analyzing trace with hash -523952087, now seen corresponding path program 1 times [2022-01-10 21:42:01,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:42:01,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322587492] [2022-01-10 21:42:01,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:42:01,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:42:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 21:42:01,088 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 21:42:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 21:42:01,123 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-10 21:42:01,123 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 21:42:01,123 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION (29 of 30 remaining) [2022-01-10 21:42:01,125 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION (28 of 30 remaining) [2022-01-10 21:42:01,125 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (27 of 30 remaining) [2022-01-10 21:42:01,125 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (26 of 30 remaining) [2022-01-10 21:42:01,125 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (25 of 30 remaining) [2022-01-10 21:42:01,125 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (24 of 30 remaining) [2022-01-10 21:42:01,125 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (23 of 30 remaining) [2022-01-10 21:42:01,125 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION (22 of 30 remaining) [2022-01-10 21:42:01,125 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (21 of 30 remaining) [2022-01-10 21:42:01,125 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION (20 of 30 remaining) [2022-01-10 21:42:01,125 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION (19 of 30 remaining) [2022-01-10 21:42:01,125 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION (18 of 30 remaining) [2022-01-10 21:42:01,125 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (17 of 30 remaining) [2022-01-10 21:42:01,125 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (16 of 30 remaining) [2022-01-10 21:42:01,126 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 30 remaining) [2022-01-10 21:42:01,126 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (14 of 30 remaining) [2022-01-10 21:42:01,126 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (13 of 30 remaining) [2022-01-10 21:42:01,126 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION (12 of 30 remaining) [2022-01-10 21:42:01,126 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (11 of 30 remaining) [2022-01-10 21:42:01,126 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (10 of 30 remaining) [2022-01-10 21:42:01,126 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION (9 of 30 remaining) [2022-01-10 21:42:01,126 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (8 of 30 remaining) [2022-01-10 21:42:01,126 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (7 of 30 remaining) [2022-01-10 21:42:01,126 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION (6 of 30 remaining) [2022-01-10 21:42:01,126 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION (5 of 30 remaining) [2022-01-10 21:42:01,126 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (4 of 30 remaining) [2022-01-10 21:42:01,126 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION (3 of 30 remaining) [2022-01-10 21:42:01,126 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION (2 of 30 remaining) [2022-01-10 21:42:01,127 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (1 of 30 remaining) [2022-01-10 21:42:01,127 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (0 of 30 remaining) [2022-01-10 21:42:01,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-10 21:42:01,129 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:42:01,131 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 21:42:01,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 09:42:01 BasicIcfg [2022-01-10 21:42:01,274 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 21:42:01,274 INFO L158 Benchmark]: Toolchain (without parser) took 7130.76ms. Allocated memory was 174.1MB in the beginning and 267.4MB in the end (delta: 93.3MB). Free memory was 122.8MB in the beginning and 79.6MB in the end (delta: 43.2MB). Peak memory consumption was 137.8MB. Max. memory is 8.0GB. [2022-01-10 21:42:01,274 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 174.1MB. Free memory is still 139.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 21:42:01,274 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.65ms. Allocated memory was 174.1MB in the beginning and 213.9MB in the end (delta: 39.8MB). Free memory was 122.7MB in the beginning and 184.5MB in the end (delta: -61.7MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. [2022-01-10 21:42:01,274 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.58ms. Allocated memory is still 213.9MB. Free memory was 184.5MB in the beginning and 178.7MB in the end (delta: 5.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-01-10 21:42:01,274 INFO L158 Benchmark]: Boogie Preprocessor took 55.59ms. Allocated memory is still 213.9MB. Free memory was 178.7MB in the beginning and 175.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-01-10 21:42:01,275 INFO L158 Benchmark]: RCFGBuilder took 886.86ms. Allocated memory is still 213.9MB. Free memory was 175.0MB in the beginning and 127.3MB in the end (delta: 47.7MB). Peak memory consumption was 47.2MB. Max. memory is 8.0GB. [2022-01-10 21:42:01,275 INFO L158 Benchmark]: IcfgTransformer took 172.61ms. Allocated memory is still 213.9MB. Free memory was 127.3MB in the beginning and 99.0MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-01-10 21:42:01,275 INFO L158 Benchmark]: TraceAbstraction took 5546.03ms. Allocated memory was 213.9MB in the beginning and 267.4MB in the end (delta: 53.5MB). Free memory was 98.5MB in the beginning and 79.6MB in the end (delta: 18.9MB). Peak memory consumption was 73.4MB. Max. memory is 8.0GB. [2022-01-10 21:42:01,277 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 174.1MB. Free memory is still 139.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 386.65ms. Allocated memory was 174.1MB in the beginning and 213.9MB in the end (delta: 39.8MB). Free memory was 122.7MB in the beginning and 184.5MB in the end (delta: -61.7MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 75.58ms. Allocated memory is still 213.9MB. Free memory was 184.5MB in the beginning and 178.7MB in the end (delta: 5.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.59ms. Allocated memory is still 213.9MB. Free memory was 178.7MB in the beginning and 175.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 886.86ms. Allocated memory is still 213.9MB. Free memory was 175.0MB in the beginning and 127.3MB in the end (delta: 47.7MB). Peak memory consumption was 47.2MB. Max. memory is 8.0GB. * IcfgTransformer took 172.61ms. Allocated memory is still 213.9MB. Free memory was 127.3MB in the beginning and 99.0MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * TraceAbstraction took 5546.03ms. Allocated memory was 213.9MB in the beginning and 267.4MB in the end (delta: 53.5MB). Free memory was 98.5MB in the beginning and 79.6MB in the end (delta: 18.9MB). Peak memory consumption was 73.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1013]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] int KernelMode ; [L24] int Executive ; [L25] int DevicePowerState ; [L26] int s ; [L27] int UNLOADED ; [L28] int NP ; [L29] int DC ; [L30] int SKIP1 ; [L31] int SKIP2 ; [L32] int MPR1 ; [L33] int MPR3 ; [L34] int IPC ; [L35] int pended ; [L36] int compFptr ; [L37] int compRegistered ; [L38] int lowerDriverReturn ; [L39] int setEventCalled ; [L40] int customIrp ; [L41] int myStatus ; VAL [compFptr=0, compRegistered=0, customIrp=0, DC=0, DevicePowerState=0, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, UNLOADED=0] [L294] int status ; [L295] int irp = __VERIFIER_nondet_int() ; [L296] int pirp ; [L297] int pirp__IoStatus__Status ; [L298] int irp_choice = __VERIFIER_nondet_int() ; [L299] int devobj = __VERIFIER_nondet_int() ; [L300] int __cil_tmp8 ; [L302] KernelMode = 0 [L303] Executive = 0 [L304] DevicePowerState = 1 [L305] s = 0 [L306] UNLOADED = 0 [L307] NP = 0 [L308] DC = 0 [L309] SKIP1 = 0 [L310] SKIP2 = 0 [L311] MPR1 = 0 [L312] MPR3 = 0 [L313] IPC = 0 [L314] pended = 0 [L315] compFptr = 0 [L316] compRegistered = 0 [L317] lowerDriverReturn = 0 [L318] setEventCalled = 0 [L319] customIrp = 0 [L320] myStatus = 0 [L324] status = 0 [L325] pirp = irp [L326] CALL _BLAST_init() [L61] UNLOADED = 0 [L62] NP = 1 [L63] DC = 2 [L64] SKIP1 = 3 [L65] SKIP2 = 4 [L66] MPR1 = 5 [L67] MPR3 = 6 [L68] IPC = 7 [L69] s = UNLOADED [L70] pended = 0 [L71] compFptr = 0 [L72] compRegistered = 0 [L73] lowerDriverReturn = 0 [L74] setEventCalled = 0 [L75] customIrp = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L326] RET _BLAST_init() [L328] COND TRUE status >= 0 [L329] s = NP [L330] customIrp = 0 [L331] setEventCalled = customIrp [L332] lowerDriverReturn = setEventCalled [L333] compRegistered = lowerDriverReturn [L334] pended = compRegistered [L335] pirp__IoStatus__Status = 0 [L336] myStatus = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L337] COND TRUE irp_choice == 0 [L338] pirp__IoStatus__Status = -1073741637 [L339] myStatus = -1073741637 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=3221225659, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L342] CALL stub_driver_init() [L47] s = NP [L48] pended = 0 [L49] compFptr = 0 [L50] compRegistered = 0 [L51] lowerDriverReturn = 0 [L52] setEventCalled = 0 [L53] customIrp = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L342] RET stub_driver_init() [L345] COND FALSE !(status < 0) [L349] int tmp_ndt_1; [L350] tmp_ndt_1 = __VERIFIER_nondet_int() [L351] COND FALSE !(tmp_ndt_1 == 0) [L354] int tmp_ndt_2; [L355] tmp_ndt_2 = __VERIFIER_nondet_int() [L356] COND FALSE !(tmp_ndt_2 == 1) [L359] int tmp_ndt_3; [L360] tmp_ndt_3 = __VERIFIER_nondet_int() [L361] COND TRUE tmp_ndt_3 == 3 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=3221225659, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=4, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L388] CALL, EXPR KbFilter_PnP(devobj, pirp) [L80] int devExt ; [L81] int irpStack ; [L82] int status ; [L83] int event = __VERIFIER_nondet_int() ; [L84] int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ; [L85] int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ; [L86] int irpStack__MinorFunction = __VERIFIER_nondet_int() ; [L87] int devExt__TopOfStack = __VERIFIER_nondet_int() ; [L88] int devExt__Started ; [L89] int devExt__Removed ; [L90] int devExt__SurpriseRemoved ; [L91] int Irp__IoStatus__Status ; [L92] int Irp__IoStatus__Information ; [L93] int Irp__CurrentLocation = __VERIFIER_nondet_int() ; [L94] int irpSp ; [L95] int nextIrpSp ; [L96] int nextIrpSp__Control ; [L97] int irpSp___0 ; [L98] int irpSp__Context ; [L99] int irpSp__Control ; [L100] long __cil_tmp23 ; [L103] status = 0 [L104] devExt = DeviceObject__DeviceExtension [L105] irpStack = Irp__Tail__Overlay__CurrentStackLocation VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L106] COND FALSE !(irpStack__MinorFunction == 0) VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L109] COND FALSE !(irpStack__MinorFunction == 23) VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L112] COND TRUE irpStack__MinorFunction == 2 VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L236] devExt__Removed = 1 VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L237] COND TRUE s == NP [L238] s = SKIP1 VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L245] Irp__CurrentLocation ++ [L246] Irp__Tail__Overlay__CurrentStackLocation ++ [L247] CALL IofCallDriver(devExt__TopOfStack, Irp) [L483] int returnVal2 ; [L484] int compRetStatus ; [L485] int lcontext = __VERIFIER_nondet_int() ; [L486] long long __cil_tmp7 ; VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L489] COND FALSE !(\read(compRegistered)) VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L502] int tmp_ndt_6; [L503] tmp_ndt_6 = __VERIFIER_nondet_int() [L504] COND FALSE !(tmp_ndt_6 == 0) [L507] int tmp_ndt_7; [L508] tmp_ndt_7 = __VERIFIER_nondet_int() [L509] COND TRUE tmp_ndt_7 == 1 VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=1, tmp_ndt_7=1, UNLOADED=0] [L518] returnVal2 = -1073741823 VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, returnVal2=3221225473, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=1, tmp_ndt_7=1, UNLOADED=0] [L528] COND FALSE !(s == NP) VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, returnVal2=3221225473, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=1, tmp_ndt_7=1, UNLOADED=0] [L532] COND FALSE !(s == MPR1) VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, returnVal2=3221225473, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=1, tmp_ndt_7=1, UNLOADED=0] [L541] COND TRUE s == SKIP1 [L542] s = SKIP2 [L543] lowerDriverReturn = returnVal2 VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, returnVal2=3221225473, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=1, tmp_ndt_7=1, UNLOADED=0] [L551] return (returnVal2); VAL [\old(DeviceObject)=0, \old(Irp)=0, \result=-1073741823, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, returnVal2=3221225473, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=1, tmp_ndt_7=1, UNLOADED=0] [L247] RET IofCallDriver(devExt__TopOfStack, Irp) [L248] status = 0 VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, Irp__CurrentLocation=1, Irp__Tail__Overlay__CurrentStackLocation=1, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L290] return (status); VAL [\old(DeviceObject)=0, \old(Irp)=0, \result=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, Irp__CurrentLocation=1, Irp__Tail__Overlay__CurrentStackLocation=1, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L388] RET, EXPR KbFilter_PnP(devobj, pirp) [L388] status = KbFilter_PnP(devobj, pirp) [L412] COND FALSE !(pended == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=3221225659, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=4, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L420] COND FALSE !(pended == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=3221225659, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=4, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L428] COND TRUE s != UNLOADED VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=3221225659, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=4, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L429] COND TRUE status != -1 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=3221225659, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=4, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L430] COND FALSE !(s != SKIP2) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=3221225659, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=4, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L440] COND FALSE !(pended == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=3221225659, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=4, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L447] COND FALSE !(s == DC) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=3221225659, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=4, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L452] COND TRUE status != lowerDriverReturn [L453] CALL errorFn() [L1013] reach_error() VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=3221225473, MPR1=5, MPR3=6, myStatus=3221225659, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 371 locations, 30 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 28, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4661 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4661 mSDsluCounter, 21462 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13314 mSDsCounter, 328 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2682 IncrementalHoareTripleChecker+Invalid, 3010 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 328 mSolverCounterUnsat, 8148 mSDtfsCounter, 2682 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=371occurred in iteration=0, InterpolantAutomatonStates: 132, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 27 MinimizatonAttempts, 605 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 893 NumberOfCodeBlocks, 893 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 827 ConstructedInterpolants, 0 QuantifiedInterpolants, 2659 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-01-10 21:42:01,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...