./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 eb692b52 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-?-eb692b5 [2022-07-19 10:55:13,815 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 10:55:13,817 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 10:55:13,864 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 10:55:13,864 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 10:55:13,866 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 10:55:13,867 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 10:55:13,869 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 10:55:13,871 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 10:55:13,875 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 10:55:13,875 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 10:55:13,877 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 10:55:13,878 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 10:55:13,879 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 10:55:13,880 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 10:55:13,883 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 10:55:13,883 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 10:55:13,885 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 10:55:13,886 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 10:55:13,892 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 10:55:13,894 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 10:55:13,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 10:55:13,895 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 10:55:13,896 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 10:55:13,897 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 10:55:13,903 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 10:55:13,904 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 10:55:13,904 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 10:55:13,905 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 10:55:13,906 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 10:55:13,907 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 10:55:13,907 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 10:55:13,909 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 10:55:13,909 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 10:55:13,910 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 10:55:13,911 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 10:55:13,911 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 10:55:13,911 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 10:55:13,912 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 10:55:13,912 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 10:55:13,913 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 10:55:13,914 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 10:55:13,915 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 10:55:13,939 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 10:55:13,940 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 10:55:13,940 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 10:55:13,940 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 10:55:13,941 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 10:55:13,941 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 10:55:13,942 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 10:55:13,942 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 10:55:13,942 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 10:55:13,943 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 10:55:13,943 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 10:55:13,944 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 10:55:13,944 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 10:55:13,944 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 10:55:13,944 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 10:55:13,944 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 10:55:13,945 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 10:55:13,945 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 10:55:13,945 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 10:55:13,945 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 10:55:13,945 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 10:55:13,945 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 10:55:13,946 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 10:55:13,946 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 10:55:13,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:55:13,946 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 10:55:13,946 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 10:55:13,947 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 10:55:13,947 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 10:55:13,947 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 10:55:13,947 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 10:55:13,948 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 10:55:13,948 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 10:55:13,948 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 [2022-07-19 10:55:14,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 10:55:14,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 10:55:14,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 10:55:14,178 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 10:55:14,179 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 10:55:14,180 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 [2022-07-19 10:55:14,234 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/357eef1f2/5158c16aa2784d269c72e7927b6bf298/FLAG0b81bdd75 [2022-07-19 10:55:14,632 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 10:55:14,633 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2022-07-19 10:55:14,643 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/357eef1f2/5158c16aa2784d269c72e7927b6bf298/FLAG0b81bdd75 [2022-07-19 10:55:15,034 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/357eef1f2/5158c16aa2784d269c72e7927b6bf298 [2022-07-19 10:55:15,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 10:55:15,037 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 10:55:15,040 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 10:55:15,040 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 10:55:15,042 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 10:55:15,043 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:55:15" (1/1) ... [2022-07-19 10:55:15,044 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5724cfcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:55:15, skipping insertion in model container [2022-07-19 10:55:15,044 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:55:15" (1/1) ... [2022-07-19 10:55:15,049 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 10:55:15,089 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 10:55:15,263 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] [2022-07-19 10:55:15,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:55:15,273 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 10:55:15,308 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] [2022-07-19 10:55:15,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:55:15,320 INFO L208 MainTranslator]: Completed translation [2022-07-19 10:55:15,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:55:15 WrapperNode [2022-07-19 10:55:15,321 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 10:55:15,322 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 10:55:15,322 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 10:55:15,322 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 10:55:15,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:55:15" (1/1) ... [2022-07-19 10:55:15,353 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:55:15" (1/1) ... [2022-07-19 10:55:15,386 INFO L137 Inliner]: procedures = 24, calls = 29, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 423 [2022-07-19 10:55:15,388 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 10:55:15,390 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 10:55:15,390 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 10:55:15,390 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 10:55:15,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:55:15" (1/1) ... [2022-07-19 10:55:15,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:55:15" (1/1) ... [2022-07-19 10:55:15,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:55:15" (1/1) ... [2022-07-19 10:55:15,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:55:15" (1/1) ... [2022-07-19 10:55:15,404 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:55:15" (1/1) ... [2022-07-19 10:55:15,407 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:55:15" (1/1) ... [2022-07-19 10:55:15,413 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:55:15" (1/1) ... [2022-07-19 10:55:15,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 10:55:15,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 10:55:15,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 10:55:15,420 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 10:55:15,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:55:15" (1/1) ... [2022-07-19 10:55:15,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:55:15,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:55:15,455 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 10:55:15,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 10:55:15,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 10:55:15,488 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-07-19 10:55:15,489 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-07-19 10:55:15,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 10:55:15,489 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-07-19 10:55:15,489 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-07-19 10:55:15,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 10:55:15,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 10:55:15,575 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 10:55:15,576 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 10:55:15,623 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 10:55:15,631 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 10:55:15,638 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 10:55:15,868 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##82: assume !false; [2022-07-19 10:55:15,868 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##81: assume false; [2022-07-19 10:55:15,896 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##58: assume !false; [2022-07-19 10:55:15,896 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##57: assume false; [2022-07-19 10:55:15,896 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2022-07-19 10:55:15,896 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2022-07-19 10:55:15,898 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 10:55:15,973 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-07-19 10:55:15,973 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-07-19 10:55:15,976 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 10:55:15,981 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 10:55:15,982 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-19 10:55:15,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:55:15 BoogieIcfgContainer [2022-07-19 10:55:15,984 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 10:55:15,986 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 10:55:15,986 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 10:55:15,989 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 10:55:15,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:55:15" (1/3) ... [2022-07-19 10:55:15,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c1a699e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:55:15, skipping insertion in model container [2022-07-19 10:55:15,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:55:15" (2/3) ... [2022-07-19 10:55:15,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c1a699e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:55:15, skipping insertion in model container [2022-07-19 10:55:15,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:55:15" (3/3) ... [2022-07-19 10:55:15,992 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.c [2022-07-19 10:55:16,003 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 10:55:16,003 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 10:55:16,046 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 10:55:16,051 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1b8b80e0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@8ca5b0d [2022-07-19 10:55:16,051 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 10:55:16,054 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) [2022-07-19 10:55:16,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-19 10:55:16,061 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:55:16,061 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:55:16,061 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:55:16,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:55:16,066 INFO L85 PathProgramCache]: Analyzing trace with hash -454322622, now seen corresponding path program 1 times [2022-07-19 10:55:16,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:55:16,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42966694] [2022-07-19 10:55:16,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:55:16,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:55:16,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:55:16,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:55:16,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:55:16,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42966694] [2022-07-19 10:55:16,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42966694] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:55:16,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:55:16,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:55:16,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592461644] [2022-07-19 10:55:16,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:55:16,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:55:16,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:55:16,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:55:16,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:55:16,289 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) [2022-07-19 10:55:16,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:55:16,375 INFO L93 Difference]: Finished difference Result 235 states and 382 transitions. [2022-07-19 10:55:16,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:55:16,377 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 [2022-07-19 10:55:16,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:55:16,386 INFO L225 Difference]: With dead ends: 235 [2022-07-19 10:55:16,386 INFO L226 Difference]: Without dead ends: 111 [2022-07-19 10:55:16,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:55:16,397 INFO L413 NwaCegarLoop]: 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 [2022-07-19 10:55:16,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 242 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:55:16,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-19 10:55:16,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-07-19 10:55:16,443 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) [2022-07-19 10:55:16,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2022-07-19 10:55:16,445 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 13 [2022-07-19 10:55:16,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:55:16,446 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions. [2022-07-19 10:55:16,446 INFO L496 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) [2022-07-19 10:55:16,446 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2022-07-19 10:55:16,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-19 10:55:16,447 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:55:16,447 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:55:16,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 10:55:16,448 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:55:16,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:55:16,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1664019001, now seen corresponding path program 1 times [2022-07-19 10:55:16,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:55:16,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815832415] [2022-07-19 10:55:16,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:55:16,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:55:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:55:16,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:55:16,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:55:16,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815832415] [2022-07-19 10:55:16,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815832415] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:55:16,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:55:16,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:55:16,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847069655] [2022-07-19 10:55:16,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:55:16,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:55:16,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:55:16,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:55:16,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:55:16,501 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) [2022-07-19 10:55:16,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:55:16,588 INFO L93 Difference]: Finished difference Result 203 states and 288 transitions. [2022-07-19 10:55:16,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:55:16,589 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 [2022-07-19 10:55:16,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:55:16,591 INFO L225 Difference]: With dead ends: 203 [2022-07-19 10:55:16,592 INFO L226 Difference]: Without dead ends: 156 [2022-07-19 10:55:16,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:55:16,595 INFO L413 NwaCegarLoop]: 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.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:55:16,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 237 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:55:16,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-19 10:55:16,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2022-07-19 10:55:16,623 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) [2022-07-19 10:55:16,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 203 transitions. [2022-07-19 10:55:16,653 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 203 transitions. Word has length 16 [2022-07-19 10:55:16,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:55:16,653 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 203 transitions. [2022-07-19 10:55:16,654 INFO L496 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) [2022-07-19 10:55:16,654 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 203 transitions. [2022-07-19 10:55:16,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-19 10:55:16,654 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:55:16,655 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:55:16,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 10:55:16,655 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:55:16,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:55:16,655 INFO L85 PathProgramCache]: Analyzing trace with hash -45143919, now seen corresponding path program 1 times [2022-07-19 10:55:16,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:55:16,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053416849] [2022-07-19 10:55:16,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:55:16,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:55:16,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:55:16,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:55:16,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:55:16,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053416849] [2022-07-19 10:55:16,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053416849] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:55:16,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:55:16,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:55:16,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106941248] [2022-07-19 10:55:16,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:55:16,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:55:16,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:55:16,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:55:16,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:55:16,740 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) [2022-07-19 10:55:16,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:55:16,772 INFO L93 Difference]: Finished difference Result 246 states and 339 transitions. [2022-07-19 10:55:16,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:55:16,773 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 [2022-07-19 10:55:16,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:55:16,777 INFO L225 Difference]: With dead ends: 246 [2022-07-19 10:55:16,777 INFO L226 Difference]: Without dead ends: 198 [2022-07-19 10:55:16,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:55:16,782 INFO L413 NwaCegarLoop]: 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 [2022-07-19 10:55:16,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 222 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:55:16,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-19 10:55:16,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 154. [2022-07-19 10:55:16,801 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) [2022-07-19 10:55:16,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 216 transitions. [2022-07-19 10:55:16,802 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 216 transitions. Word has length 17 [2022-07-19 10:55:16,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:55:16,802 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 216 transitions. [2022-07-19 10:55:16,803 INFO L496 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) [2022-07-19 10:55:16,803 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 216 transitions. [2022-07-19 10:55:16,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-19 10:55:16,804 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:55:16,804 INFO L195 NwaCegarLoop]: 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] [2022-07-19 10:55:16,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 10:55:16,805 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:55:16,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:55:16,805 INFO L85 PathProgramCache]: Analyzing trace with hash 111527333, now seen corresponding path program 1 times [2022-07-19 10:55:16,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:55:16,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767748008] [2022-07-19 10:55:16,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:55:16,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:55:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:55:16,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:55:16,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:55:16,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767748008] [2022-07-19 10:55:16,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767748008] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:55:16,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:55:16,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:55:16,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889331070] [2022-07-19 10:55:16,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:55:16,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:55:16,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:55:16,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:55:16,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:55:16,889 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) [2022-07-19 10:55:16,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:55:16,930 INFO L93 Difference]: Finished difference Result 157 states and 218 transitions. [2022-07-19 10:55:16,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:55:16,931 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 [2022-07-19 10:55:16,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:55:16,934 INFO L225 Difference]: With dead ends: 157 [2022-07-19 10:55:16,936 INFO L226 Difference]: Without dead ends: 154 [2022-07-19 10:55:16,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:55:16,937 INFO L413 NwaCegarLoop]: 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 [2022-07-19 10:55:16,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 262 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:55:16,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-07-19 10:55:16,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2022-07-19 10:55:16,954 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) [2022-07-19 10:55:16,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 215 transitions. [2022-07-19 10:55:16,955 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 215 transitions. Word has length 27 [2022-07-19 10:55:16,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:55:16,956 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 215 transitions. [2022-07-19 10:55:16,956 INFO L496 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) [2022-07-19 10:55:16,956 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 215 transitions. [2022-07-19 10:55:16,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-19 10:55:16,959 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:55:16,959 INFO L195 NwaCegarLoop]: 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] [2022-07-19 10:55:16,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 10:55:16,960 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:55:16,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:55:16,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1365306542, now seen corresponding path program 1 times [2022-07-19 10:55:16,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:55:16,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855765692] [2022-07-19 10:55:16,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:55:16,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:55:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:55:17,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:55:17,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:55:17,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855765692] [2022-07-19 10:55:17,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855765692] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:55:17,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:55:17,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:55:17,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188873367] [2022-07-19 10:55:17,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:55:17,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:55:17,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:55:17,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:55:17,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:55:17,022 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) [2022-07-19 10:55:17,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:55:17,070 INFO L93 Difference]: Finished difference Result 200 states and 276 transitions. [2022-07-19 10:55:17,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:55:17,073 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 [2022-07-19 10:55:17,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:55:17,076 INFO L225 Difference]: With dead ends: 200 [2022-07-19 10:55:17,076 INFO L226 Difference]: Without dead ends: 152 [2022-07-19 10:55:17,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:55:17,077 INFO L413 NwaCegarLoop]: 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 [2022-07-19 10:55:17,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 269 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:55:17,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-19 10:55:17,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-07-19 10:55:17,096 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) [2022-07-19 10:55:17,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 211 transitions. [2022-07-19 10:55:17,097 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 211 transitions. Word has length 31 [2022-07-19 10:55:17,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:55:17,098 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 211 transitions. [2022-07-19 10:55:17,099 INFO L496 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) [2022-07-19 10:55:17,099 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 211 transitions. [2022-07-19 10:55:17,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-19 10:55:17,104 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:55:17,104 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:55:17,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 10:55:17,104 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:55:17,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:55:17,105 INFO L85 PathProgramCache]: Analyzing trace with hash 52355391, now seen corresponding path program 1 times [2022-07-19 10:55:17,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:55:17,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643953087] [2022-07-19 10:55:17,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:55:17,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:55:17,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:55:17,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:55:17,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:55:17,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:55:17,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:55:17,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643953087] [2022-07-19 10:55:17,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643953087] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:55:17,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:55:17,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 10:55:17,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284588237] [2022-07-19 10:55:17,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:55:17,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:55:17,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:55:17,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:55:17,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:55:17,218 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) [2022-07-19 10:55:17,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:55:17,356 INFO L93 Difference]: Finished difference Result 214 states and 290 transitions. [2022-07-19 10:55:17,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 10:55:17,357 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 [2022-07-19 10:55:17,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:55:17,358 INFO L225 Difference]: With dead ends: 214 [2022-07-19 10:55:17,358 INFO L226 Difference]: Without dead ends: 161 [2022-07-19 10:55:17,359 INFO L412 NwaCegarLoop]: 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 [2022-07-19 10:55:17,363 INFO L413 NwaCegarLoop]: 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 [2022-07-19 10:55:17,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 480 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:55:17,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-19 10:55:17,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 145. [2022-07-19 10:55:17,388 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) [2022-07-19 10:55:17,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 200 transitions. [2022-07-19 10:55:17,389 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 200 transitions. Word has length 33 [2022-07-19 10:55:17,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:55:17,389 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 200 transitions. [2022-07-19 10:55:17,390 INFO L496 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) [2022-07-19 10:55:17,390 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 200 transitions. [2022-07-19 10:55:17,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 10:55:17,393 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:55:17,393 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:55:17,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 10:55:17,394 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:55:17,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:55:17,395 INFO L85 PathProgramCache]: Analyzing trace with hash -572632936, now seen corresponding path program 1 times [2022-07-19 10:55:17,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:55:17,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364438085] [2022-07-19 10:55:17,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:55:17,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:55:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:55:17,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:55:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:55:17,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:55:17,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:55:17,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364438085] [2022-07-19 10:55:17,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364438085] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:55:17,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:55:17,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 10:55:17,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404005429] [2022-07-19 10:55:17,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:55:17,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:55:17,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:55:17,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:55:17,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:55:17,528 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) [2022-07-19 10:55:17,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:55:17,680 INFO L93 Difference]: Finished difference Result 191 states and 261 transitions. [2022-07-19 10:55:17,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 10:55:17,680 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 [2022-07-19 10:55:17,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:55:17,683 INFO L225 Difference]: With dead ends: 191 [2022-07-19 10:55:17,683 INFO L226 Difference]: Without dead ends: 145 [2022-07-19 10:55:17,685 INFO L412 NwaCegarLoop]: 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 [2022-07-19 10:55:17,686 INFO L413 NwaCegarLoop]: 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 [2022-07-19 10:55:17,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 465 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:55:17,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-19 10:55:17,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2022-07-19 10:55:17,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) [2022-07-19 10:55:17,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 199 transitions. [2022-07-19 10:55:17,699 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 199 transitions. Word has length 37 [2022-07-19 10:55:17,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:55:17,700 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 199 transitions. [2022-07-19 10:55:17,700 INFO L496 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) [2022-07-19 10:55:17,700 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 199 transitions. [2022-07-19 10:55:17,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-19 10:55:17,701 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:55:17,701 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:55:17,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 10:55:17,702 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:55:17,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:55:17,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1593142548, now seen corresponding path program 1 times [2022-07-19 10:55:17,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:55:17,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354158418] [2022-07-19 10:55:17,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:55:17,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:55:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:55:17,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:55:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:55:17,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:55:17,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:55:17,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354158418] [2022-07-19 10:55:17,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354158418] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:55:17,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:55:17,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 10:55:17,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592031764] [2022-07-19 10:55:17,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:55:17,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 10:55:17,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:55:17,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 10:55:17,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 10:55:17,784 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) [2022-07-19 10:55:17,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:55:17,973 INFO L93 Difference]: Finished difference Result 179 states and 240 transitions. [2022-07-19 10:55:17,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 10:55:17,974 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 [2022-07-19 10:55:17,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:55:17,975 INFO L225 Difference]: With dead ends: 179 [2022-07-19 10:55:17,975 INFO L226 Difference]: Without dead ends: 157 [2022-07-19 10:55:17,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-19 10:55:17,976 INFO L413 NwaCegarLoop]: 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 [2022-07-19 10:55:17,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 585 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:55:17,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-07-19 10:55:17,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 145. [2022-07-19 10:55:17,984 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) [2022-07-19 10:55:17,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 198 transitions. [2022-07-19 10:55:17,985 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 198 transitions. Word has length 38 [2022-07-19 10:55:17,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:55:17,985 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 198 transitions. [2022-07-19 10:55:17,985 INFO L496 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) [2022-07-19 10:55:17,985 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 198 transitions. [2022-07-19 10:55:17,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-19 10:55:17,986 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:55:17,986 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:55:17,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 10:55:17,987 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:55:17,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:55:17,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1687313027, now seen corresponding path program 1 times [2022-07-19 10:55:17,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:55:17,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389561034] [2022-07-19 10:55:17,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:55:17,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:55:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:55:18,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:55:18,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:55:18,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:55:18,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:55:18,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389561034] [2022-07-19 10:55:18,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389561034] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:55:18,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:55:18,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:55:18,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442152787] [2022-07-19 10:55:18,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:55:18,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:55:18,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:55:18,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:55:18,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:55:18,033 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) [2022-07-19 10:55:18,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:55:18,091 INFO L93 Difference]: Finished difference Result 207 states and 282 transitions. [2022-07-19 10:55:18,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:55:18,091 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 [2022-07-19 10:55:18,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:55:18,093 INFO L225 Difference]: With dead ends: 207 [2022-07-19 10:55:18,093 INFO L226 Difference]: Without dead ends: 155 [2022-07-19 10:55:18,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:55:18,094 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 21 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:55:18,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 376 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:55:18,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-19 10:55:18,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2022-07-19 10:55:18,102 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) [2022-07-19 10:55:18,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 205 transitions. [2022-07-19 10:55:18,103 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 205 transitions. Word has length 39 [2022-07-19 10:55:18,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:55:18,104 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 205 transitions. [2022-07-19 10:55:18,104 INFO L496 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) [2022-07-19 10:55:18,104 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 205 transitions. [2022-07-19 10:55:18,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-19 10:55:18,105 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:55:18,105 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:55:18,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 10:55:18,105 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:55:18,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:55:18,106 INFO L85 PathProgramCache]: Analyzing trace with hash -986248449, now seen corresponding path program 1 times [2022-07-19 10:55:18,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:55:18,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410289107] [2022-07-19 10:55:18,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:55:18,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:55:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:55:18,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:55:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:55:18,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:55:18,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:55:18,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410289107] [2022-07-19 10:55:18,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410289107] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:55:18,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:55:18,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 10:55:18,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034541520] [2022-07-19 10:55:18,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:55:18,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 10:55:18,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:55:18,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 10:55:18,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 10:55:18,167 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) [2022-07-19 10:55:18,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:55:18,264 INFO L93 Difference]: Finished difference Result 218 states and 296 transitions. [2022-07-19 10:55:18,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 10:55:18,264 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 [2022-07-19 10:55:18,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:55:18,266 INFO L225 Difference]: With dead ends: 218 [2022-07-19 10:55:18,266 INFO L226 Difference]: Without dead ends: 187 [2022-07-19 10:55:18,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-19 10:55:18,267 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 46 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:55:18,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 856 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:55:18,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-19 10:55:18,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 156. [2022-07-19 10:55:18,284 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) [2022-07-19 10:55:18,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 210 transitions. [2022-07-19 10:55:18,285 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 210 transitions. Word has length 39 [2022-07-19 10:55:18,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:55:18,285 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 210 transitions. [2022-07-19 10:55:18,285 INFO L496 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) [2022-07-19 10:55:18,285 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 210 transitions. [2022-07-19 10:55:18,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-19 10:55:18,286 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:55:18,286 INFO L195 NwaCegarLoop]: 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] [2022-07-19 10:55:18,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 10:55:18,287 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:55:18,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:55:18,287 INFO L85 PathProgramCache]: Analyzing trace with hash 368817782, now seen corresponding path program 1 times [2022-07-19 10:55:18,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:55:18,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81745714] [2022-07-19 10:55:18,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:55:18,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:55:18,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:55:18,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:55:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:55:18,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:55:18,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:55:18,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81745714] [2022-07-19 10:55:18,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81745714] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:55:18,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:55:18,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:55:18,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033155397] [2022-07-19 10:55:18,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:55:18,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:55:18,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:55:18,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:55:18,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:55:18,330 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) [2022-07-19 10:55:18,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:55:18,410 INFO L93 Difference]: Finished difference Result 214 states and 286 transitions. [2022-07-19 10:55:18,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:55:18,411 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 [2022-07-19 10:55:18,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:55:18,412 INFO L225 Difference]: With dead ends: 214 [2022-07-19 10:55:18,412 INFO L226 Difference]: Without dead ends: 174 [2022-07-19 10:55:18,412 INFO L412 NwaCegarLoop]: 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 [2022-07-19 10:55:18,413 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 51 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:55:18,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 404 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:55:18,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-07-19 10:55:18,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 161. [2022-07-19 10:55:18,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 147 states have (on average 1.3265306122448979) internal successors, (195), 145 states have internal predecessors, (195), 7 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (12), 12 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-19 10:55:18,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 214 transitions. [2022-07-19 10:55:18,423 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 214 transitions. Word has length 40 [2022-07-19 10:55:18,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:55:18,423 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 214 transitions. [2022-07-19 10:55:18,423 INFO L496 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) [2022-07-19 10:55:18,424 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 214 transitions. [2022-07-19 10:55:18,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-19 10:55:18,424 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:55:18,425 INFO L195 NwaCegarLoop]: 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] [2022-07-19 10:55:18,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 10:55:18,425 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:55:18,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:55:18,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1582571415, now seen corresponding path program 1 times [2022-07-19 10:55:18,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:55:18,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367493044] [2022-07-19 10:55:18,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:55:18,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:55:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:55:18,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:55:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:55:18,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:55:18,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:55:18,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367493044] [2022-07-19 10:55:18,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367493044] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:55:18,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:55:18,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 10:55:18,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111314765] [2022-07-19 10:55:18,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:55:18,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 10:55:18,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:55:18,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 10:55:18,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 10:55:18,487 INFO L87 Difference]: Start difference. First operand 161 states and 214 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) [2022-07-19 10:55:18,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:55:18,604 INFO L93 Difference]: Finished difference Result 209 states and 276 transitions. [2022-07-19 10:55:18,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 10:55:18,605 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 [2022-07-19 10:55:18,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:55:18,606 INFO L225 Difference]: With dead ends: 209 [2022-07-19 10:55:18,606 INFO L226 Difference]: Without dead ends: 187 [2022-07-19 10:55:18,607 INFO L412 NwaCegarLoop]: 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 [2022-07-19 10:55:18,607 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 57 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:55:18,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 894 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:55:18,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-19 10:55:18,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 162. [2022-07-19 10:55:18,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 148 states have (on average 1.3175675675675675) internal successors, (195), 146 states have internal predecessors, (195), 7 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (12), 12 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-19 10:55:18,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 214 transitions. [2022-07-19 10:55:18,619 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 214 transitions. Word has length 40 [2022-07-19 10:55:18,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:55:18,619 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 214 transitions. [2022-07-19 10:55:18,619 INFO L496 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) [2022-07-19 10:55:18,619 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 214 transitions. [2022-07-19 10:55:18,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-19 10:55:18,620 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:55:18,620 INFO L195 NwaCegarLoop]: 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] [2022-07-19 10:55:18,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 10:55:18,621 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:55:18,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:55:18,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1069882360, now seen corresponding path program 1 times [2022-07-19 10:55:18,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:55:18,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743572646] [2022-07-19 10:55:18,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:55:18,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:55:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:55:18,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:55:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:55:18,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:55:18,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:55:18,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743572646] [2022-07-19 10:55:18,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743572646] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:55:18,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:55:18,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:55:18,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904927285] [2022-07-19 10:55:18,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:55:18,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:55:18,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:55:18,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:55:18,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:55:18,657 INFO L87 Difference]: Start difference. First operand 162 states and 214 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) [2022-07-19 10:55:18,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:55:18,729 INFO L93 Difference]: Finished difference Result 205 states and 268 transitions. [2022-07-19 10:55:18,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:55:18,730 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 [2022-07-19 10:55:18,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:55:18,731 INFO L225 Difference]: With dead ends: 205 [2022-07-19 10:55:18,731 INFO L226 Difference]: Without dead ends: 158 [2022-07-19 10:55:18,731 INFO L412 NwaCegarLoop]: 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 [2022-07-19 10:55:18,732 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 18 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:55:18,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 388 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:55:18,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-19 10:55:18,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 154. [2022-07-19 10:55:18,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 141 states have (on average 1.2907801418439717) internal successors, (182), 139 states have internal predecessors, (182), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (11), 11 states have call predecessors, (11), 4 states have call successors, (11) [2022-07-19 10:55:18,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 200 transitions. [2022-07-19 10:55:18,741 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 200 transitions. Word has length 40 [2022-07-19 10:55:18,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:55:18,741 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 200 transitions. [2022-07-19 10:55:18,742 INFO L496 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) [2022-07-19 10:55:18,742 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 200 transitions. [2022-07-19 10:55:18,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-19 10:55:18,742 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:55:18,743 INFO L195 NwaCegarLoop]: 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] [2022-07-19 10:55:18,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 10:55:18,743 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:55:18,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:55:18,743 INFO L85 PathProgramCache]: Analyzing trace with hash -760530929, now seen corresponding path program 1 times [2022-07-19 10:55:18,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:55:18,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733608618] [2022-07-19 10:55:18,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:55:18,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:55:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:55:18,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:55:18,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:55:18,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:55:18,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:55:18,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733608618] [2022-07-19 10:55:18,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733608618] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:55:18,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:55:18,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 10:55:18,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762014285] [2022-07-19 10:55:18,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:55:18,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:55:18,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:55:18,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:55:18,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:55:18,787 INFO L87 Difference]: Start difference. First operand 154 states and 200 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) [2022-07-19 10:55:18,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:55:18,853 INFO L93 Difference]: Finished difference Result 164 states and 212 transitions. [2022-07-19 10:55:18,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:55:18,853 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 [2022-07-19 10:55:18,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:55:18,854 INFO L225 Difference]: With dead ends: 164 [2022-07-19 10:55:18,854 INFO L226 Difference]: Without dead ends: 47 [2022-07-19 10:55:18,854 INFO L412 NwaCegarLoop]: 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 [2022-07-19 10:55:18,855 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 246 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:55:18,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 241 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:55:18,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-19 10:55:18,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-07-19 10:55:18,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 43 states have internal predecessors, (45), 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) [2022-07-19 10:55:18,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-07-19 10:55:18,858 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 40 [2022-07-19 10:55:18,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:55:18,859 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-07-19 10:55:18,859 INFO L496 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) [2022-07-19 10:55:18,859 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-07-19 10:55:18,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-19 10:55:18,859 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:55:18,859 INFO L195 NwaCegarLoop]: 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] [2022-07-19 10:55:18,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-19 10:55:18,860 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:55:18,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:55:18,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1689213541, now seen corresponding path program 1 times [2022-07-19 10:55:18,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:55:18,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003140212] [2022-07-19 10:55:18,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:55:18,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:55:18,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:55:18,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:55:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:55:18,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:55:18,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:55:18,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003140212] [2022-07-19 10:55:18,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003140212] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:55:18,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:55:18,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:55:18,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671493898] [2022-07-19 10:55:18,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:55:18,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:55:18,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:55:18,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:55:18,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:55:18,897 INFO L87 Difference]: Start difference. First operand 47 states and 49 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) [2022-07-19 10:55:18,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:55:18,918 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2022-07-19 10:55:18,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:55:18,918 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 [2022-07-19 10:55:18,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:55:18,919 INFO L225 Difference]: With dead ends: 49 [2022-07-19 10:55:18,919 INFO L226 Difference]: Without dead ends: 42 [2022-07-19 10:55:18,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:55:18,920 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:55:18,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 88 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:55:18,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-19 10:55:18,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-07-19 10:55:18,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 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) [2022-07-19 10:55:18,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2022-07-19 10:55:18,923 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 41 [2022-07-19 10:55:18,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:55:18,923 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2022-07-19 10:55:18,924 INFO L496 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) [2022-07-19 10:55:18,924 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2022-07-19 10:55:18,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-19 10:55:18,924 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:55:18,924 INFO L195 NwaCegarLoop]: 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] [2022-07-19 10:55:18,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 10:55:18,925 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:55:18,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:55:18,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1579234754, now seen corresponding path program 1 times [2022-07-19 10:55:18,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:55:18,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457483409] [2022-07-19 10:55:18,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:55:18,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:55:18,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:55:18,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:55:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:55:18,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:55:18,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:55:18,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457483409] [2022-07-19 10:55:18,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457483409] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:55:18,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:55:18,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:55:18,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059494140] [2022-07-19 10:55:18,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:55:18,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:55:18,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:55:18,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:55:18,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:55:18,964 INFO L87 Difference]: Start difference. First operand 42 states and 43 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) [2022-07-19 10:55:18,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:55:18,990 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-07-19 10:55:18,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:55:18,990 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 [2022-07-19 10:55:18,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:55:18,991 INFO L225 Difference]: With dead ends: 80 [2022-07-19 10:55:18,991 INFO L226 Difference]: Without dead ends: 75 [2022-07-19 10:55:18,992 INFO L412 NwaCegarLoop]: 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 [2022-07-19 10:55:18,992 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 20 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:55:18,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 106 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:55:18,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-19 10:55:18,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2022-07-19 10:55:18,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 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) [2022-07-19 10:55:18,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2022-07-19 10:55:18,997 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 41 [2022-07-19 10:55:18,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:55:18,997 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2022-07-19 10:55:18,998 INFO L496 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) [2022-07-19 10:55:18,998 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2022-07-19 10:55:18,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-19 10:55:18,998 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:55:18,998 INFO L195 NwaCegarLoop]: 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] [2022-07-19 10:55:18,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 10:55:18,999 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:55:18,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:55:18,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1581081796, now seen corresponding path program 1 times [2022-07-19 10:55:18,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:55:18,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108373521] [2022-07-19 10:55:19,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:55:19,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:55:19,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:55:19,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:55:19,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:55:19,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:55:19,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:55:19,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108373521] [2022-07-19 10:55:19,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108373521] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:55:19,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:55:19,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 10:55:19,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254035427] [2022-07-19 10:55:19,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:55:19,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 10:55:19,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:55:19,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 10:55:19,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 10:55:19,076 INFO L87 Difference]: Start difference. First operand 74 states and 75 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) [2022-07-19 10:55:19,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:55:19,107 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2022-07-19 10:55:19,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 10:55:19,107 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 [2022-07-19 10:55:19,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:55:19,108 INFO L225 Difference]: With dead ends: 74 [2022-07-19 10:55:19,108 INFO L226 Difference]: Without dead ends: 0 [2022-07-19 10:55:19,108 INFO L412 NwaCegarLoop]: 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 [2022-07-19 10:55:19,120 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 3 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:55:19,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 171 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:55:19,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-19 10:55:19,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-19 10:55:19,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:55:19,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-19 10:55:19,121 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2022-07-19 10:55:19,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:55:19,122 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-19 10:55:19,122 INFO L496 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) [2022-07-19 10:55:19,122 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-19 10:55:19,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-19 10:55:19,125 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 10:55:19,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-19 10:55:19,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-19 10:55:20,549 INFO L902 garLoopResultBuilder]: At program point errorFnENTRY(lines 577 584) the Hoare annotation is: true [2022-07-19 10:55:20,549 INFO L899 garLoopResultBuilder]: For program point errorFnFINAL(lines 577 584) no Hoare annotation was computed. [2022-07-19 10:55:20,549 INFO L899 garLoopResultBuilder]: For program point errorFnEXIT(lines 577 584) no Hoare annotation was computed. [2022-07-19 10:55:20,550 INFO L899 garLoopResultBuilder]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2022-07-19 10:55:20,550 INFO L899 garLoopResultBuilder]: For program point L201(lines 201 205) no Hoare annotation was computed. [2022-07-19 10:55:20,550 INFO L899 garLoopResultBuilder]: For program point L135(lines 135 273) no Hoare annotation was computed. [2022-07-19 10:55:20,550 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 284) no Hoare annotation was computed. [2022-07-19 10:55:20,550 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-19 10:55:20,550 INFO L895 garLoopResultBuilder]: At program point L251(line 251) the Hoare annotation is: false [2022-07-19 10:55:20,550 INFO L899 garLoopResultBuilder]: For program point L251-1(lines 247 253) no Hoare annotation was computed. [2022-07-19 10:55:20,550 INFO L895 garLoopResultBuilder]: At program point L400(line 400) the Hoare annotation is: false [2022-07-19 10:55:20,550 INFO L895 garLoopResultBuilder]: At program point L103(lines 102 284) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-07-19 10:55:20,551 INFO L895 garLoopResultBuilder]: At program point L70(lines 51 72) the Hoare annotation is: (and (<= 5 ~MPR1~0) (not (= ~s~0 ~NP~0)) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-07-19 10:55:20,551 INFO L895 garLoopResultBuilder]: At program point L384(lines 377 417) the Hoare annotation is: (and (<= 5 ~MPR1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0)) [2022-07-19 10:55:20,551 INFO L895 garLoopResultBuilder]: At program point L285(lines 75 287) the Hoare annotation is: (and (<= 5 ~MPR1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0)) [2022-07-19 10:55:20,551 INFO L899 garLoopResultBuilder]: For program point L153(lines 153 267) no Hoare annotation was computed. [2022-07-19 10:55:20,551 INFO L899 garLoopResultBuilder]: For program point L120(lines 120 278) no Hoare annotation was computed. [2022-07-19 10:55:20,551 INFO L895 garLoopResultBuilder]: At program point L236(line 236) the Hoare annotation is: false [2022-07-19 10:55:20,551 INFO L899 garLoopResultBuilder]: For program point L236-1(lines 232 238) no Hoare annotation was computed. [2022-07-19 10:55:20,551 INFO L899 garLoopResultBuilder]: For program point L550(lines 550 562) no Hoare annotation was computed. [2022-07-19 10:55:20,551 INFO L899 garLoopResultBuilder]: For program point L385(lines 369 418) no Hoare annotation was computed. [2022-07-19 10:55:20,551 INFO L899 garLoopResultBuilder]: For program point L352(lines 352 367) no Hoare annotation was computed. [2022-07-19 10:55:20,551 INFO L895 garLoopResultBuilder]: At program point L220(line 220) the Hoare annotation is: false [2022-07-19 10:55:20,552 INFO L895 garLoopResultBuilder]: At program point L187(lines 187 188) the Hoare annotation is: (and (<= 5 ~MPR1~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0)) [2022-07-19 10:55:20,552 INFO L899 garLoopResultBuilder]: For program point L220-1(lines 216 222) no Hoare annotation was computed. [2022-07-19 10:55:20,552 INFO L899 garLoopResultBuilder]: For program point L187-1(lines 187 188) no Hoare annotation was computed. [2022-07-19 10:55:20,552 INFO L899 garLoopResultBuilder]: For program point L171(lines 171 183) no Hoare annotation was computed. [2022-07-19 10:55:20,552 INFO L899 garLoopResultBuilder]: For program point L138(lines 138 272) no Hoare annotation was computed. [2022-07-19 10:55:20,552 INFO L899 garLoopResultBuilder]: For program point L105(lines 105 283) no Hoare annotation was computed. [2022-07-19 10:55:20,552 INFO L895 garLoopResultBuilder]: At program point L551(lines 550 562) the Hoare annotation is: (and (<= 5 ~MPR1~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (<= 259 |ULTIMATE.start_KbFilter_PnP_~status~0#1|) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0)) [2022-07-19 10:55:20,552 INFO L899 garLoopResultBuilder]: For program point L386(lines 386 415) no Hoare annotation was computed. [2022-07-19 10:55:20,552 INFO L895 garLoopResultBuilder]: At program point L353(lines 352 367) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-07-19 10:55:20,552 INFO L899 garLoopResultBuilder]: For program point L370(lines 370 374) no Hoare annotation was computed. [2022-07-19 10:55:20,552 INFO L895 garLoopResultBuilder]: At program point L106(lines 105 283) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-07-19 10:55:20,553 INFO L902 garLoopResultBuilder]: At program point L420(lines 288 422) the Hoare annotation is: true [2022-07-19 10:55:20,553 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 414) no Hoare annotation was computed. [2022-07-19 10:55:20,553 INFO L899 garLoopResultBuilder]: For program point L156(lines 156 266) no Hoare annotation was computed. [2022-07-19 10:55:20,553 INFO L899 garLoopResultBuilder]: For program point L123(lines 123 277) no Hoare annotation was computed. [2022-07-19 10:55:20,553 INFO L895 garLoopResultBuilder]: At program point L536(lines 528 547) the Hoare annotation is: false [2022-07-19 10:55:20,553 INFO L899 garLoopResultBuilder]: For program point L404(lines 404 412) no Hoare annotation was computed. [2022-07-19 10:55:20,553 INFO L895 garLoopResultBuilder]: At program point L173(line 173) the Hoare annotation is: false [2022-07-19 10:55:20,553 INFO L895 garLoopResultBuilder]: At program point L553(lines 552 562) the Hoare annotation is: (and (<= 5 ~MPR1~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (<= 259 |ULTIMATE.start_KbFilter_PnP_~status~0#1|) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0)) [2022-07-19 10:55:20,553 INFO L899 garLoopResultBuilder]: For program point L388(lines 388 394) no Hoare annotation was computed. [2022-07-19 10:55:20,553 INFO L895 garLoopResultBuilder]: At program point L355(lines 354 367) the Hoare annotation is: (= |ULTIMATE.start_main_~status~1#1| 0) [2022-07-19 10:55:20,553 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-19 10:55:20,553 INFO L899 garLoopResultBuilder]: For program point L405(lines 405 407) no Hoare annotation was computed. [2022-07-19 10:55:20,553 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 271) no Hoare annotation was computed. [2022-07-19 10:55:20,553 INFO L899 garLoopResultBuilder]: For program point L108(lines 108 282) no Hoare annotation was computed. [2022-07-19 10:55:20,553 INFO L899 garLoopResultBuilder]: For program point L389(lines 389 391) no Hoare annotation was computed. [2022-07-19 10:55:20,554 INFO L899 garLoopResultBuilder]: For program point L323(lines 323 368) no Hoare annotation was computed. [2022-07-19 10:55:20,554 INFO L895 garLoopResultBuilder]: At program point L323-1(lines 297 421) the Hoare annotation is: (and (<= 5 ~MPR1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0)) [2022-07-19 10:55:20,554 INFO L895 garLoopResultBuilder]: At program point L257(lines 257 258) the Hoare annotation is: (and (<= 5 ~MPR1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-07-19 10:55:20,554 INFO L899 garLoopResultBuilder]: For program point L257-1(lines 257 258) no Hoare annotation was computed. [2022-07-19 10:55:20,554 INFO L899 garLoopResultBuilder]: For program point L505(lines 505 511) no Hoare annotation was computed. [2022-07-19 10:55:20,554 INFO L899 garLoopResultBuilder]: For program point L340(lines 340 345) no Hoare annotation was computed. [2022-07-19 10:55:20,554 INFO L899 garLoopResultBuilder]: For program point L340-2(lines 339 349) no Hoare annotation was computed. [2022-07-19 10:55:20,554 INFO L895 garLoopResultBuilder]: At program point L109(lines 108 282) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-07-19 10:55:20,554 INFO L899 garLoopResultBuilder]: For program point L192(lines 192 198) no Hoare annotation was computed. [2022-07-19 10:55:20,554 INFO L899 garLoopResultBuilder]: For program point L159(lines 159 265) no Hoare annotation was computed. [2022-07-19 10:55:20,554 INFO L899 garLoopResultBuilder]: For program point L126(lines 126 276) no Hoare annotation was computed. [2022-07-19 10:55:20,554 INFO L899 garLoopResultBuilder]: For program point L192-2(lines 166 261) no Hoare annotation was computed. [2022-07-19 10:55:20,555 INFO L895 garLoopResultBuilder]: At program point L242(line 242) the Hoare annotation is: (and (<= 5 ~MPR1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-07-19 10:55:20,555 INFO L899 garLoopResultBuilder]: For program point L242-1(line 242) no Hoare annotation was computed. [2022-07-19 10:55:20,555 INFO L899 garLoopResultBuilder]: For program point L176(lines 176 182) no Hoare annotation was computed. [2022-07-19 10:55:20,555 INFO L899 garLoopResultBuilder]: For program point L176-1(lines 171 183) no Hoare annotation was computed. [2022-07-19 10:55:20,555 INFO L895 garLoopResultBuilder]: At program point L523(lines 523 564) the Hoare annotation is: (and (<= 5 ~MPR1~0) (not (= ~compRegistered~0 0)) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (<= 259 |ULTIMATE.start_KbFilter_PnP_~status~0#1|) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0)) [2022-07-19 10:55:20,555 INFO L895 garLoopResultBuilder]: At program point L226(lines 226 227) the Hoare annotation is: (and (<= 5 ~MPR1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-07-19 10:55:20,555 INFO L899 garLoopResultBuilder]: For program point L226-1(lines 226 227) no Hoare annotation was computed. [2022-07-19 10:55:20,555 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-19 10:55:20,555 INFO L899 garLoopResultBuilder]: For program point L144(lines 144 270) no Hoare annotation was computed. [2022-07-19 10:55:20,555 INFO L899 garLoopResultBuilder]: For program point L111(lines 111 281) no Hoare annotation was computed. [2022-07-19 10:55:20,555 INFO L899 garLoopResultBuilder]: For program point L541(lines 541 545) no Hoare annotation was computed. [2022-07-19 10:55:20,556 INFO L899 garLoopResultBuilder]: For program point L541-1(lines 528 547) no Hoare annotation was computed. [2022-07-19 10:55:20,556 INFO L899 garLoopResultBuilder]: For program point L409(lines 409 411) no Hoare annotation was computed. [2022-07-19 10:55:20,556 INFO L895 garLoopResultBuilder]: At program point L376(lines 369 418) the Hoare annotation is: (and (<= 5 ~MPR1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0)) [2022-07-19 10:55:20,556 INFO L895 garLoopResultBuilder]: At program point L178(line 178) the Hoare annotation is: false [2022-07-19 10:55:20,556 INFO L899 garLoopResultBuilder]: For program point L162(lines 162 264) no Hoare annotation was computed. [2022-07-19 10:55:20,556 INFO L899 garLoopResultBuilder]: For program point L129(lines 129 275) no Hoare annotation was computed. [2022-07-19 10:55:20,556 INFO L895 garLoopResultBuilder]: At program point L509(line 509) the Hoare annotation is: false [2022-07-19 10:55:20,556 INFO L895 garLoopResultBuilder]: At program point L509-1(lines 501 514) the Hoare annotation is: (and (<= 5 ~MPR1~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0)) [2022-07-19 10:55:20,556 INFO L895 garLoopResultBuilder]: At program point L262(lines 166 263) the Hoare annotation is: (and (<= 5 ~MPR1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0)) [2022-07-19 10:55:20,556 INFO L895 garLoopResultBuilder]: At program point L543(line 543) the Hoare annotation is: false [2022-07-19 10:55:20,556 INFO L899 garLoopResultBuilder]: For program point L378(lines 378 382) no Hoare annotation was computed. [2022-07-19 10:55:20,557 INFO L899 garLoopResultBuilder]: For program point L147(lines 147 269) no Hoare annotation was computed. [2022-07-19 10:55:20,557 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 280) no Hoare annotation was computed. [2022-07-19 10:55:20,557 INFO L895 garLoopResultBuilder]: At program point L48(lines 37 50) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-07-19 10:55:20,557 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-19 10:55:20,557 INFO L899 garLoopResultBuilder]: For program point L528(lines 528 547) no Hoare annotation was computed. [2022-07-19 10:55:20,557 INFO L895 garLoopResultBuilder]: At program point L396(lines 387 414) the Hoare annotation is: (and (<= 5 ~MPR1~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0)) [2022-07-19 10:55:20,557 INFO L895 garLoopResultBuilder]: At program point L165(lines 111 281) the Hoare annotation is: (and (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= |ULTIMATE.start_main_~status~1#1| 0) (= |ULTIMATE.start_main_~__cil_tmp8~0#1| 1) (= ~pended~0 0) (= ~compRegistered~0 0)) [2022-07-19 10:55:20,557 INFO L899 garLoopResultBuilder]: For program point L132(lines 132 274) no Hoare annotation was computed. [2022-07-19 10:55:20,557 INFO L899 garLoopResultBuilder]: For program point L529(lines 529 534) no Hoare annotation was computed. [2022-07-19 10:55:20,557 INFO L899 garLoopResultBuilder]: For program point L232(lines 232 238) no Hoare annotation was computed. [2022-07-19 10:55:20,557 INFO L899 garLoopResultBuilder]: For program point L216(lines 216 222) no Hoare annotation was computed. [2022-07-19 10:55:20,557 INFO L899 garLoopResultBuilder]: For program point L150(lines 150 268) no Hoare annotation was computed. [2022-07-19 10:55:20,557 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 279) no Hoare annotation was computed. [2022-07-19 10:55:20,558 INFO L899 garLoopResultBuilder]: For program point L398(lines 398 402) no Hoare annotation was computed. [2022-07-19 10:55:20,558 INFO L899 garLoopResultBuilder]: For program point L332(lines 332 335) no Hoare annotation was computed. [2022-07-19 10:55:20,558 INFO L899 garLoopResultBuilder]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2022-07-19 10:55:20,558 INFO L899 garLoopResultBuilder]: For program point L200(lines 200 206) no Hoare annotation was computed. [2022-07-19 10:55:20,558 INFO L895 garLoopResultBuilder]: At program point L457(lines 456 473) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse3 (= ~compRegistered~0 0)) (.cse2 (not (<= 5 ~MPR1~0))) (.cse1 (= ~NP~0 |old(~s~0)|)) (.cse4 (not (= ~pended~0 0)))) (and (or (= ~SKIP1~0 ~NP~0) .cse0 (not .cse1) .cse2 (= ~MPR1~0 ~s~0) .cse3 .cse4) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse3) .cse2 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4))) [2022-07-19 10:55:20,558 INFO L899 garLoopResultBuilder]: For program point L445(lines 445 448) no Hoare annotation was computed. [2022-07-19 10:55:20,558 INFO L895 garLoopResultBuilder]: At program point L573(lines 565 575) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse3 (= ~compRegistered~0 0)) (.cse2 (not (<= 5 ~MPR1~0))) (.cse1 (= ~NP~0 |old(~s~0)|)) (.cse4 (not (= ~pended~0 0)))) (and (or (= ~SKIP1~0 ~NP~0) .cse0 (not .cse1) (and (= ~setEventCalled~0 1) (= ~s~0 |old(~s~0)|)) .cse2 .cse3 .cse4) (or .cse0 (not .cse3) .cse2 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4))) [2022-07-19 10:55:20,558 INFO L899 garLoopResultBuilder]: For program point L445-2(lines 445 448) no Hoare annotation was computed. [2022-07-19 10:55:20,558 INFO L895 garLoopResultBuilder]: At program point IofCallDriverENTRY(lines 437 500) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))) (.cse4 (= ~compRegistered~0 0)) (.cse3 (not (<= 5 ~MPR1~0))) (.cse2 (= ~NP~0 |old(~s~0)|)) (.cse5 (not (= ~pended~0 0)))) (and (or (= ~SKIP1~0 ~NP~0) .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5) (or .cse0 .cse1 (not .cse4) .cse3 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse5))) [2022-07-19 10:55:20,558 INFO L895 garLoopResultBuilder]: At program point L520(lines 515 522) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse3 (= ~compRegistered~0 0)) (.cse2 (not (<= 5 ~MPR1~0))) (.cse1 (= ~NP~0 |old(~s~0)|)) (.cse4 (not (= ~pended~0 0)))) (and (or (= ~SKIP1~0 ~NP~0) .cse0 (not .cse1) (and (= ~setEventCalled~0 1) (= ~s~0 |old(~s~0)|)) .cse2 .cse3 .cse4) (or .cse0 (not .cse3) .cse2 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4))) [2022-07-19 10:55:20,558 INFO L899 garLoopResultBuilder]: For program point IofCallDriverFINAL(lines 437 500) no Hoare annotation was computed. [2022-07-19 10:55:20,559 INFO L899 garLoopResultBuilder]: For program point L479(lines 479 496) no Hoare annotation was computed. [2022-07-19 10:55:20,559 INFO L895 garLoopResultBuilder]: At program point L471(lines 444 499) the Hoare annotation is: (let ((.cse5 (<= |IofCallDriver_~returnVal2~0#1| 0)) (.cse2 (not (= ~NP~0 1))) (.cse0 (= 259 |IofCallDriver_~returnVal2~0#1|)) (.cse6 (= ~compRegistered~0 0)) (.cse4 (not (<= 5 ~MPR1~0))) (.cse3 (= ~NP~0 |old(~s~0)|)) (.cse7 (not (= ~pended~0 0)))) (and (let ((.cse1 (= ~MPR1~0 ~s~0))) (or (and (= ~setEventCalled~0 1) .cse0 .cse1) (= ~SKIP1~0 ~NP~0) .cse2 (not .cse3) .cse4 (and .cse5 .cse1) .cse6 .cse7)) (let ((.cse8 (= ~setEventCalled~0 |old(~setEventCalled~0)|)) (.cse9 (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|)) (.cse10 (= ~s~0 |old(~s~0)|))) (or (and .cse8 .cse5 .cse9 .cse10) .cse2 (and .cse8 .cse0 .cse9 .cse10) (not .cse6) .cse4 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse7)))) [2022-07-19 10:55:20,559 INFO L899 garLoopResultBuilder]: For program point IofCallDriverEXIT(lines 437 500) no Hoare annotation was computed. [2022-07-19 10:55:20,559 INFO L895 garLoopResultBuilder]: At program point L459(lines 458 473) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse3 (= ~compRegistered~0 0)) (.cse2 (not (<= 5 ~MPR1~0))) (.cse1 (= ~NP~0 |old(~s~0)|)) (.cse4 (not (= ~pended~0 0)))) (and (or (= ~SKIP1~0 ~NP~0) .cse0 (not .cse1) .cse2 (and (= ~setEventCalled~0 1) (= ~MPR1~0 ~s~0)) .cse3 .cse4) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse3) .cse2 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4))) [2022-07-19 10:55:20,559 INFO L899 garLoopResultBuilder]: For program point L488(lines 488 495) no Hoare annotation was computed. [2022-07-19 10:55:20,559 INFO L899 garLoopResultBuilder]: For program point L451(lines 451 474) no Hoare annotation was computed. [2022-07-19 10:55:20,559 INFO L899 garLoopResultBuilder]: For program point L480(lines 480 486) no Hoare annotation was computed. [2022-07-19 10:55:20,559 INFO L895 garLoopResultBuilder]: At program point L431(line 431) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse3 (= ~NP~0 |old(~s~0)|)) (.cse2 (not (<= 5 ~MPR1~0))) (.cse1 (= ~compRegistered~0 0)) (.cse4 (not (= ~pended~0 0)))) (and (or .cse0 (not .cse1) .cse2 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4) (or (= ~SKIP1~0 ~NP~0) .cse0 (not .cse3) .cse2 .cse1 .cse4))) [2022-07-19 10:55:20,559 INFO L895 garLoopResultBuilder]: At program point L431-1(lines 423 436) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse3 (= ~compRegistered~0 0)) (.cse2 (not (<= 5 ~MPR1~0))) (.cse1 (= ~NP~0 |old(~s~0)|)) (.cse4 (not (= ~pended~0 0)))) (and (or (= ~SKIP1~0 ~NP~0) .cse0 (not .cse1) .cse2 (and (= ~setEventCalled~0 1) (= ~MPR1~0 ~s~0)) .cse3 .cse4) (or .cse0 (not .cse3) .cse2 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4))) [2022-07-19 10:55:20,559 INFO L895 garLoopResultBuilder]: At program point L493(line 493) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse3 (= ~NP~0 |old(~s~0)|)) (.cse2 (not (<= 5 ~MPR1~0))) (.cse1 (= ~compRegistered~0 0)) (.cse4 (not (= ~pended~0 0)))) (and (or .cse0 (not .cse1) .cse2 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4) (or (= ~SKIP1~0 ~NP~0) .cse0 (not .cse3) .cse2 .cse1 .cse4))) [2022-07-19 10:55:20,559 INFO L899 garLoopResultBuilder]: For program point L493-1(lines 475 497) no Hoare annotation was computed. [2022-07-19 10:55:20,560 INFO L899 garLoopResultBuilder]: For program point L427(lines 427 433) no Hoare annotation was computed. [2022-07-19 10:55:20,560 INFO L899 garLoopResultBuilder]: For program point L456(lines 456 473) no Hoare annotation was computed. [2022-07-19 10:55:20,560 INFO L895 garLoopResultBuilder]: At program point L452(lines 451 474) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse3 (= ~compRegistered~0 0)) (.cse2 (not (<= 5 ~MPR1~0))) (.cse1 (= ~NP~0 |old(~s~0)|)) (.cse4 (not (= ~pended~0 0)))) (and (or (= ~SKIP1~0 ~NP~0) .cse0 (not .cse1) .cse2 (= ~MPR1~0 ~s~0) .cse3 .cse4) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse3) .cse2 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4))) [2022-07-19 10:55:20,563 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:55:20,564 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 10:55:20,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 10:55:20 BoogieIcfgContainer [2022-07-19 10:55:20,587 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 10:55:20,587 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 10:55:20,587 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 10:55:20,587 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 10:55:20,588 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:55:15" (3/4) ... [2022-07-19 10:55:20,590 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-19 10:55:20,595 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2022-07-19 10:55:20,595 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2022-07-19 10:55:20,602 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2022-07-19 10:55:20,603 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-19 10:55:20,604 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-19 10:55:20,604 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-19 10:55:20,627 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || (setEventCalled == 1 && MPR1 == s)) || compRegistered == 0) || !(pended == 0)) && (((((!(NP == 1) || !(compRegistered == 0)) || !(5 <= MPR1)) || NP == \old(s)) || !(SKIP1 == \old(s))) || !(pended == 0)) [2022-07-19 10:55:20,628 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || MPR1 == s) || compRegistered == 0) || !(pended == 0)) && ((((((!(NP == 1) || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(compRegistered == 0)) || !(5 <= MPR1)) || NP == \old(s)) || !(SKIP1 == \old(s))) || !(pended == 0)) [2022-07-19 10:55:20,628 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((setEventCalled == 1 && 259 == returnVal2) && MPR1 == s) || SKIP1 == NP) || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || (returnVal2 <= 0 && MPR1 == s)) || compRegistered == 0) || !(pended == 0)) && ((((((((((setEventCalled == \old(setEventCalled) && returnVal2 <= 0) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(NP == 1)) || (((setEventCalled == \old(setEventCalled) && 259 == returnVal2) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(compRegistered == 0)) || !(5 <= MPR1)) || NP == \old(s)) || !(SKIP1 == \old(s))) || !(pended == 0)) [2022-07-19 10:55:20,629 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || MPR1 == s) || compRegistered == 0) || !(pended == 0)) && ((((((!(NP == 1) || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(compRegistered == 0)) || !(5 <= MPR1)) || NP == \old(s)) || !(SKIP1 == \old(s))) || !(pended == 0)) [2022-07-19 10:55:20,629 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || (setEventCalled == 1 && MPR1 == s)) || compRegistered == 0) || !(pended == 0)) && ((((((!(NP == 1) || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(compRegistered == 0)) || !(5 <= MPR1)) || NP == \old(s)) || !(SKIP1 == \old(s))) || !(pended == 0)) [2022-07-19 10:55:20,630 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || (setEventCalled == 1 && s == \old(s))) || !(5 <= MPR1)) || compRegistered == 0) || !(pended == 0)) && (((((!(NP == 1) || !(compRegistered == 0)) || !(5 <= MPR1)) || NP == \old(s)) || !(SKIP1 == \old(s))) || !(pended == 0)) [2022-07-19 10:55:20,630 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || (setEventCalled == 1 && s == \old(s))) || !(5 <= MPR1)) || compRegistered == 0) || !(pended == 0)) && (((((!(NP == 1) || !(compRegistered == 0)) || !(5 <= MPR1)) || NP == \old(s)) || !(SKIP1 == \old(s))) || !(pended == 0)) [2022-07-19 10:55:20,663 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 10:55:20,663 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 10:55:20,663 INFO L158 Benchmark]: Toolchain (without parser) took 5626.18ms. Allocated memory was 88.1MB in the beginning and 176.2MB in the end (delta: 88.1MB). Free memory was 53.8MB in the beginning and 123.5MB in the end (delta: -69.6MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2022-07-19 10:55:20,663 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 88.1MB. Free memory was 58.0MB in the beginning and 57.9MB in the end (delta: 23.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 10:55:20,664 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.58ms. Allocated memory was 88.1MB in the beginning and 111.1MB in the end (delta: 23.1MB). Free memory was 53.6MB in the beginning and 83.6MB in the end (delta: -29.9MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2022-07-19 10:55:20,664 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.64ms. Allocated memory is still 111.1MB. Free memory was 83.6MB in the beginning and 81.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 10:55:20,664 INFO L158 Benchmark]: Boogie Preprocessor took 28.96ms. Allocated memory is still 111.1MB. Free memory was 81.1MB in the beginning and 79.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 10:55:20,664 INFO L158 Benchmark]: RCFGBuilder took 564.47ms. Allocated memory is still 111.1MB. Free memory was 79.0MB in the beginning and 84.5MB in the end (delta: -5.5MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. [2022-07-19 10:55:20,665 INFO L158 Benchmark]: TraceAbstraction took 4600.40ms. Allocated memory was 111.1MB in the beginning and 176.2MB in the end (delta: 65.0MB). Free memory was 84.5MB in the beginning and 130.8MB in the end (delta: -46.3MB). Peak memory consumption was 104.5MB. Max. memory is 16.1GB. [2022-07-19 10:55:20,665 INFO L158 Benchmark]: Witness Printer took 75.58ms. Allocated memory is still 176.2MB. Free memory was 130.8MB in the beginning and 123.5MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 10:55:20,666 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.19ms. Allocated memory is still 88.1MB. Free memory was 58.0MB in the beginning and 57.9MB in the end (delta: 23.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.58ms. Allocated memory was 88.1MB in the beginning and 111.1MB in the end (delta: 23.1MB). Free memory was 53.6MB in the beginning and 83.6MB in the end (delta: -29.9MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.64ms. Allocated memory is still 111.1MB. Free memory was 83.6MB in the beginning and 81.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.96ms. Allocated memory is still 111.1MB. Free memory was 81.1MB in the beginning and 79.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 564.47ms. Allocated memory is still 111.1MB. Free memory was 79.0MB in the beginning and 84.5MB in the end (delta: -5.5MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. * TraceAbstraction took 4600.40ms. Allocated memory was 111.1MB in the beginning and 176.2MB in the end (delta: 65.0MB). Free memory was 84.5MB in the beginning and 130.8MB in the end (delta: -46.3MB). Peak memory consumption was 104.5MB. Max. memory is 16.1GB. * Witness Printer took 75.58ms. Allocated memory is still 176.2MB. Free memory was 130.8MB in the beginning and 123.5MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. 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: 4.5s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1487 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1478 mSDsluCounter, 6286 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3997 mSDsCounter, 165 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1107 IncrementalHoareTripleChecker+Invalid, 1272 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 165 mSolverCounterUnsat, 2289 mSDtfsCounter, 1107 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred in iteration=12, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 163 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 43 LocationsWithAnnotation, 173 PreInvPairs, 233 NumberOfFragments, 1125 HoareAnnotationTreeSize, 173 FomulaSimplifications, 367 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 43 FomulaSimplificationsInter, 3241 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 573 NumberOfCodeBlocks, 573 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 556 ConstructedInterpolants, 0 QuantifiedInterpolants, 1297 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || (setEventCalled == 1 && MPR1 == s)) || compRegistered == 0) || !(pended == 0)) && (((((!(NP == 1) || !(compRegistered == 0)) || !(5 <= MPR1)) || NP == \old(s)) || !(SKIP1 == \old(s))) || !(pended == 0)) - InvariantResult [Line: 444]: Loop Invariant Derived loop invariant: (((((((((setEventCalled == 1 && 259 == returnVal2) && MPR1 == s) || SKIP1 == NP) || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || (returnVal2 <= 0 && MPR1 == s)) || compRegistered == 0) || !(pended == 0)) && ((((((((((setEventCalled == \old(setEventCalled) && returnVal2 <= 0) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(NP == 1)) || (((setEventCalled == \old(setEventCalled) && 259 == returnVal2) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(compRegistered == 0)) || !(5 <= MPR1)) || NP == \old(s)) || !(SKIP1 == \old(s))) || !(pended == 0)) - InvariantResult [Line: 458]: Loop Invariant Derived loop invariant: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || (setEventCalled == 1 && MPR1 == s)) || compRegistered == 0) || !(pended == 0)) && ((((((!(NP == 1) || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(compRegistered == 0)) || !(5 <= MPR1)) || NP == \old(s)) || !(SKIP1 == \old(s))) || !(pended == 0)) - InvariantResult [Line: 369]: Loop Invariant Derived loop invariant: (((5 <= MPR1 && !(SKIP1 == NP)) && NP == 1) && __cil_tmp8 == 1) && pended == 0 - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && s == NP) && !(SKIP1 == NP)) && NP == 1) && status == 0) && __cil_tmp8 == 1) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: (((((((5 <= MPR1 && !(compRegistered == 0)) && s == NP) && !(SKIP1 == NP)) && NP == 1) && status == 0) && 259 <= status) && __cil_tmp8 == 1) && pended == 0 - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && s == NP) && !(SKIP1 == NP)) && NP == 1) && status == 0) && __cil_tmp8 == 1) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 523]: Loop Invariant Derived loop invariant: (((((((5 <= MPR1 && !(compRegistered == 0)) && s == NP) && !(SKIP1 == NP)) && NP == 1) && status == 0) && 259 <= status) && __cil_tmp8 == 1) && pended == 0 - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: ((((5 <= MPR1 && !(SKIP1 == NP)) && NP == 1) && status == 0) && __cil_tmp8 == 1) && pended == 0 - InvariantResult [Line: 501]: Loop Invariant Derived loop invariant: (((((5 <= MPR1 && !(compRegistered == 0)) && !(SKIP1 == NP)) && NP == 1) && status == 0) && __cil_tmp8 == 1) && pended == 0 - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: (((((5 <= MPR1 && s == NP) && !(SKIP1 == NP)) && NP == 1) && status == 0) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && s == NP) && !(SKIP1 == NP)) && NP == 1) && status == 0) && __cil_tmp8 == 1) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && s == NP) && !(SKIP1 == NP)) && NP == 1) && status == 0) && __cil_tmp8 == 1) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: (((5 <= MPR1 && !(SKIP1 == NP)) && NP == 1) && __cil_tmp8 == 1) && pended == 0 - InvariantResult [Line: 297]: Loop Invariant Derived loop invariant: (((5 <= MPR1 && !(SKIP1 == NP)) && NP == 1) && __cil_tmp8 == 1) && pended == 0 - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: ((((5 <= MPR1 && !(SKIP1 == NP)) && NP == 1) && status == 0) && __cil_tmp8 == 1) && pended == 0 - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: ((((((5 <= MPR1 && s == NP) && !(SKIP1 == NP)) && NP == 1) && status == 0) && __cil_tmp8 == 1) && pended == 0) && compRegistered == 0 - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || (setEventCalled == 1 && s == \old(s))) || !(5 <= MPR1)) || compRegistered == 0) || !(pended == 0)) && (((((!(NP == 1) || !(compRegistered == 0)) || !(5 <= MPR1)) || NP == \old(s)) || !(SKIP1 == \old(s))) || !(pended == 0)) - InvariantResult [Line: 565]: Loop Invariant Derived loop invariant: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || (setEventCalled == 1 && s == \old(s))) || !(5 <= MPR1)) || compRegistered == 0) || !(pended == 0)) && (((((!(NP == 1) || !(compRegistered == 0)) || !(5 <= MPR1)) || NP == \old(s)) || !(SKIP1 == \old(s))) || !(pended == 0)) - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || MPR1 == s) || compRegistered == 0) || !(pended == 0)) && ((((((!(NP == 1) || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(compRegistered == 0)) || !(5 <= MPR1)) || NP == \old(s)) || !(SKIP1 == \old(s))) || !(pended == 0)) - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: (((((((5 <= MPR1 && !(compRegistered == 0)) && s == NP) && !(SKIP1 == NP)) && NP == 1) && status == 0) && 259 <= status) && __cil_tmp8 == 1) && pended == 0 - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || MPR1 == s) || compRegistered == 0) || !(pended == 0)) && ((((((!(NP == 1) || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(compRegistered == 0)) || !(5 <= MPR1)) || NP == \old(s)) || !(SKIP1 == \old(s))) || !(pended == 0)) - InvariantResult [Line: 377]: Loop Invariant Derived loop invariant: (((5 <= MPR1 && !(SKIP1 == NP)) && NP == 1) && __cil_tmp8 == 1) && pended == 0 - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: (((((5 <= MPR1 && !(s == NP)) && !(SKIP1 == NP)) && NP == 1) && status == 0) && pended == 0) && compRegistered == 0 RESULT: Ultimate proved your program to be correct! [2022-07-19 10:55:20,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE