./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db1e722f73dbd7795cdbaca4c816f6c8a0f90138145d9f90bf0f222b7dd371eb --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 02:49:45,733 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 02:49:45,742 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 02:49:45,803 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 02:49:45,804 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 02:49:45,806 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 02:49:45,806 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 02:49:45,809 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 02:49:45,810 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 02:49:45,813 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 02:49:45,814 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 02:49:45,815 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 02:49:45,815 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 02:49:45,817 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 02:49:45,819 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 02:49:45,821 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 02:49:45,822 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 02:49:45,823 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 02:49:45,825 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 02:49:45,829 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 02:49:45,829 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 02:49:45,830 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 02:49:45,831 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 02:49:45,832 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 02:49:45,835 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 02:49:45,835 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 02:49:45,836 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 02:49:45,837 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 02:49:45,837 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 02:49:45,837 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 02:49:45,838 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 02:49:45,839 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 02:49:45,840 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 02:49:45,841 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 02:49:45,842 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 02:49:45,842 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 02:49:45,842 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 02:49:45,842 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 02:49:45,842 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 02:49:45,843 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 02:49:45,843 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 02:49:45,844 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 02:49:45,873 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 02:49:45,873 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 02:49:45,874 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 02:49:45,874 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 02:49:45,875 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 02:49:45,875 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 02:49:45,875 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 02:49:45,875 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 02:49:45,875 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 02:49:45,876 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 02:49:45,876 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 02:49:45,876 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 02:49:45,876 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 02:49:45,877 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 02:49:45,877 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 02:49:45,877 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 02:49:45,877 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 02:49:45,877 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 02:49:45,877 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 02:49:45,877 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 02:49:45,877 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 02:49:45,878 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 02:49:45,878 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 02:49:45,878 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 02:49:45,878 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 02:49:45,878 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 02:49:45,878 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 02:49:45,878 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 02:49:45,879 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 02:49:45,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 02:49:45,879 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 02:49:45,879 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 02:49:45,879 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 02:49:45,879 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 02:49:45,880 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> db1e722f73dbd7795cdbaca4c816f6c8a0f90138145d9f90bf0f222b7dd371eb [2021-12-17 02:49:46,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 02:49:46,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 02:49:46,096 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 02:49:46,097 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 02:49:46,097 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 02:49:46,098 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2021-12-17 02:49:46,161 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b891fdc7d/99065ed9e5594f36a76207ed652e2a0b/FLAGe1e54bded [2021-12-17 02:49:46,549 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 02:49:46,554 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2021-12-17 02:49:46,560 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b891fdc7d/99065ed9e5594f36a76207ed652e2a0b/FLAGe1e54bded [2021-12-17 02:49:46,570 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b891fdc7d/99065ed9e5594f36a76207ed652e2a0b [2021-12-17 02:49:46,571 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 02:49:46,572 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 02:49:46,573 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 02:49:46,574 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 02:49:46,586 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 02:49:46,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 02:49:46" (1/1) ... [2021-12-17 02:49:46,587 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61ac39f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:49:46, skipping insertion in model container [2021-12-17 02:49:46,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 02:49:46" (1/1) ... [2021-12-17 02:49:46,592 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 02:49:46,615 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 02:49:46,762 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.c[17080,17093] [2021-12-17 02:49:46,764 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 02:49:46,769 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 02:49:46,812 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.c[17080,17093] [2021-12-17 02:49:46,812 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 02:49:46,821 INFO L208 MainTranslator]: Completed translation [2021-12-17 02:49:46,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:49:46 WrapperNode [2021-12-17 02:49:46,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 02:49:46,832 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 02:49:46,833 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 02:49:46,833 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 02:49:46,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:49:46" (1/1) ... [2021-12-17 02:49:46,844 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:49:46" (1/1) ... [2021-12-17 02:49:46,887 INFO L137 Inliner]: procedures = 24, calls = 29, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 423 [2021-12-17 02:49:46,887 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 02:49:46,888 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 02:49:46,888 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 02:49:46,888 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 02:49:46,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:49:46" (1/1) ... [2021-12-17 02:49:46,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:49:46" (1/1) ... [2021-12-17 02:49:46,896 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:49:46" (1/1) ... [2021-12-17 02:49:46,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:49:46" (1/1) ... [2021-12-17 02:49:46,901 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:49:46" (1/1) ... [2021-12-17 02:49:46,910 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:49:46" (1/1) ... [2021-12-17 02:49:46,925 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:49:46" (1/1) ... [2021-12-17 02:49:46,927 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 02:49:46,928 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 02:49:46,928 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 02:49:46,928 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 02:49:46,929 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:49:46" (1/1) ... [2021-12-17 02:49:46,949 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 02:49:46,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:49:46,968 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) [2021-12-17 02:49:46,969 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 [2021-12-17 02:49:47,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 02:49:47,013 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2021-12-17 02:49:47,013 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2021-12-17 02:49:47,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 02:49:47,013 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2021-12-17 02:49:47,013 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2021-12-17 02:49:47,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 02:49:47,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 02:49:47,133 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 02:49:47,134 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 02:49:47,182 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-17 02:49:47,199 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-17 02:49:47,201 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-17 02:49:47,449 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##82: assume !false; [2021-12-17 02:49:47,450 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##81: assume false; [2021-12-17 02:49:47,450 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##58: assume !false; [2021-12-17 02:49:47,450 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##57: assume false; [2021-12-17 02:49:47,450 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2021-12-17 02:49:47,450 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2021-12-17 02:49:47,452 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-17 02:49:47,486 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2021-12-17 02:49:47,488 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2021-12-17 02:49:47,489 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 02:49:47,495 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 02:49:47,496 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-17 02:49:47,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:49:47 BoogieIcfgContainer [2021-12-17 02:49:47,498 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 02:49:47,499 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 02:49:47,499 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 02:49:47,501 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 02:49:47,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 02:49:46" (1/3) ... [2021-12-17 02:49:47,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@114a8451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 02:49:47, skipping insertion in model container [2021-12-17 02:49:47,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:49:46" (2/3) ... [2021-12-17 02:49:47,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@114a8451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 02:49:47, skipping insertion in model container [2021-12-17 02:49:47,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:49:47" (3/3) ... [2021-12-17 02:49:47,503 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.c [2021-12-17 02:49:47,507 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 02:49:47,507 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 02:49:47,534 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 02:49:47,538 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 [2021-12-17 02:49:47,538 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 02:49:47,549 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 103 states have (on average 1.6116504854368932) internal successors, (166), 114 states have internal predecessors, (166), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2021-12-17 02:49:47,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-17 02:49:47,552 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:47,553 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:49:47,553 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:47,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:47,561 INFO L85 PathProgramCache]: Analyzing trace with hash -454322622, now seen corresponding path program 1 times [2021-12-17 02:49:47,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:47,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683073256] [2021-12-17 02:49:47,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:47,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:47,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:47,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:47,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:47,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683073256] [2021-12-17 02:49:47,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683073256] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:47,705 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:47,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 02:49:47,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182132389] [2021-12-17 02:49:47,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:47,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 02:49:47,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:47,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 02:49:47,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 02:49:47,732 INFO L87 Difference]: Start difference. First operand has 121 states, 103 states have (on average 1.6116504854368932) internal successors, (166), 114 states have internal predecessors, (166), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:49:47,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:47,785 INFO L93 Difference]: Finished difference Result 235 states and 382 transitions. [2021-12-17 02:49:47,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 02:49:47,791 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-17 02:49:47,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:47,796 INFO L225 Difference]: With dead ends: 235 [2021-12-17 02:49:47,796 INFO L226 Difference]: Without dead ends: 111 [2021-12-17 02:49:47,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 02:49:47,801 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 102 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:47,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 242 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:49:47,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-17 02:49:47,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-12-17 02:49:47,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 95 states have (on average 1.5052631578947369) internal successors, (143), 104 states have internal predecessors, (143), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-17 02:49:47,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2021-12-17 02:49:47,830 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 13 [2021-12-17 02:49:47,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:47,830 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions. [2021-12-17 02:49:47,830 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:49:47,830 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2021-12-17 02:49:47,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-17 02:49:47,831 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:47,831 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:49:47,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 02:49:47,831 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:47,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:47,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1664019001, now seen corresponding path program 1 times [2021-12-17 02:49:47,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:47,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200356455] [2021-12-17 02:49:47,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:47,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:47,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:47,866 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:47,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200356455] [2021-12-17 02:49:47,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200356455] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:47,866 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:47,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 02:49:47,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019396283] [2021-12-17 02:49:47,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:47,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 02:49:47,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:47,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 02:49:47,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 02:49:47,869 INFO L87 Difference]: Start difference. First operand 111 states and 161 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:49:47,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:47,933 INFO L93 Difference]: Finished difference Result 203 states and 288 transitions. [2021-12-17 02:49:47,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 02:49:47,933 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-17 02:49:47,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:47,935 INFO L225 Difference]: With dead ends: 203 [2021-12-17 02:49:47,935 INFO L226 Difference]: Without dead ends: 156 [2021-12-17 02:49:47,936 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 [2021-12-17 02:49:47,936 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 112 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:47,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 237 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:49:47,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-17 02:49:47,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2021-12-17 02:49:47,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 130 states have (on average 1.4230769230769231) internal successors, (185), 131 states have internal predecessors, (185), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-17 02:49:47,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 203 transitions. [2021-12-17 02:49:47,949 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 203 transitions. Word has length 16 [2021-12-17 02:49:47,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:47,949 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 203 transitions. [2021-12-17 02:49:47,949 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:49:47,950 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 203 transitions. [2021-12-17 02:49:47,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-17 02:49:47,950 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:47,950 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:49:47,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 02:49:47,951 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:47,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:47,951 INFO L85 PathProgramCache]: Analyzing trace with hash -45143919, now seen corresponding path program 1 times [2021-12-17 02:49:47,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:47,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579364878] [2021-12-17 02:49:47,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:47,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:47,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:47,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:47,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:47,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579364878] [2021-12-17 02:49:47,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579364878] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:47,981 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:47,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 02:49:47,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235217125] [2021-12-17 02:49:47,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:47,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 02:49:47,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:47,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 02:49:47,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 02:49:47,983 INFO L87 Difference]: Start difference. First operand 143 states and 203 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:49:47,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:48,000 INFO L93 Difference]: Finished difference Result 246 states and 339 transitions. [2021-12-17 02:49:48,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 02:49:48,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-17 02:49:48,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:48,001 INFO L225 Difference]: With dead ends: 246 [2021-12-17 02:49:48,001 INFO L226 Difference]: Without dead ends: 198 [2021-12-17 02:49:48,002 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 [2021-12-17 02:49:48,003 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 128 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:48,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 222 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:49:48,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-12-17 02:49:48,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 154. [2021-12-17 02:49:48,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 141 states have (on average 1.4113475177304964) internal successors, (199), 142 states have internal predecessors, (199), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 8 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-17 02:49:48,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 216 transitions. [2021-12-17 02:49:48,014 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 216 transitions. Word has length 17 [2021-12-17 02:49:48,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:48,014 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 216 transitions. [2021-12-17 02:49:48,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:49:48,015 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 216 transitions. [2021-12-17 02:49:48,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-17 02:49:48,032 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:48,032 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] [2021-12-17 02:49:48,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-17 02:49:48,033 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:48,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:48,033 INFO L85 PathProgramCache]: Analyzing trace with hash 111527333, now seen corresponding path program 1 times [2021-12-17 02:49:48,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:48,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696561414] [2021-12-17 02:49:48,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:48,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:48,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:48,111 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:48,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696561414] [2021-12-17 02:49:48,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696561414] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:48,113 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:48,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 02:49:48,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397076580] [2021-12-17 02:49:48,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:48,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 02:49:48,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:48,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 02:49:48,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 02:49:48,115 INFO L87 Difference]: Start difference. First operand 154 states and 216 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:49:48,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:48,166 INFO L93 Difference]: Finished difference Result 157 states and 218 transitions. [2021-12-17 02:49:48,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 02:49:48,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-17 02:49:48,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:48,168 INFO L225 Difference]: With dead ends: 157 [2021-12-17 02:49:48,169 INFO L226 Difference]: Without dead ends: 154 [2021-12-17 02:49:48,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 02:49:48,174 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 10 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:48,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 262 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:49:48,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-12-17 02:49:48,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2021-12-17 02:49:48,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 141 states have (on average 1.4042553191489362) internal successors, (198), 142 states have internal predecessors, (198), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 8 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-17 02:49:48,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 215 transitions. [2021-12-17 02:49:48,192 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 215 transitions. Word has length 27 [2021-12-17 02:49:48,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:48,192 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 215 transitions. [2021-12-17 02:49:48,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:49:48,193 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 215 transitions. [2021-12-17 02:49:48,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-17 02:49:48,196 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:48,196 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] [2021-12-17 02:49:48,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-17 02:49:48,197 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:48,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:48,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1365306542, now seen corresponding path program 1 times [2021-12-17 02:49:48,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:48,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563654756] [2021-12-17 02:49:48,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:48,199 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:48,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:48,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:48,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563654756] [2021-12-17 02:49:48,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563654756] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:48,264 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:48,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 02:49:48,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162373649] [2021-12-17 02:49:48,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:48,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 02:49:48,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:48,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 02:49:48,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 02:49:48,266 INFO L87 Difference]: Start difference. First operand 154 states and 215 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:49:48,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:48,305 INFO L93 Difference]: Finished difference Result 200 states and 276 transitions. [2021-12-17 02:49:48,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 02:49:48,307 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-17 02:49:48,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:48,309 INFO L225 Difference]: With dead ends: 200 [2021-12-17 02:49:48,309 INFO L226 Difference]: Without dead ends: 152 [2021-12-17 02:49:48,310 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 [2021-12-17 02:49:48,312 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 5 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:48,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 269 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:49:48,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-12-17 02:49:48,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2021-12-17 02:49:48,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 140 states have (on average 1.3928571428571428) internal successors, (195), 140 states have internal predecessors, (195), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (9), 8 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-17 02:49:48,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 211 transitions. [2021-12-17 02:49:48,329 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 211 transitions. Word has length 31 [2021-12-17 02:49:48,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:48,329 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 211 transitions. [2021-12-17 02:49:48,329 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:49:48,329 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 211 transitions. [2021-12-17 02:49:48,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-17 02:49:48,332 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:48,332 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] [2021-12-17 02:49:48,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-17 02:49:48,333 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:48,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:48,334 INFO L85 PathProgramCache]: Analyzing trace with hash 52355391, now seen corresponding path program 1 times [2021-12-17 02:49:48,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:48,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044559918] [2021-12-17 02:49:48,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:48,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:48,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:48,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-17 02:49:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:48,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:48,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:48,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044559918] [2021-12-17 02:49:48,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044559918] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:48,406 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:48,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 02:49:48,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246724167] [2021-12-17 02:49:48,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:48,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 02:49:48,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:48,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 02:49:48,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 02:49:48,408 INFO L87 Difference]: Start difference. First operand 152 states and 211 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:49:48,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:48,506 INFO L93 Difference]: Finished difference Result 214 states and 290 transitions. [2021-12-17 02:49:48,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 02:49:48,507 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2021-12-17 02:49:48,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:48,507 INFO L225 Difference]: With dead ends: 214 [2021-12-17 02:49:48,508 INFO L226 Difference]: Without dead ends: 161 [2021-12-17 02:49:48,508 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-17 02:49:48,508 INFO L933 BasicCegarLoop]: 169 mSDtfsCounter, 293 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:48,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [293 Valid, 480 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:49:48,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-12-17 02:49:48,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 145. [2021-12-17 02:49:48,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 133 states have (on average 1.3909774436090225) internal successors, (185), 133 states have internal predecessors, (185), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-17 02:49:48,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 200 transitions. [2021-12-17 02:49:48,515 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 200 transitions. Word has length 33 [2021-12-17 02:49:48,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:48,515 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 200 transitions. [2021-12-17 02:49:48,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:49:48,516 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 200 transitions. [2021-12-17 02:49:48,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-17 02:49:48,516 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:48,517 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] [2021-12-17 02:49:48,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-17 02:49:48,517 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:48,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:48,517 INFO L85 PathProgramCache]: Analyzing trace with hash -572632936, now seen corresponding path program 1 times [2021-12-17 02:49:48,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:48,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019091472] [2021-12-17 02:49:48,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:48,518 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:48,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-17 02:49:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:48,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:48,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:48,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019091472] [2021-12-17 02:49:48,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019091472] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:48,575 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:48,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 02:49:48,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647114538] [2021-12-17 02:49:48,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:48,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 02:49:48,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:48,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 02:49:48,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 02:49:48,576 INFO L87 Difference]: Start difference. First operand 145 states and 200 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:49:48,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:48,690 INFO L93 Difference]: Finished difference Result 191 states and 261 transitions. [2021-12-17 02:49:48,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 02:49:48,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2021-12-17 02:49:48,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:48,692 INFO L225 Difference]: With dead ends: 191 [2021-12-17 02:49:48,692 INFO L226 Difference]: Without dead ends: 145 [2021-12-17 02:49:48,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-12-17 02:49:48,693 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 160 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:48,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 465 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:49:48,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-12-17 02:49:48,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2021-12-17 02:49:48,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 133 states have (on average 1.3834586466165413) internal successors, (184), 133 states have internal predecessors, (184), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-17 02:49:48,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 199 transitions. [2021-12-17 02:49:48,698 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 199 transitions. Word has length 37 [2021-12-17 02:49:48,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:48,699 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 199 transitions. [2021-12-17 02:49:48,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:49:48,699 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 199 transitions. [2021-12-17 02:49:48,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-17 02:49:48,700 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:48,700 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] [2021-12-17 02:49:48,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-17 02:49:48,700 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:48,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:48,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1593142548, now seen corresponding path program 1 times [2021-12-17 02:49:48,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:48,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982763459] [2021-12-17 02:49:48,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:48,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:48,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-17 02:49:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:48,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:48,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:48,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982763459] [2021-12-17 02:49:48,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982763459] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:48,740 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:48,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 02:49:48,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241571102] [2021-12-17 02:49:48,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:48,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 02:49:48,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:48,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 02:49:48,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-17 02:49:48,741 INFO L87 Difference]: Start difference. First operand 145 states and 199 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:49:48,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:48,864 INFO L93 Difference]: Finished difference Result 179 states and 240 transitions. [2021-12-17 02:49:48,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 02:49:48,865 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2021-12-17 02:49:48,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:48,865 INFO L225 Difference]: With dead ends: 179 [2021-12-17 02:49:48,866 INFO L226 Difference]: Without dead ends: 157 [2021-12-17 02:49:48,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-17 02:49:48,866 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 196 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:48,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 585 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:49:48,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-12-17 02:49:48,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 145. [2021-12-17 02:49:48,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 133 states have (on average 1.3759398496240602) internal successors, (183), 133 states have internal predecessors, (183), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-17 02:49:48,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 198 transitions. [2021-12-17 02:49:48,872 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 198 transitions. Word has length 38 [2021-12-17 02:49:48,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:48,872 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 198 transitions. [2021-12-17 02:49:48,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:49:48,872 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 198 transitions. [2021-12-17 02:49:48,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-17 02:49:48,873 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:48,873 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] [2021-12-17 02:49:48,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-17 02:49:48,874 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:48,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:48,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1687313027, now seen corresponding path program 1 times [2021-12-17 02:49:48,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:48,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492849695] [2021-12-17 02:49:48,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:48,875 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:48,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-17 02:49:48,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:48,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:48,931 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:48,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492849695] [2021-12-17 02:49:48,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492849695] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:48,932 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:48,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 02:49:48,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567925787] [2021-12-17 02:49:48,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:48,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 02:49:48,933 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:48,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 02:49:48,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 02:49:48,934 INFO L87 Difference]: Start difference. First operand 145 states and 198 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:49:48,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:48,981 INFO L93 Difference]: Finished difference Result 213 states and 290 transitions. [2021-12-17 02:49:48,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 02:49:48,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2021-12-17 02:49:48,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:48,991 INFO L225 Difference]: With dead ends: 213 [2021-12-17 02:49:48,991 INFO L226 Difference]: Without dead ends: 161 [2021-12-17 02:49:48,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-17 02:49:48,993 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 21 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:48,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 376 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:49:48,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-12-17 02:49:49,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 151. [2021-12-17 02:49:49,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 139 states have (on average 1.3669064748201438) internal successors, (190), 139 states have internal predecessors, (190), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-17 02:49:49,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 205 transitions. [2021-12-17 02:49:49,002 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 205 transitions. Word has length 39 [2021-12-17 02:49:49,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:49,003 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 205 transitions. [2021-12-17 02:49:49,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:49:49,003 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 205 transitions. [2021-12-17 02:49:49,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-17 02:49:49,004 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:49,004 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] [2021-12-17 02:49:49,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-17 02:49:49,005 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:49,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:49,005 INFO L85 PathProgramCache]: Analyzing trace with hash -986248449, now seen corresponding path program 1 times [2021-12-17 02:49:49,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:49,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342050736] [2021-12-17 02:49:49,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:49,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:49,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-17 02:49:49,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:49,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:49,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:49,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342050736] [2021-12-17 02:49:49,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342050736] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:49,058 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:49,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 02:49:49,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803548971] [2021-12-17 02:49:49,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:49,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 02:49:49,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:49,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 02:49:49,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 02:49:49,060 INFO L87 Difference]: Start difference. First operand 151 states and 205 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:49:49,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:49,121 INFO L93 Difference]: Finished difference Result 218 states and 296 transitions. [2021-12-17 02:49:49,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 02:49:49,122 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2021-12-17 02:49:49,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:49,124 INFO L225 Difference]: With dead ends: 218 [2021-12-17 02:49:49,124 INFO L226 Difference]: Without dead ends: 187 [2021-12-17 02:49:49,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-17 02:49:49,125 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 46 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:49,125 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 860 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:49:49,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-12-17 02:49:49,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 156. [2021-12-17 02:49:49,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 143 states have (on average 1.3566433566433567) internal successors, (194), 143 states have internal predecessors, (194), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-17 02:49:49,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 210 transitions. [2021-12-17 02:49:49,133 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 210 transitions. Word has length 39 [2021-12-17 02:49:49,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:49,134 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 210 transitions. [2021-12-17 02:49:49,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:49:49,134 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 210 transitions. [2021-12-17 02:49:49,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-17 02:49:49,135 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:49,135 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:49:49,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-17 02:49:49,135 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:49,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:49,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1635168586, now seen corresponding path program 1 times [2021-12-17 02:49:49,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:49,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331713133] [2021-12-17 02:49:49,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:49,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:49,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-17 02:49:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:49,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:49,196 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:49,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331713133] [2021-12-17 02:49:49,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331713133] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:49,196 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:49,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 02:49:49,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158673606] [2021-12-17 02:49:49,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:49,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 02:49:49,197 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:49,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 02:49:49,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 02:49:49,198 INFO L87 Difference]: Start difference. First operand 156 states and 210 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:49:49,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:49,241 INFO L93 Difference]: Finished difference Result 224 states and 302 transitions. [2021-12-17 02:49:49,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 02:49:49,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-12-17 02:49:49,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:49,242 INFO L225 Difference]: With dead ends: 224 [2021-12-17 02:49:49,243 INFO L226 Difference]: Without dead ends: 172 [2021-12-17 02:49:49,243 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-17 02:49:49,244 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 18 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:49,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 393 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:49:49,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-12-17 02:49:49,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 159. [2021-12-17 02:49:49,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 146 states have (on average 1.3493150684931507) internal successors, (197), 146 states have internal predecessors, (197), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-17 02:49:49,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 213 transitions. [2021-12-17 02:49:49,255 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 213 transitions. Word has length 40 [2021-12-17 02:49:49,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:49,256 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 213 transitions. [2021-12-17 02:49:49,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:49:49,256 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 213 transitions. [2021-12-17 02:49:49,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-17 02:49:49,257 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:49,257 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:49:49,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-17 02:49:49,257 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:49,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:49,257 INFO L85 PathProgramCache]: Analyzing trace with hash -934104008, now seen corresponding path program 1 times [2021-12-17 02:49:49,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:49,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891554855] [2021-12-17 02:49:49,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:49,262 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:49,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-17 02:49:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:49,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:49,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:49,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891554855] [2021-12-17 02:49:49,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891554855] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:49,296 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:49,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 02:49:49,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165826454] [2021-12-17 02:49:49,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:49,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 02:49:49,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:49,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 02:49:49,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 02:49:49,298 INFO L87 Difference]: Start difference. First operand 159 states and 213 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:49:49,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:49,342 INFO L93 Difference]: Finished difference Result 190 states and 254 transitions. [2021-12-17 02:49:49,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 02:49:49,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-12-17 02:49:49,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:49,344 INFO L225 Difference]: With dead ends: 190 [2021-12-17 02:49:49,344 INFO L226 Difference]: Without dead ends: 187 [2021-12-17 02:49:49,344 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 [2021-12-17 02:49:49,344 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 40 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:49,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 388 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:49:49,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-12-17 02:49:49,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 163. [2021-12-17 02:49:49,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 150 states have (on average 1.3533333333333333) internal successors, (203), 150 states have internal predecessors, (203), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-17 02:49:49,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 219 transitions. [2021-12-17 02:49:49,351 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 219 transitions. Word has length 40 [2021-12-17 02:49:49,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:49,351 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 219 transitions. [2021-12-17 02:49:49,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:49:49,352 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 219 transitions. [2021-12-17 02:49:49,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-17 02:49:49,353 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:49,353 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:49:49,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-17 02:49:49,353 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:49,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:49,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1582571415, now seen corresponding path program 1 times [2021-12-17 02:49:49,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:49,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259168575] [2021-12-17 02:49:49,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:49,354 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:49,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-17 02:49:49,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:49,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:49,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:49,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259168575] [2021-12-17 02:49:49,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259168575] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:49,413 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:49,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 02:49:49,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259807116] [2021-12-17 02:49:49,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:49,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 02:49:49,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:49,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 02:49:49,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 02:49:49,414 INFO L87 Difference]: Start difference. First operand 163 states and 219 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:49:49,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:49,491 INFO L93 Difference]: Finished difference Result 228 states and 305 transitions. [2021-12-17 02:49:49,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 02:49:49,492 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-12-17 02:49:49,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:49,493 INFO L225 Difference]: With dead ends: 228 [2021-12-17 02:49:49,493 INFO L226 Difference]: Without dead ends: 206 [2021-12-17 02:49:49,493 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-17 02:49:49,494 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 57 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:49,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 986 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:49:49,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-12-17 02:49:49,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 180. [2021-12-17 02:49:49,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 166 states have (on average 1.355421686746988) internal successors, (225), 166 states have internal predecessors, (225), 7 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (10), 10 states have call predecessors, (10), 4 states have call successors, (10) [2021-12-17 02:49:49,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 242 transitions. [2021-12-17 02:49:49,502 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 242 transitions. Word has length 40 [2021-12-17 02:49:49,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:49,502 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 242 transitions. [2021-12-17 02:49:49,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:49:49,502 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 242 transitions. [2021-12-17 02:49:49,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-17 02:49:49,503 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:49,503 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:49:49,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-17 02:49:49,503 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:49,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:49,504 INFO L85 PathProgramCache]: Analyzing trace with hash -760530929, now seen corresponding path program 1 times [2021-12-17 02:49:49,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:49,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736757349] [2021-12-17 02:49:49,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:49,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:49,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-17 02:49:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:49,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:49,554 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:49,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736757349] [2021-12-17 02:49:49,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736757349] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:49,554 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:49,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 02:49:49,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088587215] [2021-12-17 02:49:49,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:49,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 02:49:49,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:49,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 02:49:49,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-17 02:49:49,556 INFO L87 Difference]: Start difference. First operand 180 states and 242 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:49:49,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:49,605 INFO L93 Difference]: Finished difference Result 189 states and 253 transitions. [2021-12-17 02:49:49,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 02:49:49,606 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-12-17 02:49:49,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:49,606 INFO L225 Difference]: With dead ends: 189 [2021-12-17 02:49:49,606 INFO L226 Difference]: Without dead ends: 76 [2021-12-17 02:49:49,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-17 02:49:49,607 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 189 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:49,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 243 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:49:49,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-17 02:49:49,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2021-12-17 02:49:49,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 62 states have internal predecessors, (69), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 02:49:49,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2021-12-17 02:49:49,611 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 40 [2021-12-17 02:49:49,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:49,611 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2021-12-17 02:49:49,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:49:49,611 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2021-12-17 02:49:49,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-17 02:49:49,611 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:49,611 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:49:49,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-17 02:49:49,612 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:49,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:49,612 INFO L85 PathProgramCache]: Analyzing trace with hash 869883929, now seen corresponding path program 1 times [2021-12-17 02:49:49,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:49,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024100027] [2021-12-17 02:49:49,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:49,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:49,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-17 02:49:49,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:49,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:49,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:49,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024100027] [2021-12-17 02:49:49,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024100027] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:49,671 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:49,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 02:49:49,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409521909] [2021-12-17 02:49:49,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:49,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 02:49:49,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:49,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 02:49:49,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-17 02:49:49,672 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:49:49,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:49,718 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2021-12-17 02:49:49,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 02:49:49,718 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2021-12-17 02:49:49,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:49,719 INFO L225 Difference]: With dead ends: 70 [2021-12-17 02:49:49,719 INFO L226 Difference]: Without dead ends: 54 [2021-12-17 02:49:49,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-17 02:49:49,721 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 68 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:49,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 135 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:49:49,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-12-17 02:49:49,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2021-12-17 02:49:49,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 50 states have internal predecessors, (55), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:49:49,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2021-12-17 02:49:49,724 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 41 [2021-12-17 02:49:49,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:49,724 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2021-12-17 02:49:49,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:49:49,724 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2021-12-17 02:49:49,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-17 02:49:49,724 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:49,725 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:49:49,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-17 02:49:49,725 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:49,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:49,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1689213541, now seen corresponding path program 1 times [2021-12-17 02:49:49,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:49,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915413952] [2021-12-17 02:49:49,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:49,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:49,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:49,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-17 02:49:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:49,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:49,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:49,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915413952] [2021-12-17 02:49:49,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915413952] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:49,752 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:49,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 02:49:49,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424294964] [2021-12-17 02:49:49,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:49,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 02:49:49,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:49,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 02:49:49,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 02:49:49,753 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:49:49,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:49,769 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2021-12-17 02:49:49,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 02:49:49,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2021-12-17 02:49:49,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:49,770 INFO L225 Difference]: With dead ends: 66 [2021-12-17 02:49:49,770 INFO L226 Difference]: Without dead ends: 50 [2021-12-17 02:49:49,770 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-17 02:49:49,770 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 19 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:49,771 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 104 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:49:49,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-12-17 02:49:49,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2021-12-17 02:49:49,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:49:49,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2021-12-17 02:49:49,775 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 41 [2021-12-17 02:49:49,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:49,776 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2021-12-17 02:49:49,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:49:49,776 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2021-12-17 02:49:49,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-17 02:49:49,776 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:49,776 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:49:49,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-17 02:49:49,777 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:49,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:49,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1579234754, now seen corresponding path program 1 times [2021-12-17 02:49:49,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:49,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695429917] [2021-12-17 02:49:49,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:49,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:49,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-17 02:49:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:49,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:49,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:49,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695429917] [2021-12-17 02:49:49,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695429917] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:49,801 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:49,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 02:49:49,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700580143] [2021-12-17 02:49:49,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:49,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 02:49:49,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:49,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 02:49:49,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 02:49:49,802 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:49:49,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:49,833 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2021-12-17 02:49:49,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 02:49:49,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2021-12-17 02:49:49,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:49,834 INFO L225 Difference]: With dead ends: 96 [2021-12-17 02:49:49,834 INFO L226 Difference]: Without dead ends: 91 [2021-12-17 02:49:49,834 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-17 02:49:49,835 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 30 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:49,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 134 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:49:49,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-12-17 02:49:49,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2021-12-17 02:49:49,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 84 states have (on average 1.0714285714285714) internal successors, (90), 84 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 02:49:49,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2021-12-17 02:49:49,840 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 41 [2021-12-17 02:49:49,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:49,840 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2021-12-17 02:49:49,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:49:49,840 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2021-12-17 02:49:49,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-17 02:49:49,841 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:49,841 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:49:49,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-17 02:49:49,841 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:49,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:49,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1581081796, now seen corresponding path program 1 times [2021-12-17 02:49:49,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:49,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74183253] [2021-12-17 02:49:49,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:49,842 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:49,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-17 02:49:49,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:49,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:49,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:49,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74183253] [2021-12-17 02:49:49,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74183253] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:49,895 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:49,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 02:49:49,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157635853] [2021-12-17 02:49:49,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:49,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 02:49:49,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:49,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 02:49:49,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-17 02:49:49,897 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:49:49,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:49,926 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2021-12-17 02:49:49,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 02:49:49,926 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2021-12-17 02:49:49,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:49,927 INFO L225 Difference]: With dead ends: 99 [2021-12-17 02:49:49,927 INFO L226 Difference]: Without dead ends: 90 [2021-12-17 02:49:49,927 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-17 02:49:49,928 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 19 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:49,928 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 245 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:49:49,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-12-17 02:49:49,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2021-12-17 02:49:49,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 84 states have (on average 1.0476190476190477) internal successors, (88), 84 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 02:49:49,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2021-12-17 02:49:49,933 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 41 [2021-12-17 02:49:49,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:49,933 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2021-12-17 02:49:49,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:49:49,933 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2021-12-17 02:49:49,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-17 02:49:49,934 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:49:49,934 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:49:49,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-17 02:49:49,934 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:49:49,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:49:49,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1357815030, now seen corresponding path program 1 times [2021-12-17 02:49:49,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:49:49,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469521615] [2021-12-17 02:49:49,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:49:49,935 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:49:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:49,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-17 02:49:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:49:49,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:49:49,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:49:49,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469521615] [2021-12-17 02:49:49,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469521615] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:49:49,962 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:49:49,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 02:49:49,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751035069] [2021-12-17 02:49:49,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:49:49,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 02:49:49,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:49:49,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 02:49:49,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 02:49:49,964 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:49:49,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:49:49,976 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2021-12-17 02:49:49,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 02:49:49,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2021-12-17 02:49:49,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:49:49,977 INFO L225 Difference]: With dead ends: 90 [2021-12-17 02:49:49,977 INFO L226 Difference]: Without dead ends: 0 [2021-12-17 02:49:49,977 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 02:49:49,978 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:49:49,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 81 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:49:49,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-17 02:49:49,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-17 02:49:49,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:49:49,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-17 02:49:49,979 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2021-12-17 02:49:49,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:49:49,979 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-17 02:49:49,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 02:49:49,979 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-17 02:49:49,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-17 02:49:49,981 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 02:49:49,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-17 02:49:49,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-17 02:49:51,346 INFO L861 garLoopResultBuilder]: At program point errorFnENTRY(lines 577 584) the Hoare annotation is: true [2021-12-17 02:49:51,346 INFO L858 garLoopResultBuilder]: For program point errorFnFINAL(lines 577 584) no Hoare annotation was computed. [2021-12-17 02:49:51,346 INFO L858 garLoopResultBuilder]: For program point errorFnEXIT(lines 577 584) no Hoare annotation was computed. [2021-12-17 02:49:51,346 INFO L858 garLoopResultBuilder]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2021-12-17 02:49:51,346 INFO L858 garLoopResultBuilder]: For program point L201(lines 201 205) no Hoare annotation was computed. [2021-12-17 02:49:51,346 INFO L858 garLoopResultBuilder]: For program point L135(lines 135 273) no Hoare annotation was computed. [2021-12-17 02:49:51,346 INFO L858 garLoopResultBuilder]: For program point L102(lines 102 284) no Hoare annotation was computed. [2021-12-17 02:49:51,346 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-17 02:49:51,346 INFO L854 garLoopResultBuilder]: At program point L251(line 251) the Hoare annotation is: false [2021-12-17 02:49:51,346 INFO L858 garLoopResultBuilder]: For program point L251-1(lines 247 253) no Hoare annotation was computed. [2021-12-17 02:49:51,346 INFO L854 garLoopResultBuilder]: At program point L400(line 400) the Hoare annotation is: false [2021-12-17 02:49:51,346 INFO L854 garLoopResultBuilder]: At program point L103(lines 102 284) the Hoare annotation is: (and (not (= ~MPR3~0 1)) (= ~compRegistered~0 0) (= 1 |ULTIMATE.start_main_~__cil_tmp8~0#1|) (<= 5 ~MPR1~0) (= |ULTIMATE.start_main_~status~1#1| 0) (not (= ~SKIP1~0 ~NP~0)) (= ~s~0 ~NP~0) (= ~NP~0 1) (= ~pended~0 0)) [2021-12-17 02:49:51,346 INFO L854 garLoopResultBuilder]: At program point L70(lines 51 72) the Hoare annotation is: (and (not (= ~s~0 ~NP~0)) (not (= ~MPR3~0 1)) (= ~compRegistered~0 0) (<= 5 ~MPR1~0) (= |ULTIMATE.start_main_~status~1#1| 0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (not (= ~s~0 ~MPR3~0)) (= ~pended~0 0)) [2021-12-17 02:49:51,347 INFO L854 garLoopResultBuilder]: At program point L384(lines 377 417) the Hoare annotation is: (and (= 1 |ULTIMATE.start_main_~__cil_tmp8~0#1|) (<= 5 ~MPR1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= ~pended~0 0)) [2021-12-17 02:49:51,347 INFO L854 garLoopResultBuilder]: At program point L285(lines 75 287) the Hoare annotation is: (and (= 1 |ULTIMATE.start_main_~__cil_tmp8~0#1|) (<= 5 ~MPR1~0) (= |ULTIMATE.start_main_~status~1#1| 0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= ~pended~0 0)) [2021-12-17 02:49:51,347 INFO L858 garLoopResultBuilder]: For program point L153(lines 153 267) no Hoare annotation was computed. [2021-12-17 02:49:51,347 INFO L858 garLoopResultBuilder]: For program point L120(lines 120 278) no Hoare annotation was computed. [2021-12-17 02:49:51,347 INFO L854 garLoopResultBuilder]: At program point L236(line 236) the Hoare annotation is: false [2021-12-17 02:49:51,347 INFO L858 garLoopResultBuilder]: For program point L236-1(lines 232 238) no Hoare annotation was computed. [2021-12-17 02:49:51,347 INFO L858 garLoopResultBuilder]: For program point L550(lines 550 562) no Hoare annotation was computed. [2021-12-17 02:49:51,347 INFO L858 garLoopResultBuilder]: For program point L385(lines 369 418) no Hoare annotation was computed. [2021-12-17 02:49:51,347 INFO L858 garLoopResultBuilder]: For program point L352(lines 352 367) no Hoare annotation was computed. [2021-12-17 02:49:51,347 INFO L854 garLoopResultBuilder]: At program point L220(line 220) the Hoare annotation is: false [2021-12-17 02:49:51,347 INFO L854 garLoopResultBuilder]: At program point L187(lines 187 188) the Hoare annotation is: (and (not (= ~MPR3~0 1)) (= 1 |ULTIMATE.start_main_~__cil_tmp8~0#1|) (<= 5 ~MPR1~0) (= |ULTIMATE.start_main_~status~1#1| 0) (not (= ~SKIP1~0 ~NP~0)) (not (= 0 ~compRegistered~0)) (= ~s~0 ~NP~0) (= ~NP~0 1) (= ~pended~0 0)) [2021-12-17 02:49:51,347 INFO L858 garLoopResultBuilder]: For program point L220-1(lines 216 222) no Hoare annotation was computed. [2021-12-17 02:49:51,347 INFO L858 garLoopResultBuilder]: For program point L187-1(lines 187 188) no Hoare annotation was computed. [2021-12-17 02:49:51,347 INFO L858 garLoopResultBuilder]: For program point L171(lines 171 183) no Hoare annotation was computed. [2021-12-17 02:49:51,347 INFO L858 garLoopResultBuilder]: For program point L138(lines 138 272) no Hoare annotation was computed. [2021-12-17 02:49:51,347 INFO L858 garLoopResultBuilder]: For program point L105(lines 105 283) no Hoare annotation was computed. [2021-12-17 02:49:51,347 INFO L854 garLoopResultBuilder]: At program point L551(lines 550 562) the Hoare annotation is: (and (= 1 |ULTIMATE.start_main_~__cil_tmp8~0#1|) (<= 5 ~MPR1~0) (= |ULTIMATE.start_main_~status~1#1| 0) (not (= ~SKIP1~0 ~NP~0)) (not (= 0 ~compRegistered~0)) (= ~s~0 ~NP~0) (= ~NP~0 1) (= ~pended~0 0)) [2021-12-17 02:49:51,348 INFO L858 garLoopResultBuilder]: For program point L386(lines 386 415) no Hoare annotation was computed. [2021-12-17 02:49:51,348 INFO L854 garLoopResultBuilder]: At program point L353(lines 352 367) the Hoare annotation is: (and (not (= ~MPR3~0 1)) (= ~compRegistered~0 0) (= 1 |ULTIMATE.start_main_~__cil_tmp8~0#1|) (<= 5 ~MPR1~0) (= |ULTIMATE.start_main_~status~1#1| 0) (not (= ~SKIP1~0 ~NP~0)) (= ~s~0 ~NP~0) (= ~NP~0 1) (= ~pended~0 0)) [2021-12-17 02:49:51,348 INFO L858 garLoopResultBuilder]: For program point L370(lines 370 374) no Hoare annotation was computed. [2021-12-17 02:49:51,348 INFO L854 garLoopResultBuilder]: At program point L106(lines 105 283) the Hoare annotation is: (and (= ~compRegistered~0 0) (= 1 |ULTIMATE.start_main_~__cil_tmp8~0#1|) (<= 5 ~MPR1~0) (= |ULTIMATE.start_main_~status~1#1| 0) (not (= ~SKIP1~0 ~NP~0)) (= ~s~0 ~NP~0) (= ~NP~0 1) (= ~pended~0 0)) [2021-12-17 02:49:51,348 INFO L861 garLoopResultBuilder]: At program point L420(lines 288 422) the Hoare annotation is: true [2021-12-17 02:49:51,348 INFO L858 garLoopResultBuilder]: For program point L387(lines 387 414) no Hoare annotation was computed. [2021-12-17 02:49:51,348 INFO L858 garLoopResultBuilder]: For program point L156(lines 156 266) no Hoare annotation was computed. [2021-12-17 02:49:51,348 INFO L858 garLoopResultBuilder]: For program point L123(lines 123 277) no Hoare annotation was computed. [2021-12-17 02:49:51,348 INFO L854 garLoopResultBuilder]: At program point L536(lines 528 547) the Hoare annotation is: (and (= 1 |ULTIMATE.start_main_~__cil_tmp8~0#1|) (<= 5 ~MPR1~0) (= |ULTIMATE.start_main_~status~1#1| 0) (not (= ~SKIP1~0 ~NP~0)) (not (= 0 ~compRegistered~0)) (= ~s~0 ~NP~0) (= ~NP~0 1) (not (= ~s~0 ~MPR3~0)) (= ~pended~0 0)) [2021-12-17 02:49:51,348 INFO L858 garLoopResultBuilder]: For program point L404(lines 404 412) no Hoare annotation was computed. [2021-12-17 02:49:51,349 INFO L854 garLoopResultBuilder]: At program point L173(line 173) the Hoare annotation is: false [2021-12-17 02:49:51,349 INFO L854 garLoopResultBuilder]: At program point L553(lines 552 562) the Hoare annotation is: (and (= 1 |ULTIMATE.start_main_~__cil_tmp8~0#1|) (<= 5 ~MPR1~0) (= |ULTIMATE.start_main_~status~1#1| 0) (not (= ~SKIP1~0 ~NP~0)) (not (= 0 ~compRegistered~0)) (= ~s~0 ~NP~0) (= ~NP~0 1) (= ~pended~0 0)) [2021-12-17 02:49:51,349 INFO L858 garLoopResultBuilder]: For program point L388(lines 388 394) no Hoare annotation was computed. [2021-12-17 02:49:51,349 INFO L854 garLoopResultBuilder]: At program point L355(lines 354 367) the Hoare annotation is: (= |ULTIMATE.start_main_~status~1#1| 0) [2021-12-17 02:49:51,349 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-17 02:49:51,349 INFO L858 garLoopResultBuilder]: For program point L405(lines 405 407) no Hoare annotation was computed. [2021-12-17 02:49:51,349 INFO L858 garLoopResultBuilder]: For program point L141(lines 141 271) no Hoare annotation was computed. [2021-12-17 02:49:51,349 INFO L858 garLoopResultBuilder]: For program point L108(lines 108 282) no Hoare annotation was computed. [2021-12-17 02:49:51,349 INFO L858 garLoopResultBuilder]: For program point L389(lines 389 391) no Hoare annotation was computed. [2021-12-17 02:49:51,349 INFO L858 garLoopResultBuilder]: For program point L323(lines 323 368) no Hoare annotation was computed. [2021-12-17 02:49:51,349 INFO L854 garLoopResultBuilder]: At program point L323-1(lines 297 421) the Hoare annotation is: (and (= 1 |ULTIMATE.start_main_~__cil_tmp8~0#1|) (<= 5 ~MPR1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= ~pended~0 0)) [2021-12-17 02:49:51,349 INFO L854 garLoopResultBuilder]: At program point L257(lines 257 258) the Hoare annotation is: (and (= ~compRegistered~0 0) (= 1 |ULTIMATE.start_main_~__cil_tmp8~0#1|) (<= 5 ~MPR1~0) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~s~0 ~SKIP1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= ~pended~0 0)) [2021-12-17 02:49:51,349 INFO L858 garLoopResultBuilder]: For program point L257-1(lines 257 258) no Hoare annotation was computed. [2021-12-17 02:49:51,349 INFO L858 garLoopResultBuilder]: For program point L505(lines 505 511) no Hoare annotation was computed. [2021-12-17 02:49:51,349 INFO L858 garLoopResultBuilder]: For program point L340(lines 340 345) no Hoare annotation was computed. [2021-12-17 02:49:51,349 INFO L858 garLoopResultBuilder]: For program point L340-2(lines 339 349) no Hoare annotation was computed. [2021-12-17 02:49:51,349 INFO L854 garLoopResultBuilder]: At program point L109(lines 108 282) the Hoare annotation is: (and (= ~compRegistered~0 0) (= 1 |ULTIMATE.start_main_~__cil_tmp8~0#1|) (<= 5 ~MPR1~0) (= |ULTIMATE.start_main_~status~1#1| 0) (not (= ~SKIP1~0 ~NP~0)) (= ~s~0 ~NP~0) (= ~NP~0 1) (= ~pended~0 0)) [2021-12-17 02:49:51,350 INFO L858 garLoopResultBuilder]: For program point L192(lines 192 198) no Hoare annotation was computed. [2021-12-17 02:49:51,350 INFO L858 garLoopResultBuilder]: For program point L159(lines 159 265) no Hoare annotation was computed. [2021-12-17 02:49:51,350 INFO L858 garLoopResultBuilder]: For program point L126(lines 126 276) no Hoare annotation was computed. [2021-12-17 02:49:51,350 INFO L858 garLoopResultBuilder]: For program point L192-2(lines 166 261) no Hoare annotation was computed. [2021-12-17 02:49:51,350 INFO L854 garLoopResultBuilder]: At program point L242(line 242) the Hoare annotation is: (and (= ~compRegistered~0 0) (= 1 |ULTIMATE.start_main_~__cil_tmp8~0#1|) (<= 5 ~MPR1~0) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~s~0 ~SKIP1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= ~pended~0 0)) [2021-12-17 02:49:51,350 INFO L858 garLoopResultBuilder]: For program point L242-1(line 242) no Hoare annotation was computed. [2021-12-17 02:49:51,350 INFO L858 garLoopResultBuilder]: For program point L176(lines 176 182) no Hoare annotation was computed. [2021-12-17 02:49:51,350 INFO L858 garLoopResultBuilder]: For program point L176-1(lines 171 183) no Hoare annotation was computed. [2021-12-17 02:49:51,350 INFO L854 garLoopResultBuilder]: At program point L523(lines 523 564) the Hoare annotation is: (and (= 1 |ULTIMATE.start_main_~__cil_tmp8~0#1|) (<= 5 ~MPR1~0) (= |ULTIMATE.start_main_~status~1#1| 0) (not (= ~SKIP1~0 ~NP~0)) (not (= 0 ~compRegistered~0)) (= ~s~0 ~NP~0) (= ~NP~0 1) (= ~pended~0 0)) [2021-12-17 02:49:51,350 INFO L854 garLoopResultBuilder]: At program point L226(lines 226 227) the Hoare annotation is: (and (= ~compRegistered~0 0) (= 1 |ULTIMATE.start_main_~__cil_tmp8~0#1|) (<= 5 ~MPR1~0) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~s~0 ~SKIP1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= ~pended~0 0)) [2021-12-17 02:49:51,350 INFO L858 garLoopResultBuilder]: For program point L226-1(lines 226 227) no Hoare annotation was computed. [2021-12-17 02:49:51,350 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-17 02:49:51,350 INFO L858 garLoopResultBuilder]: For program point L144(lines 144 270) no Hoare annotation was computed. [2021-12-17 02:49:51,350 INFO L858 garLoopResultBuilder]: For program point L111(lines 111 281) no Hoare annotation was computed. [2021-12-17 02:49:51,350 INFO L858 garLoopResultBuilder]: For program point L541(lines 541 545) no Hoare annotation was computed. [2021-12-17 02:49:51,350 INFO L858 garLoopResultBuilder]: For program point L541-1(lines 528 547) no Hoare annotation was computed. [2021-12-17 02:49:51,350 INFO L858 garLoopResultBuilder]: For program point L409(lines 409 411) no Hoare annotation was computed. [2021-12-17 02:49:51,350 INFO L854 garLoopResultBuilder]: At program point L376(lines 369 418) the Hoare annotation is: (and (= 1 |ULTIMATE.start_main_~__cil_tmp8~0#1|) (<= 5 ~MPR1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= ~pended~0 0)) [2021-12-17 02:49:51,350 INFO L854 garLoopResultBuilder]: At program point L178(line 178) the Hoare annotation is: false [2021-12-17 02:49:51,351 INFO L858 garLoopResultBuilder]: For program point L162(lines 162 264) no Hoare annotation was computed. [2021-12-17 02:49:51,351 INFO L858 garLoopResultBuilder]: For program point L129(lines 129 275) no Hoare annotation was computed. [2021-12-17 02:49:51,351 INFO L854 garLoopResultBuilder]: At program point L509(line 509) the Hoare annotation is: false [2021-12-17 02:49:51,351 INFO L854 garLoopResultBuilder]: At program point L509-1(lines 501 514) the Hoare annotation is: (and (= 1 |ULTIMATE.start_main_~__cil_tmp8~0#1|) (<= 5 ~MPR1~0) (= |ULTIMATE.start_main_~status~1#1| 0) (not (= ~SKIP1~0 ~NP~0)) (not (= 0 ~compRegistered~0)) (= ~NP~0 1) (= ~pended~0 0)) [2021-12-17 02:49:51,351 INFO L854 garLoopResultBuilder]: At program point L262(lines 166 263) the Hoare annotation is: (and (= 1 |ULTIMATE.start_main_~__cil_tmp8~0#1|) (<= 5 ~MPR1~0) (= |ULTIMATE.start_main_~status~1#1| 0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= ~pended~0 0)) [2021-12-17 02:49:51,351 INFO L854 garLoopResultBuilder]: At program point L543(line 543) the Hoare annotation is: false [2021-12-17 02:49:51,351 INFO L858 garLoopResultBuilder]: For program point L378(lines 378 382) no Hoare annotation was computed. [2021-12-17 02:49:51,351 INFO L858 garLoopResultBuilder]: For program point L147(lines 147 269) no Hoare annotation was computed. [2021-12-17 02:49:51,351 INFO L858 garLoopResultBuilder]: For program point L114(lines 114 280) no Hoare annotation was computed. [2021-12-17 02:49:51,351 INFO L854 garLoopResultBuilder]: At program point L48(lines 37 50) the Hoare annotation is: (and (not (= ~MPR3~0 1)) (= ~compRegistered~0 0) (<= 5 ~MPR1~0) (= |ULTIMATE.start_main_~status~1#1| 0) (not (= ~SKIP1~0 ~NP~0)) (= ~s~0 ~NP~0) (= ~NP~0 1) (= ~pended~0 0)) [2021-12-17 02:49:51,351 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-17 02:49:51,351 INFO L858 garLoopResultBuilder]: For program point L528(lines 528 547) no Hoare annotation was computed. [2021-12-17 02:49:51,351 INFO L854 garLoopResultBuilder]: At program point L396(lines 387 414) the Hoare annotation is: (and (= 1 |ULTIMATE.start_main_~__cil_tmp8~0#1|) (<= 5 ~MPR1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= ~pended~0 0)) [2021-12-17 02:49:51,351 INFO L854 garLoopResultBuilder]: At program point L165(lines 111 281) the Hoare annotation is: (and (= ~compRegistered~0 0) (= 1 |ULTIMATE.start_main_~__cil_tmp8~0#1|) (<= 5 ~MPR1~0) (= |ULTIMATE.start_main_~status~1#1| 0) (not (= ~SKIP1~0 ~NP~0)) (= ~s~0 ~NP~0) (= ~NP~0 1) (= ~pended~0 0)) [2021-12-17 02:49:51,351 INFO L858 garLoopResultBuilder]: For program point L132(lines 132 274) no Hoare annotation was computed. [2021-12-17 02:49:51,351 INFO L858 garLoopResultBuilder]: For program point L529(lines 529 534) no Hoare annotation was computed. [2021-12-17 02:49:51,351 INFO L858 garLoopResultBuilder]: For program point L232(lines 232 238) no Hoare annotation was computed. [2021-12-17 02:49:51,351 INFO L858 garLoopResultBuilder]: For program point L216(lines 216 222) no Hoare annotation was computed. [2021-12-17 02:49:51,351 INFO L858 garLoopResultBuilder]: For program point L150(lines 150 268) no Hoare annotation was computed. [2021-12-17 02:49:51,352 INFO L858 garLoopResultBuilder]: For program point L117(lines 117 279) no Hoare annotation was computed. [2021-12-17 02:49:51,352 INFO L858 garLoopResultBuilder]: For program point L398(lines 398 402) no Hoare annotation was computed. [2021-12-17 02:49:51,352 INFO L858 garLoopResultBuilder]: For program point L332(lines 332 335) no Hoare annotation was computed. [2021-12-17 02:49:51,352 INFO L858 garLoopResultBuilder]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2021-12-17 02:49:51,352 INFO L858 garLoopResultBuilder]: For program point L200(lines 200 206) no Hoare annotation was computed. [2021-12-17 02:49:51,352 INFO L854 garLoopResultBuilder]: At program point L457(lines 456 473) the Hoare annotation is: (let ((.cse0 (not (<= 5 ~MPR1~0))) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (= ~pended~0 0))) (.cse3 (= ~SKIP1~0 ~NP~0))) (and (or .cse0 (= 0 ~compRegistered~0) (not (= |old(~s~0)| ~NP~0)) .cse1 (= ~s~0 ~MPR1~0) (= ~MPR3~0 1) .cse2 .cse3) (or (not (= |old(~s~0)| ~SKIP1~0)) .cse0 .cse1 (not (= ~compRegistered~0 0)) .cse2 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~SKIP1~0)) .cse3))) [2021-12-17 02:49:51,352 INFO L858 garLoopResultBuilder]: For program point L445(lines 445 448) no Hoare annotation was computed. [2021-12-17 02:49:51,352 INFO L854 garLoopResultBuilder]: At program point L573(lines 565 575) the Hoare annotation is: (let ((.cse0 (not (<= 5 ~MPR1~0))) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (= ~pended~0 0))) (.cse3 (= ~SKIP1~0 ~NP~0))) (and (or .cse0 (= 0 ~compRegistered~0) (not (= |old(~s~0)| ~NP~0)) .cse1 (and (= ~s~0 ~NP~0) (= ~setEventCalled~0 1)) (= ~MPR3~0 1) .cse2 .cse3) (or (not (= |old(~s~0)| ~SKIP1~0)) .cse0 .cse1 (not (= ~compRegistered~0 0)) .cse2 .cse3))) [2021-12-17 02:49:51,352 INFO L858 garLoopResultBuilder]: For program point L445-2(lines 445 448) no Hoare annotation was computed. [2021-12-17 02:49:51,352 INFO L854 garLoopResultBuilder]: At program point IofCallDriverENTRY(lines 437 500) the Hoare annotation is: (let ((.cse0 (not (<= 5 ~MPR1~0))) (.cse1 (not (= ~NP~0 1))) (.cse3 (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (.cse4 (= ~setEventCalled~0 |old(~setEventCalled~0)|)) (.cse2 (not (= ~pended~0 0))) (.cse5 (= ~SKIP1~0 ~NP~0))) (and (or (not (= |old(~s~0)| ~SKIP1~0)) .cse0 .cse1 (not (= ~compRegistered~0 0)) .cse2 (and .cse3 .cse4 (= ~s~0 ~SKIP1~0)) .cse5) (or .cse0 (= 0 ~compRegistered~0) (not (= |old(~s~0)| ~NP~0)) .cse1 (and .cse3 .cse4 (= ~s~0 ~NP~0)) (= ~MPR3~0 1) .cse2 .cse5))) [2021-12-17 02:49:51,352 INFO L854 garLoopResultBuilder]: At program point L520(lines 515 522) the Hoare annotation is: (let ((.cse0 (not (<= 5 ~MPR1~0))) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (= ~pended~0 0))) (.cse3 (= ~SKIP1~0 ~NP~0))) (and (or .cse0 (= 0 ~compRegistered~0) (not (= |old(~s~0)| ~NP~0)) .cse1 (and (= ~s~0 ~NP~0) (= ~setEventCalled~0 1)) (= ~MPR3~0 1) .cse2 .cse3) (or (not (= |old(~s~0)| ~SKIP1~0)) .cse0 .cse1 (not (= ~compRegistered~0 0)) .cse2 .cse3))) [2021-12-17 02:49:51,352 INFO L858 garLoopResultBuilder]: For program point IofCallDriverFINAL(lines 437 500) no Hoare annotation was computed. [2021-12-17 02:49:51,352 INFO L858 garLoopResultBuilder]: For program point L479(lines 479 496) no Hoare annotation was computed. [2021-12-17 02:49:51,352 INFO L854 garLoopResultBuilder]: At program point L471(lines 444 499) the Hoare annotation is: (let ((.cse8 (<= (+ |IofCallDriver_~returnVal2~0#1| 1073741823) 0)) (.cse1 (<= 259 |IofCallDriver_~returnVal2~0#1|)) (.cse4 (not (<= 5 ~MPR1~0))) (.cse7 (= |IofCallDriver_~returnVal2~0#1| 0)) (.cse5 (not (= ~NP~0 1))) (.cse6 (not (= ~pended~0 0))) (.cse9 (= ~SKIP1~0 ~NP~0))) (and (let ((.cse0 (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (.cse2 (= ~setEventCalled~0 |old(~setEventCalled~0)|)) (.cse3 (= ~s~0 ~SKIP1~0))) (or (and .cse0 .cse1 .cse2 .cse3) (not (= |old(~s~0)| ~SKIP1~0)) .cse4 .cse5 (not (= ~compRegistered~0 0)) .cse6 (and .cse0 .cse7 .cse2 .cse3) (and .cse0 .cse2 .cse3 .cse8) .cse9)) (let ((.cse10 (= ~s~0 ~MPR1~0))) (or (and .cse10 .cse8) (and .cse1 (<= |IofCallDriver_~returnVal2~0#1| 259) .cse10 (= ~setEventCalled~0 1)) .cse4 (= 0 ~compRegistered~0) (and .cse7 .cse10) (not (= |old(~s~0)| ~NP~0)) .cse5 (= ~MPR3~0 1) .cse6 .cse9)))) [2021-12-17 02:49:51,352 INFO L858 garLoopResultBuilder]: For program point IofCallDriverEXIT(lines 437 500) no Hoare annotation was computed. [2021-12-17 02:49:51,352 INFO L854 garLoopResultBuilder]: At program point L459(lines 458 473) the Hoare annotation is: (let ((.cse0 (not (<= 5 ~MPR1~0))) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (= ~pended~0 0))) (.cse3 (= ~SKIP1~0 ~NP~0))) (and (or (and (= ~s~0 ~MPR1~0) (= ~setEventCalled~0 1)) .cse0 (= 0 ~compRegistered~0) (not (= |old(~s~0)| ~NP~0)) .cse1 (= ~MPR3~0 1) .cse2 .cse3) (or (not (= |old(~s~0)| ~SKIP1~0)) .cse0 .cse1 (not (= ~compRegistered~0 0)) .cse2 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~SKIP1~0)) .cse3))) [2021-12-17 02:49:51,352 INFO L858 garLoopResultBuilder]: For program point L488(lines 488 495) no Hoare annotation was computed. [2021-12-17 02:49:51,353 INFO L858 garLoopResultBuilder]: For program point L451(lines 451 474) no Hoare annotation was computed. [2021-12-17 02:49:51,353 INFO L858 garLoopResultBuilder]: For program point L480(lines 480 486) no Hoare annotation was computed. [2021-12-17 02:49:51,353 INFO L854 garLoopResultBuilder]: At program point L431(line 431) the Hoare annotation is: (let ((.cse0 (not (<= 5 ~MPR1~0))) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (= ~pended~0 0))) (.cse3 (= ~SKIP1~0 ~NP~0))) (and (or (not (= |old(~s~0)| ~SKIP1~0)) .cse0 .cse1 (not (= ~compRegistered~0 0)) .cse2 .cse3) (or .cse0 (= 0 ~compRegistered~0) (not (= |old(~s~0)| ~NP~0)) .cse1 (= ~MPR3~0 1) .cse2 .cse3))) [2021-12-17 02:49:51,353 INFO L854 garLoopResultBuilder]: At program point L431-1(lines 423 436) the Hoare annotation is: (let ((.cse0 (not (<= 5 ~MPR1~0))) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (= ~pended~0 0))) (.cse3 (= ~SKIP1~0 ~NP~0))) (and (or (and (= ~s~0 ~MPR1~0) (= ~setEventCalled~0 1)) .cse0 (= 0 ~compRegistered~0) (not (= |old(~s~0)| ~NP~0)) .cse1 (= ~MPR3~0 1) .cse2 .cse3) (or (not (= |old(~s~0)| ~SKIP1~0)) .cse0 .cse1 (not (= ~compRegistered~0 0)) .cse2 .cse3))) [2021-12-17 02:49:51,353 INFO L854 garLoopResultBuilder]: At program point L493(line 493) the Hoare annotation is: (let ((.cse0 (not (<= 5 ~MPR1~0))) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (= ~pended~0 0))) (.cse3 (= ~SKIP1~0 ~NP~0))) (and (or (not (= |old(~s~0)| ~SKIP1~0)) .cse0 .cse1 (not (= ~compRegistered~0 0)) .cse2 .cse3) (or .cse0 (= 0 ~compRegistered~0) (not (= |old(~s~0)| ~NP~0)) .cse1 (= ~MPR3~0 1) .cse2 .cse3))) [2021-12-17 02:49:51,353 INFO L858 garLoopResultBuilder]: For program point L493-1(lines 475 497) no Hoare annotation was computed. [2021-12-17 02:49:51,353 INFO L858 garLoopResultBuilder]: For program point L427(lines 427 433) no Hoare annotation was computed. [2021-12-17 02:49:51,353 INFO L858 garLoopResultBuilder]: For program point L456(lines 456 473) no Hoare annotation was computed. [2021-12-17 02:49:51,353 INFO L854 garLoopResultBuilder]: At program point L452(lines 451 474) the Hoare annotation is: (let ((.cse0 (not (<= 5 ~MPR1~0))) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (= ~pended~0 0))) (.cse3 (= ~SKIP1~0 ~NP~0))) (and (or .cse0 (= 0 ~compRegistered~0) (not (= |old(~s~0)| ~NP~0)) .cse1 (= ~s~0 ~MPR1~0) (= ~MPR3~0 1) .cse2 .cse3) (or (not (= |old(~s~0)| ~SKIP1~0)) .cse0 .cse1 (not (= ~compRegistered~0 0)) .cse2 (and (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 ~SKIP1~0)) .cse3))) [2021-12-17 02:49:51,355 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] [2021-12-17 02:49:51,356 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 02:49:51,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 02:49:51 BoogieIcfgContainer [2021-12-17 02:49:51,374 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 02:49:51,374 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 02:49:51,374 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 02:49:51,375 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 02:49:51,375 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:49:47" (3/4) ... [2021-12-17 02:49:51,377 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-17 02:49:51,380 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2021-12-17 02:49:51,380 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2021-12-17 02:49:51,386 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2021-12-17 02:49:51,386 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2021-12-17 02:49:51,387 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-12-17 02:49:51,388 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-17 02:49:51,401 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((s == MPR1 && setEventCalled == 1) || !(5 <= MPR1)) || 0 == compRegistered) || !(\old(s) == NP)) || !(NP == 1)) || MPR3 == 1) || !(pended == 0)) || SKIP1 == NP) && (((((!(\old(s) == SKIP1) || !(5 <= MPR1)) || !(NP == 1)) || !(compRegistered == 0)) || !(pended == 0)) || SKIP1 == NP) [2021-12-17 02:49:51,402 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(5 <= MPR1) || 0 == compRegistered) || !(\old(s) == NP)) || !(NP == 1)) || s == MPR1) || MPR3 == 1) || !(pended == 0)) || SKIP1 == NP) && ((((((!(\old(s) == SKIP1) || !(5 <= MPR1)) || !(NP == 1)) || !(compRegistered == 0)) || !(pended == 0)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && s == SKIP1)) || SKIP1 == NP) [2021-12-17 02:49:51,402 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((lowerDriverReturn == \old(lowerDriverReturn) && 259 <= returnVal2) && setEventCalled == \old(setEventCalled)) && s == SKIP1) || !(\old(s) == SKIP1)) || !(5 <= MPR1)) || !(NP == 1)) || !(compRegistered == 0)) || !(pended == 0)) || (((lowerDriverReturn == \old(lowerDriverReturn) && returnVal2 == 0) && setEventCalled == \old(setEventCalled)) && s == SKIP1)) || (((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && s == SKIP1) && returnVal2 + 1073741823 <= 0)) || SKIP1 == NP) && ((((((((((s == MPR1 && returnVal2 + 1073741823 <= 0) || (((259 <= returnVal2 && returnVal2 <= 259) && s == MPR1) && setEventCalled == 1)) || !(5 <= MPR1)) || 0 == compRegistered) || (returnVal2 == 0 && s == MPR1)) || !(\old(s) == NP)) || !(NP == 1)) || MPR3 == 1) || !(pended == 0)) || SKIP1 == NP) [2021-12-17 02:49:51,403 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(5 <= MPR1) || 0 == compRegistered) || !(\old(s) == NP)) || !(NP == 1)) || s == MPR1) || MPR3 == 1) || !(pended == 0)) || SKIP1 == NP) && ((((((!(\old(s) == SKIP1) || !(5 <= MPR1)) || !(NP == 1)) || !(compRegistered == 0)) || !(pended == 0)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && s == SKIP1)) || SKIP1 == NP) [2021-12-17 02:49:51,403 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((s == MPR1 && setEventCalled == 1) || !(5 <= MPR1)) || 0 == compRegistered) || !(\old(s) == NP)) || !(NP == 1)) || MPR3 == 1) || !(pended == 0)) || SKIP1 == NP) && ((((((!(\old(s) == SKIP1) || !(5 <= MPR1)) || !(NP == 1)) || !(compRegistered == 0)) || !(pended == 0)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && s == SKIP1)) || SKIP1 == NP) [2021-12-17 02:49:51,403 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(5 <= MPR1) || 0 == compRegistered) || !(\old(s) == NP)) || !(NP == 1)) || (s == NP && setEventCalled == 1)) || MPR3 == 1) || !(pended == 0)) || SKIP1 == NP) && (((((!(\old(s) == SKIP1) || !(5 <= MPR1)) || !(NP == 1)) || !(compRegistered == 0)) || !(pended == 0)) || SKIP1 == NP) [2021-12-17 02:49:51,403 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(5 <= MPR1) || 0 == compRegistered) || !(\old(s) == NP)) || !(NP == 1)) || (s == NP && setEventCalled == 1)) || MPR3 == 1) || !(pended == 0)) || SKIP1 == NP) && (((((!(\old(s) == SKIP1) || !(5 <= MPR1)) || !(NP == 1)) || !(compRegistered == 0)) || !(pended == 0)) || SKIP1 == NP) [2021-12-17 02:49:51,431 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 02:49:51,431 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 02:49:51,431 INFO L158 Benchmark]: Toolchain (without parser) took 4859.11ms. Allocated memory was 98.6MB in the beginning and 144.7MB in the end (delta: 46.1MB). Free memory was 67.6MB in the beginning and 67.1MB in the end (delta: 540.6kB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. [2021-12-17 02:49:51,432 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 75.5MB. Free memory is still 37.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 02:49:51,432 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.19ms. Allocated memory is still 98.6MB. Free memory was 67.4MB in the beginning and 71.6MB in the end (delta: -4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 02:49:51,432 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.26ms. Allocated memory is still 98.6MB. Free memory was 71.6MB in the beginning and 69.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 02:49:51,432 INFO L158 Benchmark]: Boogie Preprocessor took 38.77ms. Allocated memory is still 98.6MB. Free memory was 69.2MB in the beginning and 67.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 02:49:51,433 INFO L158 Benchmark]: RCFGBuilder took 570.65ms. Allocated memory is still 98.6MB. Free memory was 67.1MB in the beginning and 74.0MB in the end (delta: -6.9MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. [2021-12-17 02:49:51,433 INFO L158 Benchmark]: TraceAbstraction took 3874.75ms. Allocated memory was 98.6MB in the beginning and 144.7MB in the end (delta: 46.1MB). Free memory was 73.4MB in the beginning and 76.5MB in the end (delta: -3.1MB). Peak memory consumption was 70.9MB. Max. memory is 16.1GB. [2021-12-17 02:49:51,433 INFO L158 Benchmark]: Witness Printer took 56.80ms. Allocated memory is still 144.7MB. Free memory was 76.5MB in the beginning and 67.1MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-17 02:49:51,434 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.15ms. Allocated memory is still 75.5MB. Free memory is still 37.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.19ms. Allocated memory is still 98.6MB. Free memory was 67.4MB in the beginning and 71.6MB in the end (delta: -4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.26ms. Allocated memory is still 98.6MB. Free memory was 71.6MB in the beginning and 69.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.77ms. Allocated memory is still 98.6MB. Free memory was 69.2MB in the beginning and 67.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 570.65ms. Allocated memory is still 98.6MB. Free memory was 67.1MB in the beginning and 74.0MB in the end (delta: -6.9MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3874.75ms. Allocated memory was 98.6MB in the beginning and 144.7MB in the end (delta: 46.1MB). Free memory was 73.4MB in the beginning and 76.5MB in the end (delta: -3.1MB). Peak memory consumption was 70.9MB. Max. memory is 16.1GB. * Witness Printer took 56.80ms. Allocated memory is still 144.7MB. Free memory was 76.5MB in the beginning and 67.1MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 581]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 121 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1523 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1514 mSDsluCounter, 6707 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4288 mSDsCounter, 180 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1200 IncrementalHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 180 mSolverCounterUnsat, 2419 mSDtfsCounter, 1200 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=13, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 199 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 43 LocationsWithAnnotation, 175 PreInvPairs, 238 NumberOfFragments, 1227 HoareAnnotationTreeSize, 175 FomulaSimplifications, 202 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 43 FomulaSimplificationsInter, 3605 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 662 NumberOfCodeBlocks, 662 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 643 ConstructedInterpolants, 0 QuantifiedInterpolants, 1477 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 354]: Loop Invariant Derived loop invariant: status == 0 - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 423]: Loop Invariant Derived loop invariant: ((((((((s == MPR1 && setEventCalled == 1) || !(5 <= MPR1)) || 0 == compRegistered) || !(\old(s) == NP)) || !(NP == 1)) || MPR3 == 1) || !(pended == 0)) || SKIP1 == NP) && (((((!(\old(s) == SKIP1) || !(5 <= MPR1)) || !(NP == 1)) || !(compRegistered == 0)) || !(pended == 0)) || SKIP1 == NP) - InvariantResult [Line: 444]: Loop Invariant Derived loop invariant: (((((((((((lowerDriverReturn == \old(lowerDriverReturn) && 259 <= returnVal2) && setEventCalled == \old(setEventCalled)) && s == SKIP1) || !(\old(s) == SKIP1)) || !(5 <= MPR1)) || !(NP == 1)) || !(compRegistered == 0)) || !(pended == 0)) || (((lowerDriverReturn == \old(lowerDriverReturn) && returnVal2 == 0) && setEventCalled == \old(setEventCalled)) && s == SKIP1)) || (((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && s == SKIP1) && returnVal2 + 1073741823 <= 0)) || SKIP1 == NP) && ((((((((((s == MPR1 && returnVal2 + 1073741823 <= 0) || (((259 <= returnVal2 && returnVal2 <= 259) && s == MPR1) && setEventCalled == 1)) || !(5 <= MPR1)) || 0 == compRegistered) || (returnVal2 == 0 && s == MPR1)) || !(\old(s) == NP)) || !(NP == 1)) || MPR3 == 1) || !(pended == 0)) || SKIP1 == NP) - InvariantResult [Line: 458]: Loop Invariant Derived loop invariant: ((((((((s == MPR1 && setEventCalled == 1) || !(5 <= MPR1)) || 0 == compRegistered) || !(\old(s) == NP)) || !(NP == 1)) || MPR3 == 1) || !(pended == 0)) || SKIP1 == NP) && ((((((!(\old(s) == SKIP1) || !(5 <= MPR1)) || !(NP == 1)) || !(compRegistered == 0)) || !(pended == 0)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && s == SKIP1)) || SKIP1 == NP) - InvariantResult [Line: 369]: Loop Invariant Derived loop invariant: (((1 == __cil_tmp8 && 5 <= MPR1) && !(SKIP1 == NP)) && NP == 1) && pended == 0 - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: ((((((compRegistered == 0 && 1 == __cil_tmp8) && 5 <= MPR1) && status == 0) && !(SKIP1 == NP)) && s == NP) && NP == 1) && pended == 0 - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: ((((((1 == __cil_tmp8 && 5 <= MPR1) && status == 0) && !(SKIP1 == NP)) && !(0 == compRegistered)) && s == NP) && NP == 1) && pended == 0 - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: ((((((compRegistered == 0 && 1 == __cil_tmp8) && 5 <= MPR1) && status == 0) && !(SKIP1 == NP)) && s == NP) && NP == 1) && pended == 0 - InvariantResult [Line: 523]: Loop Invariant Derived loop invariant: ((((((1 == __cil_tmp8 && 5 <= MPR1) && status == 0) && !(SKIP1 == NP)) && !(0 == compRegistered)) && s == NP) && NP == 1) && pended == 0 - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: ((((1 == __cil_tmp8 && 5 <= MPR1) && status == 0) && !(SKIP1 == NP)) && NP == 1) && pended == 0 - InvariantResult [Line: 501]: Loop Invariant Derived loop invariant: (((((1 == __cil_tmp8 && 5 <= MPR1) && status == 0) && !(SKIP1 == NP)) && !(0 == compRegistered)) && NP == 1) && pended == 0 - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((((((!(MPR3 == 1) && compRegistered == 0) && 5 <= MPR1) && status == 0) && !(SKIP1 == NP)) && s == NP) && NP == 1) && pended == 0 - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((((((compRegistered == 0 && 1 == __cil_tmp8) && 5 <= MPR1) && status == 0) && !(SKIP1 == NP)) && s == NP) && NP == 1) && pended == 0 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (((((((!(MPR3 == 1) && compRegistered == 0) && 1 == __cil_tmp8) && 5 <= MPR1) && status == 0) && !(SKIP1 == NP)) && s == NP) && NP == 1) && pended == 0 - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: (((1 == __cil_tmp8 && 5 <= MPR1) && !(SKIP1 == NP)) && NP == 1) && pended == 0 - InvariantResult [Line: 297]: Loop Invariant Derived loop invariant: (((1 == __cil_tmp8 && 5 <= MPR1) && !(SKIP1 == NP)) && NP == 1) && pended == 0 - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: ((((1 == __cil_tmp8 && 5 <= MPR1) && status == 0) && !(SKIP1 == NP)) && NP == 1) && pended == 0 - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: (((((((!(MPR3 == 1) && compRegistered == 0) && 1 == __cil_tmp8) && 5 <= MPR1) && status == 0) && !(SKIP1 == NP)) && s == NP) && NP == 1) && pended == 0 - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: (((((((!(5 <= MPR1) || 0 == compRegistered) || !(\old(s) == NP)) || !(NP == 1)) || (s == NP && setEventCalled == 1)) || MPR3 == 1) || !(pended == 0)) || SKIP1 == NP) && (((((!(\old(s) == SKIP1) || !(5 <= MPR1)) || !(NP == 1)) || !(compRegistered == 0)) || !(pended == 0)) || SKIP1 == NP) - InvariantResult [Line: 565]: Loop Invariant Derived loop invariant: (((((((!(5 <= MPR1) || 0 == compRegistered) || !(\old(s) == NP)) || !(NP == 1)) || (s == NP && setEventCalled == 1)) || MPR3 == 1) || !(pended == 0)) || SKIP1 == NP) && (((((!(\old(s) == SKIP1) || !(5 <= MPR1)) || !(NP == 1)) || !(compRegistered == 0)) || !(pended == 0)) || SKIP1 == NP) - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: (((((((!(5 <= MPR1) || 0 == compRegistered) || !(\old(s) == NP)) || !(NP == 1)) || s == MPR1) || MPR3 == 1) || !(pended == 0)) || SKIP1 == NP) && ((((((!(\old(s) == SKIP1) || !(5 <= MPR1)) || !(NP == 1)) || !(compRegistered == 0)) || !(pended == 0)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && s == SKIP1)) || SKIP1 == NP) - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: ((((((1 == __cil_tmp8 && 5 <= MPR1) && status == 0) && !(SKIP1 == NP)) && !(0 == compRegistered)) && s == NP) && NP == 1) && pended == 0 - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: (((((((!(5 <= MPR1) || 0 == compRegistered) || !(\old(s) == NP)) || !(NP == 1)) || s == MPR1) || MPR3 == 1) || !(pended == 0)) || SKIP1 == NP) && ((((((!(\old(s) == SKIP1) || !(5 <= MPR1)) || !(NP == 1)) || !(compRegistered == 0)) || !(pended == 0)) || ((lowerDriverReturn == \old(lowerDriverReturn) && setEventCalled == \old(setEventCalled)) && s == SKIP1)) || SKIP1 == NP) - InvariantResult [Line: 377]: Loop Invariant Derived loop invariant: (((1 == __cil_tmp8 && 5 <= MPR1) && !(SKIP1 == NP)) && NP == 1) && pended == 0 - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: (((((((1 == __cil_tmp8 && 5 <= MPR1) && status == 0) && !(SKIP1 == NP)) && !(0 == compRegistered)) && s == NP) && NP == 1) && !(s == MPR3)) && pended == 0 - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: (((((((!(s == NP) && !(MPR3 == 1)) && compRegistered == 0) && 5 <= MPR1) && status == 0) && !(SKIP1 == NP)) && NP == 1) && !(s == MPR3)) && pended == 0 RESULT: Ultimate proved your program to be correct! [2021-12-17 02:49:51,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE