./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ae007674 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/floppy_simpl3.cil-2.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 1fa38cbba4031a56736a5ec3c724b1da0a42c893b0e9010b5807defb3e1b19fa --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-27 21:54:48,469 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-27 21:54:48,471 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-27 21:54:48,515 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-27 21:54:48,515 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-27 21:54:48,518 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-27 21:54:48,519 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-27 21:54:48,523 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-27 21:54:48,525 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-27 21:54:48,529 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-27 21:54:48,530 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-27 21:54:48,533 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-27 21:54:48,534 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-27 21:54:48,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-27 21:54:48,537 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-27 21:54:48,540 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-27 21:54:48,540 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-27 21:54:48,541 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-27 21:54:48,543 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-27 21:54:48,547 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-27 21:54:48,549 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-27 21:54:48,550 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-27 21:54:48,551 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-27 21:54:48,552 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-27 21:54:48,557 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-27 21:54:48,557 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-27 21:54:48,557 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-27 21:54:48,559 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-27 21:54:48,559 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-27 21:54:48,560 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-27 21:54:48,560 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-27 21:54:48,561 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-27 21:54:48,562 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-27 21:54:48,563 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-27 21:54:48,564 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-27 21:54:48,564 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-27 21:54:48,564 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-27 21:54:48,564 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-27 21:54:48,565 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-27 21:54:48,566 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-27 21:54:48,566 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-27 21:54:48,567 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-27 21:54:48,596 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-27 21:54:48,597 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-27 21:54:48,598 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-27 21:54:48,598 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-27 21:54:48,598 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-27 21:54:48,599 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-27 21:54:48,599 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-27 21:54:48,600 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-27 21:54:48,600 INFO L138 SettingsManager]: * Use SBE=true [2021-12-27 21:54:48,600 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-27 21:54:48,601 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-27 21:54:48,601 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-27 21:54:48,601 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-27 21:54:48,601 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-27 21:54:48,601 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-27 21:54:48,601 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-27 21:54:48,602 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-27 21:54:48,602 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-27 21:54:48,602 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-27 21:54:48,602 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-27 21:54:48,602 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-27 21:54:48,602 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-27 21:54:48,602 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-27 21:54:48,603 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-27 21:54:48,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 21:54:48,603 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-27 21:54:48,603 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-27 21:54:48,603 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-27 21:54:48,604 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-27 21:54:48,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-27 21:54:48,604 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-27 21:54:48,604 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-27 21:54:48,605 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-27 21:54:48,605 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 -> 1fa38cbba4031a56736a5ec3c724b1da0a42c893b0e9010b5807defb3e1b19fa [2021-12-27 21:54:48,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-27 21:54:48,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-27 21:54:48,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-27 21:54:48,896 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-27 21:54:48,897 INFO L275 PluginConnector]: CDTParser initialized [2021-12-27 21:54:48,898 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c [2021-12-27 21:54:48,954 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a973e56dc/1d5bddbca4ce45d7b6ccc27f74b77e97/FLAGef39584d1 [2021-12-27 21:54:49,425 INFO L306 CDTParser]: Found 1 translation units. [2021-12-27 21:54:49,425 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-2.c [2021-12-27 21:54:49,432 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a973e56dc/1d5bddbca4ce45d7b6ccc27f74b77e97/FLAGef39584d1 [2021-12-27 21:54:49,829 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a973e56dc/1d5bddbca4ce45d7b6ccc27f74b77e97 [2021-12-27 21:54:49,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-27 21:54:49,833 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-27 21:54:49,835 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-27 21:54:49,835 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-27 21:54:49,838 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-27 21:54:49,838 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:54:49" (1/1) ... [2021-12-27 21:54:49,839 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b79b862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:49, skipping insertion in model container [2021-12-27 21:54:49,839 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:54:49" (1/1) ... [2021-12-27 21:54:49,844 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-27 21:54:49,894 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-27 21:54:50,040 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/floppy_simpl3.cil-2.c[2713,2726] [2021-12-27 21:54:50,220 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 21:54:50,234 INFO L203 MainTranslator]: Completed pre-run [2021-12-27 21:54:50,277 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/floppy_simpl3.cil-2.c[2713,2726] [2021-12-27 21:54:50,334 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 21:54:50,350 INFO L208 MainTranslator]: Completed translation [2021-12-27 21:54:50,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:50 WrapperNode [2021-12-27 21:54:50,351 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-27 21:54:50,352 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-27 21:54:50,352 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-27 21:54:50,352 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-27 21:54:50,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:50" (1/1) ... [2021-12-27 21:54:50,376 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:50" (1/1) ... [2021-12-27 21:54:50,443 INFO L137 Inliner]: procedures = 38, calls = 62, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 916 [2021-12-27 21:54:50,444 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-27 21:54:50,445 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-27 21:54:50,445 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-27 21:54:50,445 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-27 21:54:50,451 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:50" (1/1) ... [2021-12-27 21:54:50,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:50" (1/1) ... [2021-12-27 21:54:50,457 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:50" (1/1) ... [2021-12-27 21:54:50,458 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:50" (1/1) ... [2021-12-27 21:54:50,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:50" (1/1) ... [2021-12-27 21:54:50,481 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:50" (1/1) ... [2021-12-27 21:54:50,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:50" (1/1) ... [2021-12-27 21:54:50,488 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-27 21:54:50,489 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-27 21:54:50,489 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-27 21:54:50,489 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-27 21:54:50,490 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:50" (1/1) ... [2021-12-27 21:54:50,495 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 21:54:50,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:54:50,536 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-27 21:54:50,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-27 21:54:50,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-27 21:54:50,568 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2021-12-27 21:54:50,568 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2021-12-27 21:54:50,569 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2021-12-27 21:54:50,569 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2021-12-27 21:54:50,569 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2021-12-27 21:54:50,569 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2021-12-27 21:54:50,570 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2021-12-27 21:54:50,574 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2021-12-27 21:54:50,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-27 21:54:50,575 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2021-12-27 21:54:50,576 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2021-12-27 21:54:50,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-27 21:54:50,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-27 21:54:50,781 INFO L234 CfgBuilder]: Building ICFG [2021-12-27 21:54:50,782 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-27 21:54:50,786 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-27 21:54:50,879 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2021-12-27 21:54:50,880 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2021-12-27 21:54:50,880 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-27 21:54:50,894 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-12-27 21:54:50,894 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-12-27 21:54:50,910 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-27 21:54:50,913 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-27 21:54:50,916 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-27 21:54:50,921 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-27 21:54:50,926 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-27 21:54:50,928 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-27 21:54:50,930 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-27 21:54:50,930 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-27 21:54:50,933 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-27 21:54:51,297 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume !false; [2021-12-27 21:54:51,297 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume false; [2021-12-27 21:54:51,298 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##171: assume !false; [2021-12-27 21:54:51,298 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##170: assume false; [2021-12-27 21:54:51,298 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##75: assume !false; [2021-12-27 21:54:51,298 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##74: assume false; [2021-12-27 21:54:51,298 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##45: assume !false; [2021-12-27 21:54:51,298 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume false; [2021-12-27 21:54:51,298 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##32: assume !false; [2021-12-27 21:54:51,298 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume false; [2021-12-27 21:54:51,299 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2021-12-27 21:54:51,299 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2021-12-27 21:54:51,299 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##109: assume false; [2021-12-27 21:54:51,299 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##110: assume !false; [2021-12-27 21:54:51,299 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##119: assume !false; [2021-12-27 21:54:51,299 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##118: assume false; [2021-12-27 21:54:51,300 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##122: assume false; [2021-12-27 21:54:51,300 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##123: assume !false; [2021-12-27 21:54:51,303 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-27 21:54:51,338 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2021-12-27 21:54:51,339 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2021-12-27 21:54:51,346 INFO L275 CfgBuilder]: Performing block encoding [2021-12-27 21:54:51,357 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-27 21:54:51,357 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-27 21:54:51,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:54:51 BoogieIcfgContainer [2021-12-27 21:54:51,360 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-27 21:54:51,361 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-27 21:54:51,361 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-27 21:54:51,363 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-27 21:54:51,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:54:49" (1/3) ... [2021-12-27 21:54:51,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bfa803c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:54:51, skipping insertion in model container [2021-12-27 21:54:51,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:50" (2/3) ... [2021-12-27 21:54:51,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bfa803c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:54:51, skipping insertion in model container [2021-12-27 21:54:51,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:54:51" (3/3) ... [2021-12-27 21:54:51,366 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl3.cil-2.c [2021-12-27 21:54:51,370 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-27 21:54:51,370 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-27 21:54:51,407 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-27 21:54:51,412 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-27 21:54:51,412 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-27 21:54:51,427 INFO L276 IsEmpty]: Start isEmpty. Operand has 237 states, 193 states have (on average 1.4818652849740932) internal successors, (286), 214 states have internal predecessors, (286), 37 states have call successors, (37), 5 states have call predecessors, (37), 5 states have return successors, (37), 32 states have call predecessors, (37), 37 states have call successors, (37) [2021-12-27 21:54:51,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-27 21:54:51,430 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:51,431 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:54:51,431 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:51,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:51,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1609888969, now seen corresponding path program 1 times [2021-12-27 21:54:51,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:51,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322381828] [2021-12-27 21:54:51,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:51,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:51,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:51,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:51,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322381828] [2021-12-27 21:54:51,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322381828] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:51,576 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:51,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:54:51,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396851233] [2021-12-27 21:54:51,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:51,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:54:51,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:51,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:54:51,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:54:51,606 INFO L87 Difference]: Start difference. First operand has 237 states, 193 states have (on average 1.4818652849740932) internal successors, (286), 214 states have internal predecessors, (286), 37 states have call successors, (37), 5 states have call predecessors, (37), 5 states have return successors, (37), 32 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:54:51,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:51,663 INFO L93 Difference]: Finished difference Result 404 states and 621 transitions. [2021-12-27 21:54:51,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:54:51,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-27 21:54:51,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:51,680 INFO L225 Difference]: With dead ends: 404 [2021-12-27 21:54:51,680 INFO L226 Difference]: Without dead ends: 229 [2021-12-27 21:54:51,689 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:54:51,694 INFO L933 BasicCegarLoop]: 335 mSDtfsCounter, 193 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:51,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 447 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:54:51,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-12-27 21:54:51,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2021-12-27 21:54:51,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 187 states have (on average 1.4224598930481283) internal successors, (266), 206 states have internal predecessors, (266), 37 states have call successors, (37), 5 states have call predecessors, (37), 4 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2021-12-27 21:54:51,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 322 transitions. [2021-12-27 21:54:51,768 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 322 transitions. Word has length 13 [2021-12-27 21:54:51,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:51,769 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 322 transitions. [2021-12-27 21:54:51,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:54:51,769 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 322 transitions. [2021-12-27 21:54:51,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-27 21:54:51,771 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:51,773 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:54:51,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-27 21:54:51,774 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:51,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:51,776 INFO L85 PathProgramCache]: Analyzing trace with hash 22809717, now seen corresponding path program 1 times [2021-12-27 21:54:51,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:51,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600197190] [2021-12-27 21:54:51,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:51,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:51,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:51,861 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:51,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600197190] [2021-12-27 21:54:51,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600197190] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:51,861 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:51,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:54:51,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905611013] [2021-12-27 21:54:51,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:51,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:54:51,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:51,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:54:51,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:54:51,863 INFO L87 Difference]: Start difference. First operand 229 states and 322 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:54:51,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:51,935 INFO L93 Difference]: Finished difference Result 471 states and 666 transitions. [2021-12-27 21:54:51,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:54:51,935 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), 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 18 [2021-12-27 21:54:51,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:51,937 INFO L225 Difference]: With dead ends: 471 [2021-12-27 21:54:51,937 INFO L226 Difference]: Without dead ends: 343 [2021-12-27 21:54:51,938 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:54:51,939 INFO L933 BasicCegarLoop]: 412 mSDtfsCounter, 251 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:51,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [251 Valid, 583 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:54:51,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2021-12-27 21:54:51,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 326. [2021-12-27 21:54:51,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 281 states have (on average 1.3629893238434163) internal successors, (383), 285 states have internal predecessors, (383), 37 states have call successors, (37), 9 states have call predecessors, (37), 7 states have return successors, (40), 32 states have call predecessors, (40), 27 states have call successors, (40) [2021-12-27 21:54:51,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 460 transitions. [2021-12-27 21:54:51,956 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 460 transitions. Word has length 18 [2021-12-27 21:54:51,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:51,956 INFO L470 AbstractCegarLoop]: Abstraction has 326 states and 460 transitions. [2021-12-27 21:54:51,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:54:51,957 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 460 transitions. [2021-12-27 21:54:51,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-27 21:54:51,957 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:51,957 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:54:51,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-27 21:54:51,958 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:51,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:51,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1035240125, now seen corresponding path program 1 times [2021-12-27 21:54:51,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:51,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225574785] [2021-12-27 21:54:51,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:51,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:52,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:52,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:52,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225574785] [2021-12-27 21:54:52,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225574785] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:52,007 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:52,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:54:52,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735120358] [2021-12-27 21:54:52,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:52,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:54:52,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:52,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:54:52,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:54:52,009 INFO L87 Difference]: Start difference. First operand 326 states and 460 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:54:52,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:52,031 INFO L93 Difference]: Finished difference Result 715 states and 1005 transitions. [2021-12-27 21:54:52,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:54:52,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 19 [2021-12-27 21:54:52,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:52,034 INFO L225 Difference]: With dead ends: 715 [2021-12-27 21:54:52,034 INFO L226 Difference]: Without dead ends: 512 [2021-12-27 21:54:52,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:54:52,036 INFO L933 BasicCegarLoop]: 314 mSDtfsCounter, 273 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:52,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [273 Valid, 479 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:54:52,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2021-12-27 21:54:52,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 485. [2021-12-27 21:54:52,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 423 states have (on average 1.3617021276595744) internal successors, (576), 424 states have internal predecessors, (576), 47 states have call successors, (47), 17 states have call predecessors, (47), 14 states have return successors, (61), 44 states have call predecessors, (61), 39 states have call successors, (61) [2021-12-27 21:54:52,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 684 transitions. [2021-12-27 21:54:52,056 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 684 transitions. Word has length 19 [2021-12-27 21:54:52,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:52,056 INFO L470 AbstractCegarLoop]: Abstraction has 485 states and 684 transitions. [2021-12-27 21:54:52,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:54:52,057 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 684 transitions. [2021-12-27 21:54:52,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-27 21:54:52,057 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:52,058 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:54:52,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-27 21:54:52,058 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:52,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:52,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1224032819, now seen corresponding path program 1 times [2021-12-27 21:54:52,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:52,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406939577] [2021-12-27 21:54:52,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:52,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:52,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:52,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:52,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406939577] [2021-12-27 21:54:52,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406939577] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:52,091 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:52,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:54:52,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573281213] [2021-12-27 21:54:52,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:52,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:54:52,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:52,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:54:52,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:54:52,092 INFO L87 Difference]: Start difference. First operand 485 states and 684 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:54:52,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:52,113 INFO L93 Difference]: Finished difference Result 574 states and 797 transitions. [2021-12-27 21:54:52,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:54:52,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 22 [2021-12-27 21:54:52,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:52,116 INFO L225 Difference]: With dead ends: 574 [2021-12-27 21:54:52,116 INFO L226 Difference]: Without dead ends: 556 [2021-12-27 21:54:52,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:54:52,117 INFO L933 BasicCegarLoop]: 304 mSDtfsCounter, 277 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:52,118 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 384 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:54:52,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2021-12-27 21:54:52,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 523. [2021-12-27 21:54:52,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 455 states have (on average 1.3604395604395605) internal successors, (619), 462 states have internal predecessors, (619), 49 states have call successors, (49), 20 states have call predecessors, (49), 18 states have return successors, (65), 42 states have call predecessors, (65), 42 states have call successors, (65) [2021-12-27 21:54:52,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 733 transitions. [2021-12-27 21:54:52,138 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 733 transitions. Word has length 22 [2021-12-27 21:54:52,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:52,139 INFO L470 AbstractCegarLoop]: Abstraction has 523 states and 733 transitions. [2021-12-27 21:54:52,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:54:52,139 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 733 transitions. [2021-12-27 21:54:52,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-27 21:54:52,140 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:52,140 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:54:52,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-27 21:54:52,140 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:52,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:52,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1110251401, now seen corresponding path program 1 times [2021-12-27 21:54:52,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:52,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615865799] [2021-12-27 21:54:52,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:52,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:52,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:52,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:52,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615865799] [2021-12-27 21:54:52,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615865799] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:52,170 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:52,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:54:52,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234581105] [2021-12-27 21:54:52,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:52,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:54:52,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:52,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:54:52,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:54:52,172 INFO L87 Difference]: Start difference. First operand 523 states and 733 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:54:52,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:52,254 INFO L93 Difference]: Finished difference Result 806 states and 1133 transitions. [2021-12-27 21:54:52,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:54:52,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-27 21:54:52,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:52,260 INFO L225 Difference]: With dead ends: 806 [2021-12-27 21:54:52,261 INFO L226 Difference]: Without dead ends: 803 [2021-12-27 21:54:52,261 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:54:52,264 INFO L933 BasicCegarLoop]: 404 mSDtfsCounter, 120 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:52,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 662 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:54:52,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2021-12-27 21:54:52,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 614. [2021-12-27 21:54:52,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 540 states have (on average 1.3685185185185185) internal successors, (739), 550 states have internal predecessors, (739), 51 states have call successors, (51), 22 states have call predecessors, (51), 22 states have return successors, (72), 43 states have call predecessors, (72), 44 states have call successors, (72) [2021-12-27 21:54:52,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 862 transitions. [2021-12-27 21:54:52,295 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 862 transitions. Word has length 27 [2021-12-27 21:54:52,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:52,295 INFO L470 AbstractCegarLoop]: Abstraction has 614 states and 862 transitions. [2021-12-27 21:54:52,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:54:52,296 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 862 transitions. [2021-12-27 21:54:52,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-27 21:54:52,300 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:52,300 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:54:52,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-27 21:54:52,301 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:52,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:52,301 INFO L85 PathProgramCache]: Analyzing trace with hash -296160983, now seen corresponding path program 1 times [2021-12-27 21:54:52,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:52,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779298889] [2021-12-27 21:54:52,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:52,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:52,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:52,370 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:52,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779298889] [2021-12-27 21:54:52,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779298889] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:52,371 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:52,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-27 21:54:52,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582719574] [2021-12-27 21:54:52,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:52,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 21:54:52,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:52,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 21:54:52,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-27 21:54:52,372 INFO L87 Difference]: Start difference. First operand 614 states and 862 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:54:52,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:52,555 INFO L93 Difference]: Finished difference Result 1073 states and 1480 transitions. [2021-12-27 21:54:52,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-27 21:54:52,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 28 [2021-12-27 21:54:52,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:52,557 INFO L225 Difference]: With dead ends: 1073 [2021-12-27 21:54:52,558 INFO L226 Difference]: Without dead ends: 639 [2021-12-27 21:54:52,558 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-27 21:54:52,559 INFO L933 BasicCegarLoop]: 391 mSDtfsCounter, 513 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:52,559 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [516 Valid, 527 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:54:52,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2021-12-27 21:54:52,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 605. [2021-12-27 21:54:52,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 531 states have (on average 1.3521657250470809) internal successors, (718), 541 states have internal predecessors, (718), 51 states have call successors, (51), 22 states have call predecessors, (51), 22 states have return successors, (72), 43 states have call predecessors, (72), 44 states have call successors, (72) [2021-12-27 21:54:52,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 841 transitions. [2021-12-27 21:54:52,579 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 841 transitions. Word has length 28 [2021-12-27 21:54:52,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:52,580 INFO L470 AbstractCegarLoop]: Abstraction has 605 states and 841 transitions. [2021-12-27 21:54:52,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:54:52,580 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 841 transitions. [2021-12-27 21:54:52,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-27 21:54:52,581 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:52,581 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:54:52,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-27 21:54:52,581 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:52,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:52,582 INFO L85 PathProgramCache]: Analyzing trace with hash 115155175, now seen corresponding path program 1 times [2021-12-27 21:54:52,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:52,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041201147] [2021-12-27 21:54:52,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:52,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:52,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:52,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-27 21:54:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:52,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:52,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:52,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041201147] [2021-12-27 21:54:52,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041201147] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:52,611 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:52,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-27 21:54:52,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129047865] [2021-12-27 21:54:52,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:52,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 21:54:52,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:52,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 21:54:52,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-27 21:54:52,612 INFO L87 Difference]: Start difference. First operand 605 states and 841 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-27 21:54:52,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:52,730 INFO L93 Difference]: Finished difference Result 650 states and 899 transitions. [2021-12-27 21:54:52,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 21:54:52,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 29 [2021-12-27 21:54:52,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:52,733 INFO L225 Difference]: With dead ends: 650 [2021-12-27 21:54:52,733 INFO L226 Difference]: Without dead ends: 645 [2021-12-27 21:54:52,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-27 21:54:52,734 INFO L933 BasicCegarLoop]: 286 mSDtfsCounter, 64 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:52,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 735 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:54:52,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2021-12-27 21:54:52,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 626. [2021-12-27 21:54:52,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 552 states have (on average 1.3496376811594204) internal successors, (745), 561 states have internal predecessors, (745), 51 states have call successors, (51), 22 states have call predecessors, (51), 22 states have return successors, (72), 43 states have call predecessors, (72), 44 states have call successors, (72) [2021-12-27 21:54:52,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 868 transitions. [2021-12-27 21:54:52,754 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 868 transitions. Word has length 29 [2021-12-27 21:54:52,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:52,754 INFO L470 AbstractCegarLoop]: Abstraction has 626 states and 868 transitions. [2021-12-27 21:54:52,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-27 21:54:52,754 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 868 transitions. [2021-12-27 21:54:52,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-27 21:54:52,755 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:52,755 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:54:52,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-27 21:54:52,755 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:52,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:52,756 INFO L85 PathProgramCache]: Analyzing trace with hash -272970601, now seen corresponding path program 1 times [2021-12-27 21:54:52,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:52,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298629400] [2021-12-27 21:54:52,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:52,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:52,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-27 21:54:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:52,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:52,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:52,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298629400] [2021-12-27 21:54:52,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298629400] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:52,825 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:52,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-27 21:54:52,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882283463] [2021-12-27 21:54:52,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:52,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-27 21:54:52,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:52,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-27 21:54:52,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-27 21:54:52,826 INFO L87 Difference]: Start difference. First operand 626 states and 868 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-27 21:54:52,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:52,980 INFO L93 Difference]: Finished difference Result 651 states and 898 transitions. [2021-12-27 21:54:52,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-27 21:54:52,981 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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 30 [2021-12-27 21:54:52,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:52,983 INFO L225 Difference]: With dead ends: 651 [2021-12-27 21:54:52,983 INFO L226 Difference]: Without dead ends: 645 [2021-12-27 21:54:52,983 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-27 21:54:52,985 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 393 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:52,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [400 Valid, 701 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:54:52,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2021-12-27 21:54:53,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 626. [2021-12-27 21:54:53,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 552 states have (on average 1.3478260869565217) internal successors, (744), 561 states have internal predecessors, (744), 51 states have call successors, (51), 22 states have call predecessors, (51), 22 states have return successors, (72), 43 states have call predecessors, (72), 44 states have call successors, (72) [2021-12-27 21:54:53,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 867 transitions. [2021-12-27 21:54:53,008 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 867 transitions. Word has length 30 [2021-12-27 21:54:53,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:53,009 INFO L470 AbstractCegarLoop]: Abstraction has 626 states and 867 transitions. [2021-12-27 21:54:53,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-27 21:54:53,011 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 867 transitions. [2021-12-27 21:54:53,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-27 21:54:53,012 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:53,012 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:54:53,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-27 21:54:53,012 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:53,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:53,013 INFO L85 PathProgramCache]: Analyzing trace with hash -853978920, now seen corresponding path program 1 times [2021-12-27 21:54:53,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:53,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267095576] [2021-12-27 21:54:53,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:53,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:53,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:53,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:53,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:53,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267095576] [2021-12-27 21:54:53,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267095576] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:53,044 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:53,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:54:53,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780866317] [2021-12-27 21:54:53,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:53,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:54:53,045 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:53,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:54:53,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:54:53,045 INFO L87 Difference]: Start difference. First operand 626 states and 867 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:54:53,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:53,103 INFO L93 Difference]: Finished difference Result 641 states and 887 transitions. [2021-12-27 21:54:53,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:54:53,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 30 [2021-12-27 21:54:53,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:53,105 INFO L225 Difference]: With dead ends: 641 [2021-12-27 21:54:53,106 INFO L226 Difference]: Without dead ends: 638 [2021-12-27 21:54:53,106 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:54:53,106 INFO L933 BasicCegarLoop]: 306 mSDtfsCounter, 16 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:53,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 547 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:54:53,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2021-12-27 21:54:53,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 637. [2021-12-27 21:54:53,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 563 states have (on average 1.3463587921847247) internal successors, (758), 571 states have internal predecessors, (758), 51 states have call successors, (51), 23 states have call predecessors, (51), 22 states have return successors, (72), 43 states have call predecessors, (72), 44 states have call successors, (72) [2021-12-27 21:54:53,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 881 transitions. [2021-12-27 21:54:53,130 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 881 transitions. Word has length 30 [2021-12-27 21:54:53,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:53,130 INFO L470 AbstractCegarLoop]: Abstraction has 637 states and 881 transitions. [2021-12-27 21:54:53,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:54:53,130 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 881 transitions. [2021-12-27 21:54:53,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-27 21:54:53,131 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:53,131 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:54:53,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-27 21:54:53,132 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:53,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:53,132 INFO L85 PathProgramCache]: Analyzing trace with hash -732236972, now seen corresponding path program 1 times [2021-12-27 21:54:53,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:53,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927089803] [2021-12-27 21:54:53,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:53,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:53,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-27 21:54:53,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:53,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:53,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:53,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927089803] [2021-12-27 21:54:53,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927089803] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:53,185 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:53,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-27 21:54:53,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235731137] [2021-12-27 21:54:53,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:53,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-27 21:54:53,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:53,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-27 21:54:53,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-27 21:54:53,187 INFO L87 Difference]: Start difference. First operand 637 states and 881 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-27 21:54:53,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:53,354 INFO L93 Difference]: Finished difference Result 662 states and 911 transitions. [2021-12-27 21:54:53,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-27 21:54:53,354 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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 31 [2021-12-27 21:54:53,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:53,357 INFO L225 Difference]: With dead ends: 662 [2021-12-27 21:54:53,357 INFO L226 Difference]: Without dead ends: 656 [2021-12-27 21:54:53,357 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-27 21:54:53,358 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 374 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:53,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [381 Valid, 911 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:54:53,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2021-12-27 21:54:53,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 637. [2021-12-27 21:54:53,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 563 states have (on average 1.344582593250444) internal successors, (757), 571 states have internal predecessors, (757), 51 states have call successors, (51), 23 states have call predecessors, (51), 22 states have return successors, (72), 43 states have call predecessors, (72), 44 states have call successors, (72) [2021-12-27 21:54:53,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 880 transitions. [2021-12-27 21:54:53,382 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 880 transitions. Word has length 31 [2021-12-27 21:54:53,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:53,383 INFO L470 AbstractCegarLoop]: Abstraction has 637 states and 880 transitions. [2021-12-27 21:54:53,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-27 21:54:53,383 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 880 transitions. [2021-12-27 21:54:53,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-27 21:54:53,384 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:53,384 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:54:53,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-27 21:54:53,384 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:53,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:53,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1140425248, now seen corresponding path program 1 times [2021-12-27 21:54:53,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:53,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202021293] [2021-12-27 21:54:53,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:53,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:53,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-27 21:54:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:53,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:53,413 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:53,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202021293] [2021-12-27 21:54:53,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202021293] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:53,413 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:53,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-27 21:54:53,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460800002] [2021-12-27 21:54:53,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:53,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-27 21:54:53,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:53,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-27 21:54:53,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-27 21:54:53,414 INFO L87 Difference]: Start difference. First operand 637 states and 880 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-27 21:54:53,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:53,507 INFO L93 Difference]: Finished difference Result 668 states and 917 transitions. [2021-12-27 21:54:53,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 21:54:53,507 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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 32 [2021-12-27 21:54:53,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:53,509 INFO L225 Difference]: With dead ends: 668 [2021-12-27 21:54:53,509 INFO L226 Difference]: Without dead ends: 652 [2021-12-27 21:54:53,510 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-27 21:54:53,510 INFO L933 BasicCegarLoop]: 295 mSDtfsCounter, 52 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:53,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 1069 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:54:53,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2021-12-27 21:54:53,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 635. [2021-12-27 21:54:53,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 562 states have (on average 1.3434163701067616) internal successors, (755), 570 states have internal predecessors, (755), 50 states have call successors, (50), 23 states have call predecessors, (50), 22 states have return successors, (71), 42 states have call predecessors, (71), 43 states have call successors, (71) [2021-12-27 21:54:53,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 876 transitions. [2021-12-27 21:54:53,532 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 876 transitions. Word has length 32 [2021-12-27 21:54:53,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:53,532 INFO L470 AbstractCegarLoop]: Abstraction has 635 states and 876 transitions. [2021-12-27 21:54:53,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-27 21:54:53,532 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 876 transitions. [2021-12-27 21:54:53,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-27 21:54:53,533 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:53,533 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:54:53,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-27 21:54:53,533 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:53,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:53,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1561555971, now seen corresponding path program 1 times [2021-12-27 21:54:53,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:53,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866017725] [2021-12-27 21:54:53,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:53,534 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:53,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:53,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:53,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866017725] [2021-12-27 21:54:53,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866017725] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:53,564 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:53,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:54:53,564 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603487] [2021-12-27 21:54:53,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:53,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:54:53,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:53,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:54:53,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:54:53,565 INFO L87 Difference]: Start difference. First operand 635 states and 876 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:54:53,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:53,624 INFO L93 Difference]: Finished difference Result 1042 states and 1433 transitions. [2021-12-27 21:54:53,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:54:53,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 34 [2021-12-27 21:54:53,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:53,627 INFO L225 Difference]: With dead ends: 1042 [2021-12-27 21:54:53,627 INFO L226 Difference]: Without dead ends: 643 [2021-12-27 21:54:53,627 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:54:53,628 INFO L933 BasicCegarLoop]: 304 mSDtfsCounter, 5 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:53,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 558 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:54:53,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2021-12-27 21:54:53,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2021-12-27 21:54:53,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 570 states have (on average 1.343859649122807) internal successors, (766), 578 states have internal predecessors, (766), 50 states have call successors, (50), 23 states have call predecessors, (50), 22 states have return successors, (71), 42 states have call predecessors, (71), 43 states have call successors, (71) [2021-12-27 21:54:53,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 887 transitions. [2021-12-27 21:54:53,648 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 887 transitions. Word has length 34 [2021-12-27 21:54:53,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:53,648 INFO L470 AbstractCegarLoop]: Abstraction has 643 states and 887 transitions. [2021-12-27 21:54:53,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:54:53,649 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 887 transitions. [2021-12-27 21:54:53,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-27 21:54:53,649 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:53,649 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:54:53,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-27 21:54:53,650 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:53,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:53,650 INFO L85 PathProgramCache]: Analyzing trace with hash 821298349, now seen corresponding path program 1 times [2021-12-27 21:54:53,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:53,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666393728] [2021-12-27 21:54:53,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:53,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:53,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:53,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-27 21:54:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:53,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:53,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:53,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666393728] [2021-12-27 21:54:53,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666393728] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:53,688 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:53,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-27 21:54:53,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862055896] [2021-12-27 21:54:53,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:53,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-27 21:54:53,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:53,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-27 21:54:53,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-27 21:54:53,689 INFO L87 Difference]: Start difference. First operand 643 states and 887 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-27 21:54:53,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:53,858 INFO L93 Difference]: Finished difference Result 727 states and 971 transitions. [2021-12-27 21:54:53,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-27 21:54:53,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 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) Word has length 38 [2021-12-27 21:54:53,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:53,860 INFO L225 Difference]: With dead ends: 727 [2021-12-27 21:54:53,861 INFO L226 Difference]: Without dead ends: 468 [2021-12-27 21:54:53,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-27 21:54:53,862 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 382 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:53,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [384 Valid, 824 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:54:53,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2021-12-27 21:54:53,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 427. [2021-12-27 21:54:53,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 375 states have (on average 1.312) internal successors, (492), 383 states have internal predecessors, (492), 35 states have call successors, (35), 16 states have call predecessors, (35), 16 states have return successors, (39), 28 states have call predecessors, (39), 28 states have call successors, (39) [2021-12-27 21:54:53,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 566 transitions. [2021-12-27 21:54:53,877 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 566 transitions. Word has length 38 [2021-12-27 21:54:53,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:53,877 INFO L470 AbstractCegarLoop]: Abstraction has 427 states and 566 transitions. [2021-12-27 21:54:53,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-27 21:54:53,877 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 566 transitions. [2021-12-27 21:54:53,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-27 21:54:53,878 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:53,878 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:54:53,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-27 21:54:53,878 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:53,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:53,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1999113680, now seen corresponding path program 1 times [2021-12-27 21:54:53,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:53,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553411067] [2021-12-27 21:54:53,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:53,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:53,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-27 21:54:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:53,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:53,953 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:53,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553411067] [2021-12-27 21:54:53,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553411067] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:53,953 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:53,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-27 21:54:53,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333892821] [2021-12-27 21:54:53,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:53,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-27 21:54:53,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:53,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-27 21:54:53,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-27 21:54:53,954 INFO L87 Difference]: Start difference. First operand 427 states and 566 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-27 21:54:54,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:54,098 INFO L93 Difference]: Finished difference Result 630 states and 837 transitions. [2021-12-27 21:54:54,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 21:54:54,098 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, (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) Word has length 41 [2021-12-27 21:54:54,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:54,099 INFO L225 Difference]: With dead ends: 630 [2021-12-27 21:54:54,100 INFO L226 Difference]: Without dead ends: 422 [2021-12-27 21:54:54,100 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-27 21:54:54,100 INFO L933 BasicCegarLoop]: 303 mSDtfsCounter, 74 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:54,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 1575 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:54:54,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-12-27 21:54:54,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 410. [2021-12-27 21:54:54,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 359 states have (on average 1.3008356545961002) internal successors, (467), 366 states have internal predecessors, (467), 34 states have call successors, (34), 16 states have call predecessors, (34), 16 states have return successors, (39), 28 states have call predecessors, (39), 28 states have call successors, (39) [2021-12-27 21:54:54,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 540 transitions. [2021-12-27 21:54:54,131 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 540 transitions. Word has length 41 [2021-12-27 21:54:54,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:54,131 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 540 transitions. [2021-12-27 21:54:54,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-27 21:54:54,131 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 540 transitions. [2021-12-27 21:54:54,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-27 21:54:54,132 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:54,132 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:54:54,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-27 21:54:54,132 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:54,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:54,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1097053987, now seen corresponding path program 1 times [2021-12-27 21:54:54,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:54,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374418641] [2021-12-27 21:54:54,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:54,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:54,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:54,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-27 21:54:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:54,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:54,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:54,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374418641] [2021-12-27 21:54:54,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374418641] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:54,171 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:54,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-27 21:54:54,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039927643] [2021-12-27 21:54:54,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:54,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-27 21:54:54,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:54,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-27 21:54:54,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-27 21:54:54,173 INFO L87 Difference]: Start difference. First operand 410 states and 540 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-27 21:54:54,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:54,412 INFO L93 Difference]: Finished difference Result 505 states and 658 transitions. [2021-12-27 21:54:54,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-27 21:54:54,413 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-12-27 21:54:54,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:54,414 INFO L225 Difference]: With dead ends: 505 [2021-12-27 21:54:54,414 INFO L226 Difference]: Without dead ends: 447 [2021-12-27 21:54:54,415 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-12-27 21:54:54,415 INFO L933 BasicCegarLoop]: 296 mSDtfsCounter, 357 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:54,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [365 Valid, 1128 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-27 21:54:54,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2021-12-27 21:54:54,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 410. [2021-12-27 21:54:54,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 359 states have (on average 1.2952646239554317) internal successors, (465), 366 states have internal predecessors, (465), 34 states have call successors, (34), 16 states have call predecessors, (34), 16 states have return successors, (39), 28 states have call predecessors, (39), 28 states have call successors, (39) [2021-12-27 21:54:54,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 538 transitions. [2021-12-27 21:54:54,431 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 538 transitions. Word has length 40 [2021-12-27 21:54:54,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:54,431 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 538 transitions. [2021-12-27 21:54:54,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-27 21:54:54,431 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 538 transitions. [2021-12-27 21:54:54,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-27 21:54:54,432 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:54,432 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:54:54,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-27 21:54:54,432 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:54,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:54,433 INFO L85 PathProgramCache]: Analyzing trace with hash 418295830, now seen corresponding path program 1 times [2021-12-27 21:54:54,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:54,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567779551] [2021-12-27 21:54:54,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:54,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:54,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-27 21:54:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:54,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:54,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:54,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567779551] [2021-12-27 21:54:54,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567779551] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:54,470 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:54,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-27 21:54:54,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821167374] [2021-12-27 21:54:54,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:54,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-27 21:54:54,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:54,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-27 21:54:54,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-27 21:54:54,471 INFO L87 Difference]: Start difference. First operand 410 states and 538 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-27 21:54:54,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:54,586 INFO L93 Difference]: Finished difference Result 439 states and 569 transitions. [2021-12-27 21:54:54,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-27 21:54:54,586 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2021-12-27 21:54:54,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:54,587 INFO L225 Difference]: With dead ends: 439 [2021-12-27 21:54:54,588 INFO L226 Difference]: Without dead ends: 404 [2021-12-27 21:54:54,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-27 21:54:54,588 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 74 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:54,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 1314 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:54:54,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2021-12-27 21:54:54,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 392. [2021-12-27 21:54:54,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 345 states have (on average 1.2927536231884058) internal successors, (446), 351 states have internal predecessors, (446), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (37), 27 states have call predecessors, (37), 26 states have call successors, (37) [2021-12-27 21:54:54,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 515 transitions. [2021-12-27 21:54:54,603 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 515 transitions. Word has length 41 [2021-12-27 21:54:54,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:54,603 INFO L470 AbstractCegarLoop]: Abstraction has 392 states and 515 transitions. [2021-12-27 21:54:54,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-27 21:54:54,603 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 515 transitions. [2021-12-27 21:54:54,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-27 21:54:54,604 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:54,604 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:54:54,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-27 21:54:54,604 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:54,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:54,605 INFO L85 PathProgramCache]: Analyzing trace with hash -958406699, now seen corresponding path program 1 times [2021-12-27 21:54:54,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:54,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936412245] [2021-12-27 21:54:54,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:54,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:54,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-27 21:54:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:54,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:54,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:54,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936412245] [2021-12-27 21:54:54,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936412245] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:54,657 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:54,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-27 21:54:54,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003705745] [2021-12-27 21:54:54,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:54,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-27 21:54:54,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:54,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-27 21:54:54,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-27 21:54:54,658 INFO L87 Difference]: Start difference. First operand 392 states and 515 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-27 21:54:54,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:54,839 INFO L93 Difference]: Finished difference Result 595 states and 783 transitions. [2021-12-27 21:54:54,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-27 21:54:54,839 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 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) Word has length 43 [2021-12-27 21:54:54,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:54,841 INFO L225 Difference]: With dead ends: 595 [2021-12-27 21:54:54,841 INFO L226 Difference]: Without dead ends: 404 [2021-12-27 21:54:54,842 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-12-27 21:54:54,842 INFO L933 BasicCegarLoop]: 280 mSDtfsCounter, 315 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:54,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 899 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:54:54,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2021-12-27 21:54:54,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 392. [2021-12-27 21:54:54,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 345 states have (on average 1.289855072463768) internal successors, (445), 351 states have internal predecessors, (445), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (37), 27 states have call predecessors, (37), 26 states have call successors, (37) [2021-12-27 21:54:54,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 514 transitions. [2021-12-27 21:54:54,857 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 514 transitions. Word has length 43 [2021-12-27 21:54:54,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:54,857 INFO L470 AbstractCegarLoop]: Abstraction has 392 states and 514 transitions. [2021-12-27 21:54:54,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-27 21:54:54,858 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 514 transitions. [2021-12-27 21:54:54,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-27 21:54:54,858 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:54,858 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:54:54,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-27 21:54:54,859 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:54,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:54,859 INFO L85 PathProgramCache]: Analyzing trace with hash -328240312, now seen corresponding path program 1 times [2021-12-27 21:54:54,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:54,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304251137] [2021-12-27 21:54:54,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:54,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:54,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:54,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-27 21:54:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:54,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:54,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:54,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304251137] [2021-12-27 21:54:54,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304251137] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:54,921 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:54,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-27 21:54:54,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432137651] [2021-12-27 21:54:54,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:54,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-27 21:54:54,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:54,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-27 21:54:54,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-27 21:54:54,922 INFO L87 Difference]: Start difference. First operand 392 states and 514 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-27 21:54:55,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:55,087 INFO L93 Difference]: Finished difference Result 665 states and 879 transitions. [2021-12-27 21:54:55,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-27 21:54:55,087 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 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 42 [2021-12-27 21:54:55,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:55,089 INFO L225 Difference]: With dead ends: 665 [2021-12-27 21:54:55,089 INFO L226 Difference]: Without dead ends: 411 [2021-12-27 21:54:55,089 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-12-27 21:54:55,089 INFO L933 BasicCegarLoop]: 273 mSDtfsCounter, 334 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:55,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [339 Valid, 902 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:54:55,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2021-12-27 21:54:55,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 384. [2021-12-27 21:54:55,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 338 states have (on average 1.2810650887573964) internal successors, (433), 344 states have internal predecessors, (433), 32 states have call successors, (32), 14 states have call predecessors, (32), 13 states have return successors, (36), 26 states have call predecessors, (36), 26 states have call successors, (36) [2021-12-27 21:54:55,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 501 transitions. [2021-12-27 21:54:55,143 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 501 transitions. Word has length 42 [2021-12-27 21:54:55,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:55,144 INFO L470 AbstractCegarLoop]: Abstraction has 384 states and 501 transitions. [2021-12-27 21:54:55,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-27 21:54:55,144 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 501 transitions. [2021-12-27 21:54:55,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-27 21:54:55,145 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:55,145 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:54:55,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-27 21:54:55,145 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:55,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:55,145 INFO L85 PathProgramCache]: Analyzing trace with hash -942033848, now seen corresponding path program 1 times [2021-12-27 21:54:55,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:55,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106746100] [2021-12-27 21:54:55,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:55,146 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:55,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-27 21:54:55,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:55,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:55,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:55,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106746100] [2021-12-27 21:54:55,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106746100] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:55,202 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:55,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-27 21:54:55,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143567500] [2021-12-27 21:54:55,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:55,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 21:54:55,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:55,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 21:54:55,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-27 21:54:55,203 INFO L87 Difference]: Start difference. First operand 384 states and 501 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-27 21:54:55,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:55,317 INFO L93 Difference]: Finished difference Result 410 states and 528 transitions. [2021-12-27 21:54:55,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 21:54:55,317 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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 42 [2021-12-27 21:54:55,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:55,319 INFO L225 Difference]: With dead ends: 410 [2021-12-27 21:54:55,319 INFO L226 Difference]: Without dead ends: 397 [2021-12-27 21:54:55,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-27 21:54:55,319 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 80 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:55,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 687 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:54:55,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2021-12-27 21:54:55,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 381. [2021-12-27 21:54:55,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 336 states have (on average 1.2738095238095237) internal successors, (428), 341 states have internal predecessors, (428), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (36), 26 states have call predecessors, (36), 26 states have call successors, (36) [2021-12-27 21:54:55,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 495 transitions. [2021-12-27 21:54:55,338 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 495 transitions. Word has length 42 [2021-12-27 21:54:55,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:55,338 INFO L470 AbstractCegarLoop]: Abstraction has 381 states and 495 transitions. [2021-12-27 21:54:55,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-27 21:54:55,338 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 495 transitions. [2021-12-27 21:54:55,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-27 21:54:55,339 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:55,339 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:54:55,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-27 21:54:55,340 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:55,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:55,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1313908054, now seen corresponding path program 1 times [2021-12-27 21:54:55,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:55,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721935115] [2021-12-27 21:54:55,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:55,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:55,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-27 21:54:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:55,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:55,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:55,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721935115] [2021-12-27 21:54:55,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721935115] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:55,394 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:55,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-27 21:54:55,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619725167] [2021-12-27 21:54:55,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:55,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-27 21:54:55,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:55,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-27 21:54:55,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-27 21:54:55,396 INFO L87 Difference]: Start difference. First operand 381 states and 495 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 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) [2021-12-27 21:54:55,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:55,582 INFO L93 Difference]: Finished difference Result 426 states and 550 transitions. [2021-12-27 21:54:55,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-27 21:54:55,583 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 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) Word has length 43 [2021-12-27 21:54:55,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:55,584 INFO L225 Difference]: With dead ends: 426 [2021-12-27 21:54:55,584 INFO L226 Difference]: Without dead ends: 422 [2021-12-27 21:54:55,585 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-27 21:54:55,586 INFO L933 BasicCegarLoop]: 277 mSDtfsCounter, 227 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 1539 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:55,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 1539 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:54:55,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-12-27 21:54:55,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 396. [2021-12-27 21:54:55,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 350 states have (on average 1.262857142857143) internal successors, (442), 355 states have internal predecessors, (442), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (42), 27 states have call predecessors, (42), 26 states have call successors, (42) [2021-12-27 21:54:55,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 515 transitions. [2021-12-27 21:54:55,614 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 515 transitions. Word has length 43 [2021-12-27 21:54:55,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:55,614 INFO L470 AbstractCegarLoop]: Abstraction has 396 states and 515 transitions. [2021-12-27 21:54:55,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 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) [2021-12-27 21:54:55,614 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 515 transitions. [2021-12-27 21:54:55,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-27 21:54:55,615 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:55,616 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:54:55,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-27 21:54:55,616 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:55,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:55,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1314184884, now seen corresponding path program 1 times [2021-12-27 21:54:55,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:55,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462759595] [2021-12-27 21:54:55,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:55,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:55,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:55,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-27 21:54:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:55,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:55,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:55,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462759595] [2021-12-27 21:54:55,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462759595] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:55,677 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:55,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-27 21:54:55,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471460446] [2021-12-27 21:54:55,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:55,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-27 21:54:55,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:55,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-27 21:54:55,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-27 21:54:55,679 INFO L87 Difference]: Start difference. First operand 396 states and 515 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 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) [2021-12-27 21:54:55,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:55,872 INFO L93 Difference]: Finished difference Result 422 states and 543 transitions. [2021-12-27 21:54:55,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-27 21:54:55,873 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 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) Word has length 43 [2021-12-27 21:54:55,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:55,875 INFO L225 Difference]: With dead ends: 422 [2021-12-27 21:54:55,875 INFO L226 Difference]: Without dead ends: 409 [2021-12-27 21:54:55,875 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-27 21:54:55,876 INFO L933 BasicCegarLoop]: 279 mSDtfsCounter, 49 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1649 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:55,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 1649 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:54:55,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2021-12-27 21:54:55,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 393. [2021-12-27 21:54:55,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 347 states have (on average 1.2651296829971181) internal successors, (439), 353 states have internal predecessors, (439), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (41), 26 states have call predecessors, (41), 26 states have call successors, (41) [2021-12-27 21:54:55,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 511 transitions. [2021-12-27 21:54:55,903 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 511 transitions. Word has length 43 [2021-12-27 21:54:55,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:55,903 INFO L470 AbstractCegarLoop]: Abstraction has 393 states and 511 transitions. [2021-12-27 21:54:55,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 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) [2021-12-27 21:54:55,903 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 511 transitions. [2021-12-27 21:54:55,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-27 21:54:55,904 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:55,904 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:54:55,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-27 21:54:55,905 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:55,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:55,905 INFO L85 PathProgramCache]: Analyzing trace with hash 2100455983, now seen corresponding path program 1 times [2021-12-27 21:54:55,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:55,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79232120] [2021-12-27 21:54:55,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:55,906 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:55,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-27 21:54:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:55,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:55,957 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:55,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79232120] [2021-12-27 21:54:55,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79232120] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:55,957 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:55,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-27 21:54:55,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655978647] [2021-12-27 21:54:55,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:55,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-27 21:54:55,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:55,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-27 21:54:55,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-27 21:54:55,959 INFO L87 Difference]: Start difference. First operand 393 states and 511 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-27 21:54:56,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:56,164 INFO L93 Difference]: Finished difference Result 413 states and 531 transitions. [2021-12-27 21:54:56,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-27 21:54:56,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 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 44 [2021-12-27 21:54:56,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:56,169 INFO L225 Difference]: With dead ends: 413 [2021-12-27 21:54:56,169 INFO L226 Difference]: Without dead ends: 397 [2021-12-27 21:54:56,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-12-27 21:54:56,171 INFO L933 BasicCegarLoop]: 283 mSDtfsCounter, 384 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:56,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [391 Valid, 837 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:54:56,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2021-12-27 21:54:56,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 377. [2021-12-27 21:54:56,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 333 states have (on average 1.2702702702702702) internal successors, (423), 338 states have internal predecessors, (423), 30 states have call successors, (30), 14 states have call predecessors, (30), 13 states have return successors, (35), 25 states have call predecessors, (35), 25 states have call successors, (35) [2021-12-27 21:54:56,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 488 transitions. [2021-12-27 21:54:56,192 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 488 transitions. Word has length 44 [2021-12-27 21:54:56,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:56,192 INFO L470 AbstractCegarLoop]: Abstraction has 377 states and 488 transitions. [2021-12-27 21:54:56,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-27 21:54:56,193 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 488 transitions. [2021-12-27 21:54:56,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-27 21:54:56,193 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:56,193 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:54:56,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-27 21:54:56,194 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:56,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:56,194 INFO L85 PathProgramCache]: Analyzing trace with hash -258023597, now seen corresponding path program 1 times [2021-12-27 21:54:56,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:56,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113443733] [2021-12-27 21:54:56,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:56,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:56,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-27 21:54:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:56,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:56,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:56,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113443733] [2021-12-27 21:54:56,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113443733] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:56,246 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:56,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-27 21:54:56,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972171172] [2021-12-27 21:54:56,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:56,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 21:54:56,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:56,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 21:54:56,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-27 21:54:56,247 INFO L87 Difference]: Start difference. First operand 377 states and 488 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-27 21:54:56,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:56,378 INFO L93 Difference]: Finished difference Result 656 states and 846 transitions. [2021-12-27 21:54:56,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 21:54:56,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2021-12-27 21:54:56,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:56,380 INFO L225 Difference]: With dead ends: 656 [2021-12-27 21:54:56,381 INFO L226 Difference]: Without dead ends: 468 [2021-12-27 21:54:56,382 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-27 21:54:56,383 INFO L933 BasicCegarLoop]: 319 mSDtfsCounter, 160 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:56,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 747 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:54:56,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2021-12-27 21:54:56,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 430. [2021-12-27 21:54:56,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 381 states have (on average 1.2703412073490814) internal successors, (484), 385 states have internal predecessors, (484), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (41), 29 states have call predecessors, (41), 28 states have call successors, (41) [2021-12-27 21:54:56,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 557 transitions. [2021-12-27 21:54:56,406 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 557 transitions. Word has length 46 [2021-12-27 21:54:56,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:56,407 INFO L470 AbstractCegarLoop]: Abstraction has 430 states and 557 transitions. [2021-12-27 21:54:56,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-27 21:54:56,407 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 557 transitions. [2021-12-27 21:54:56,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-27 21:54:56,408 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:56,408 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:54:56,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-27 21:54:56,408 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:56,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:56,409 INFO L85 PathProgramCache]: Analyzing trace with hash 796550874, now seen corresponding path program 1 times [2021-12-27 21:54:56,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:56,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987389678] [2021-12-27 21:54:56,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:56,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:56,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:56,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-27 21:54:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:56,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:56,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:56,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987389678] [2021-12-27 21:54:56,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987389678] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:56,478 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:56,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-27 21:54:56,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054858270] [2021-12-27 21:54:56,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:56,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-27 21:54:56,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:56,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-27 21:54:56,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-27 21:54:56,481 INFO L87 Difference]: Start difference. First operand 430 states and 557 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-27 21:54:56,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:56,634 INFO L93 Difference]: Finished difference Result 692 states and 895 transitions. [2021-12-27 21:54:56,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-27 21:54:56,634 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 2 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) Word has length 48 [2021-12-27 21:54:56,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:56,636 INFO L225 Difference]: With dead ends: 692 [2021-12-27 21:54:56,636 INFO L226 Difference]: Without dead ends: 471 [2021-12-27 21:54:56,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-27 21:54:56,637 INFO L933 BasicCegarLoop]: 306 mSDtfsCounter, 52 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1618 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:56,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 1618 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:54:56,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2021-12-27 21:54:56,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 430. [2021-12-27 21:54:56,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 381 states have (on average 1.2650918635170603) internal successors, (482), 385 states have internal predecessors, (482), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (41), 29 states have call predecessors, (41), 28 states have call successors, (41) [2021-12-27 21:54:56,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 555 transitions. [2021-12-27 21:54:56,667 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 555 transitions. Word has length 48 [2021-12-27 21:54:56,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:56,667 INFO L470 AbstractCegarLoop]: Abstraction has 430 states and 555 transitions. [2021-12-27 21:54:56,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-27 21:54:56,668 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 555 transitions. [2021-12-27 21:54:56,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-27 21:54:56,670 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:56,670 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:54:56,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-27 21:54:56,671 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:56,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:56,671 INFO L85 PathProgramCache]: Analyzing trace with hash 364501516, now seen corresponding path program 1 times [2021-12-27 21:54:56,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:56,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141767624] [2021-12-27 21:54:56,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:56,671 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:56,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:56,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-27 21:54:56,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:56,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:56,728 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:56,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141767624] [2021-12-27 21:54:56,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141767624] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:56,729 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:56,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-27 21:54:56,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151833084] [2021-12-27 21:54:56,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:56,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-27 21:54:56,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:56,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-27 21:54:56,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-27 21:54:56,730 INFO L87 Difference]: Start difference. First operand 430 states and 555 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-27 21:54:56,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:56,930 INFO L93 Difference]: Finished difference Result 457 states and 584 transitions. [2021-12-27 21:54:56,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-27 21:54:56,931 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2021-12-27 21:54:56,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:56,933 INFO L225 Difference]: With dead ends: 457 [2021-12-27 21:54:56,933 INFO L226 Difference]: Without dead ends: 438 [2021-12-27 21:54:56,933 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-27 21:54:56,934 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 53 mSDsluCounter, 1572 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1844 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:56,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 1844 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-27 21:54:56,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-12-27 21:54:56,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 426. [2021-12-27 21:54:56,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 378 states have (on average 1.2645502645502646) internal successors, (478), 382 states have internal predecessors, (478), 31 states have call successors, (31), 16 states have call predecessors, (31), 16 states have return successors, (40), 28 states have call predecessors, (40), 27 states have call successors, (40) [2021-12-27 21:54:56,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 549 transitions. [2021-12-27 21:54:56,955 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 549 transitions. Word has length 48 [2021-12-27 21:54:56,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:56,955 INFO L470 AbstractCegarLoop]: Abstraction has 426 states and 549 transitions. [2021-12-27 21:54:56,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-27 21:54:56,956 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 549 transitions. [2021-12-27 21:54:56,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-27 21:54:56,957 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:56,957 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:54:56,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-27 21:54:56,957 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:56,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:56,957 INFO L85 PathProgramCache]: Analyzing trace with hash -271028192, now seen corresponding path program 1 times [2021-12-27 21:54:56,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:56,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648653723] [2021-12-27 21:54:56,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:56,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:56,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-27 21:54:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:57,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:57,002 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:57,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648653723] [2021-12-27 21:54:57,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648653723] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:57,002 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:57,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-27 21:54:57,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309333924] [2021-12-27 21:54:57,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:57,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-27 21:54:57,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:57,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-27 21:54:57,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-27 21:54:57,004 INFO L87 Difference]: Start difference. First operand 426 states and 549 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-27 21:54:57,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:57,203 INFO L93 Difference]: Finished difference Result 453 states and 578 transitions. [2021-12-27 21:54:57,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-27 21:54:57,204 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 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 49 [2021-12-27 21:54:57,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:57,205 INFO L225 Difference]: With dead ends: 453 [2021-12-27 21:54:57,206 INFO L226 Difference]: Without dead ends: 433 [2021-12-27 21:54:57,206 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-27 21:54:57,206 INFO L933 BasicCegarLoop]: 278 mSDtfsCounter, 53 mSDsluCounter, 1592 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1870 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:57,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 1870 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:54:57,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2021-12-27 21:54:57,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 421. [2021-12-27 21:54:57,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 374 states have (on average 1.2647058823529411) internal successors, (473), 378 states have internal predecessors, (473), 30 states have call successors, (30), 16 states have call predecessors, (30), 16 states have return successors, (39), 27 states have call predecessors, (39), 26 states have call successors, (39) [2021-12-27 21:54:57,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 542 transitions. [2021-12-27 21:54:57,227 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 542 transitions. Word has length 49 [2021-12-27 21:54:57,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:57,228 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 542 transitions. [2021-12-27 21:54:57,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-27 21:54:57,228 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 542 transitions. [2021-12-27 21:54:57,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-27 21:54:57,229 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:57,229 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:54:57,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-27 21:54:57,229 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:57,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:57,229 INFO L85 PathProgramCache]: Analyzing trace with hash -990020389, now seen corresponding path program 1 times [2021-12-27 21:54:57,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:57,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435240968] [2021-12-27 21:54:57,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:57,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:57,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-27 21:54:57,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:57,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:57,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:57,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435240968] [2021-12-27 21:54:57,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435240968] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:57,274 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:57,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-27 21:54:57,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867920316] [2021-12-27 21:54:57,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:57,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-27 21:54:57,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:57,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-27 21:54:57,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-27 21:54:57,276 INFO L87 Difference]: Start difference. First operand 421 states and 542 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-27 21:54:57,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:57,478 INFO L93 Difference]: Finished difference Result 448 states and 571 transitions. [2021-12-27 21:54:57,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-27 21:54:57,478 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 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 49 [2021-12-27 21:54:57,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:57,480 INFO L225 Difference]: With dead ends: 448 [2021-12-27 21:54:57,480 INFO L226 Difference]: Without dead ends: 429 [2021-12-27 21:54:57,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-27 21:54:57,481 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 53 mSDsluCounter, 1501 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1760 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:57,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 1760 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-27 21:54:57,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2021-12-27 21:54:57,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 417. [2021-12-27 21:54:57,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 371 states have (on average 1.2641509433962264) internal successors, (469), 375 states have internal predecessors, (469), 29 states have call successors, (29), 16 states have call predecessors, (29), 16 states have return successors, (38), 26 states have call predecessors, (38), 25 states have call successors, (38) [2021-12-27 21:54:57,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 536 transitions. [2021-12-27 21:54:57,503 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 536 transitions. Word has length 49 [2021-12-27 21:54:57,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:57,503 INFO L470 AbstractCegarLoop]: Abstraction has 417 states and 536 transitions. [2021-12-27 21:54:57,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-27 21:54:57,503 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 536 transitions. [2021-12-27 21:54:57,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-27 21:54:57,504 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:57,504 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:54:57,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-27 21:54:57,504 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:57,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:57,505 INFO L85 PathProgramCache]: Analyzing trace with hash -2105334868, now seen corresponding path program 1 times [2021-12-27 21:54:57,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:57,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800273538] [2021-12-27 21:54:57,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:57,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:57,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-27 21:54:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:57,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:57,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:57,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800273538] [2021-12-27 21:54:57,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800273538] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:57,562 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:57,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-27 21:54:57,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875331285] [2021-12-27 21:54:57,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:57,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-27 21:54:57,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:57,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-27 21:54:57,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-27 21:54:57,563 INFO L87 Difference]: Start difference. First operand 417 states and 536 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-27 21:54:57,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:57,750 INFO L93 Difference]: Finished difference Result 771 states and 1003 transitions. [2021-12-27 21:54:57,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-27 21:54:57,750 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 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) Word has length 51 [2021-12-27 21:54:57,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:57,753 INFO L225 Difference]: With dead ends: 771 [2021-12-27 21:54:57,753 INFO L226 Difference]: Without dead ends: 561 [2021-12-27 21:54:57,754 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-27 21:54:57,754 INFO L933 BasicCegarLoop]: 348 mSDtfsCounter, 104 mSDsluCounter, 1452 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1800 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:57,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 1800 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:54:57,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2021-12-27 21:54:57,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 417. [2021-12-27 21:54:57,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 371 states have (on average 1.261455525606469) internal successors, (468), 375 states have internal predecessors, (468), 29 states have call successors, (29), 16 states have call predecessors, (29), 16 states have return successors, (38), 26 states have call predecessors, (38), 25 states have call successors, (38) [2021-12-27 21:54:57,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 535 transitions. [2021-12-27 21:54:57,783 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 535 transitions. Word has length 51 [2021-12-27 21:54:57,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:57,783 INFO L470 AbstractCegarLoop]: Abstraction has 417 states and 535 transitions. [2021-12-27 21:54:57,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-27 21:54:57,784 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 535 transitions. [2021-12-27 21:54:57,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-12-27 21:54:57,785 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:57,785 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:54:57,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-27 21:54:57,786 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:57,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:57,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1346983850, now seen corresponding path program 1 times [2021-12-27 21:54:57,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:57,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443526465] [2021-12-27 21:54:57,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:57,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:57,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-27 21:54:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:57,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:57,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:57,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443526465] [2021-12-27 21:54:57,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443526465] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:57,838 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:57,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-27 21:54:57,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841385714] [2021-12-27 21:54:57,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:57,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-27 21:54:57,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:57,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-27 21:54:57,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-27 21:54:57,852 INFO L87 Difference]: Start difference. First operand 417 states and 535 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-27 21:54:58,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:58,028 INFO L93 Difference]: Finished difference Result 444 states and 564 transitions. [2021-12-27 21:54:58,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-27 21:54:58,029 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2021-12-27 21:54:58,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:58,030 INFO L225 Difference]: With dead ends: 444 [2021-12-27 21:54:58,030 INFO L226 Difference]: Without dead ends: 407 [2021-12-27 21:54:58,031 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-27 21:54:58,031 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 61 mSDsluCounter, 1503 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1764 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:58,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 1764 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:54:58,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2021-12-27 21:54:58,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 395. [2021-12-27 21:54:58,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 352 states have (on average 1.2613636363636365) internal successors, (444), 356 states have internal predecessors, (444), 27 states have call successors, (27), 15 states have call predecessors, (27), 15 states have return successors, (36), 24 states have call predecessors, (36), 23 states have call successors, (36) [2021-12-27 21:54:58,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 507 transitions. [2021-12-27 21:54:58,050 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 507 transitions. Word has length 53 [2021-12-27 21:54:58,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:58,050 INFO L470 AbstractCegarLoop]: Abstraction has 395 states and 507 transitions. [2021-12-27 21:54:58,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-27 21:54:58,051 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 507 transitions. [2021-12-27 21:54:58,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-27 21:54:58,051 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:58,052 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:54:58,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-27 21:54:58,052 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:58,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:58,052 INFO L85 PathProgramCache]: Analyzing trace with hash 561946474, now seen corresponding path program 1 times [2021-12-27 21:54:58,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:58,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033654185] [2021-12-27 21:54:58,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:58,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:58,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:58,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-27 21:54:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:58,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-27 21:54:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:58,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:58,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:58,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033654185] [2021-12-27 21:54:58,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033654185] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:58,111 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:58,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-27 21:54:58,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237152955] [2021-12-27 21:54:58,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:58,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-27 21:54:58,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:58,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-27 21:54:58,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-27 21:54:58,112 INFO L87 Difference]: Start difference. First operand 395 states and 507 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 21:54:58,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:58,273 INFO L93 Difference]: Finished difference Result 613 states and 781 transitions. [2021-12-27 21:54:58,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-27 21:54:58,274 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 59 [2021-12-27 21:54:58,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:58,275 INFO L225 Difference]: With dead ends: 613 [2021-12-27 21:54:58,275 INFO L226 Difference]: Without dead ends: 382 [2021-12-27 21:54:58,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-12-27 21:54:58,277 INFO L933 BasicCegarLoop]: 310 mSDtfsCounter, 132 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:58,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 1169 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:54:58,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2021-12-27 21:54:58,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 362. [2021-12-27 21:54:58,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 324 states have (on average 1.2623456790123457) internal successors, (409), 327 states have internal predecessors, (409), 24 states have call successors, (24), 14 states have call predecessors, (24), 13 states have return successors, (24), 21 states have call predecessors, (24), 21 states have call successors, (24) [2021-12-27 21:54:58,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 457 transitions. [2021-12-27 21:54:58,294 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 457 transitions. Word has length 59 [2021-12-27 21:54:58,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:58,294 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 457 transitions. [2021-12-27 21:54:58,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 21:54:58,294 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 457 transitions. [2021-12-27 21:54:58,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-27 21:54:58,295 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:58,295 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:54:58,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-27 21:54:58,296 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:58,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:58,296 INFO L85 PathProgramCache]: Analyzing trace with hash -597775662, now seen corresponding path program 1 times [2021-12-27 21:54:58,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:58,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706412329] [2021-12-27 21:54:58,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:58,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:58,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-27 21:54:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:58,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-27 21:54:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:58,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:58,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:58,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706412329] [2021-12-27 21:54:58,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706412329] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:58,346 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:58,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-27 21:54:58,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937227299] [2021-12-27 21:54:58,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:58,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-27 21:54:58,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:58,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-27 21:54:58,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-27 21:54:58,347 INFO L87 Difference]: Start difference. First operand 362 states and 457 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 21:54:58,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:58,638 INFO L93 Difference]: Finished difference Result 760 states and 936 transitions. [2021-12-27 21:54:58,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-27 21:54:58,638 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 61 [2021-12-27 21:54:58,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:58,640 INFO L225 Difference]: With dead ends: 760 [2021-12-27 21:54:58,640 INFO L226 Difference]: Without dead ends: 487 [2021-12-27 21:54:58,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2021-12-27 21:54:58,641 INFO L933 BasicCegarLoop]: 291 mSDtfsCounter, 387 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:58,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [393 Valid, 1181 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-27 21:54:58,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2021-12-27 21:54:58,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 456. [2021-12-27 21:54:58,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 408 states have (on average 1.2475490196078431) internal successors, (509), 413 states have internal predecessors, (509), 26 states have call successors, (26), 20 states have call predecessors, (26), 21 states have return successors, (27), 23 states have call predecessors, (27), 23 states have call successors, (27) [2021-12-27 21:54:58,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 562 transitions. [2021-12-27 21:54:58,662 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 562 transitions. Word has length 61 [2021-12-27 21:54:58,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:58,663 INFO L470 AbstractCegarLoop]: Abstraction has 456 states and 562 transitions. [2021-12-27 21:54:58,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 21:54:58,663 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 562 transitions. [2021-12-27 21:54:58,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-27 21:54:58,663 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:58,664 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:54:58,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-12-27 21:54:58,664 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:58,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:58,664 INFO L85 PathProgramCache]: Analyzing trace with hash -2002443203, now seen corresponding path program 1 times [2021-12-27 21:54:58,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:58,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537452545] [2021-12-27 21:54:58,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:58,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:58,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-27 21:54:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:58,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-27 21:54:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:58,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:58,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:58,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537452545] [2021-12-27 21:54:58,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537452545] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:58,799 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:58,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-27 21:54:58,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538925918] [2021-12-27 21:54:58,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:58,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-27 21:54:58,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:58,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-27 21:54:58,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-27 21:54:58,800 INFO L87 Difference]: Start difference. First operand 456 states and 562 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-27 21:54:59,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:59,133 INFO L93 Difference]: Finished difference Result 458 states and 563 transitions. [2021-12-27 21:54:59,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-27 21:54:59,133 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 62 [2021-12-27 21:54:59,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:59,135 INFO L225 Difference]: With dead ends: 458 [2021-12-27 21:54:59,135 INFO L226 Difference]: Without dead ends: 343 [2021-12-27 21:54:59,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-12-27 21:54:59,136 INFO L933 BasicCegarLoop]: 225 mSDtfsCounter, 97 mSDsluCounter, 1381 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1606 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:59,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 1606 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-27 21:54:59,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2021-12-27 21:54:59,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2021-12-27 21:54:59,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 304 states have (on average 1.2532894736842106) internal successors, (381), 308 states have internal predecessors, (381), 21 states have call successors, (21), 16 states have call predecessors, (21), 17 states have return successors, (23), 19 states have call predecessors, (23), 19 states have call successors, (23) [2021-12-27 21:54:59,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 425 transitions. [2021-12-27 21:54:59,156 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 425 transitions. Word has length 62 [2021-12-27 21:54:59,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:59,156 INFO L470 AbstractCegarLoop]: Abstraction has 343 states and 425 transitions. [2021-12-27 21:54:59,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-27 21:54:59,156 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 425 transitions. [2021-12-27 21:54:59,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-27 21:54:59,157 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:59,157 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:54:59,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-12-27 21:54:59,157 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:59,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:59,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1297666020, now seen corresponding path program 1 times [2021-12-27 21:54:59,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:59,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715041712] [2021-12-27 21:54:59,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:59,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:59,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:59,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-27 21:54:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:59,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-27 21:54:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:59,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:59,227 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:59,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715041712] [2021-12-27 21:54:59,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715041712] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:59,227 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:59,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-27 21:54:59,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950787481] [2021-12-27 21:54:59,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:59,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-27 21:54:59,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:59,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-27 21:54:59,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-27 21:54:59,228 INFO L87 Difference]: Start difference. First operand 343 states and 425 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 21:54:59,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:59,442 INFO L93 Difference]: Finished difference Result 378 states and 464 transitions. [2021-12-27 21:54:59,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-27 21:54:59,443 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 7 states have internal predecessors, (58), 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) Word has length 63 [2021-12-27 21:54:59,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:59,444 INFO L225 Difference]: With dead ends: 378 [2021-12-27 21:54:59,444 INFO L226 Difference]: Without dead ends: 359 [2021-12-27 21:54:59,444 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-12-27 21:54:59,445 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 225 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:59,445 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 1112 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-27 21:54:59,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2021-12-27 21:54:59,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 351. [2021-12-27 21:54:59,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 311 states have (on average 1.247588424437299) internal successors, (388), 315 states have internal predecessors, (388), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 19 states have call successors, (25) [2021-12-27 21:54:59,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 434 transitions. [2021-12-27 21:54:59,463 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 434 transitions. Word has length 63 [2021-12-27 21:54:59,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:59,463 INFO L470 AbstractCegarLoop]: Abstraction has 351 states and 434 transitions. [2021-12-27 21:54:59,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 21:54:59,463 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 434 transitions. [2021-12-27 21:54:59,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-27 21:54:59,464 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:59,464 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:54:59,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-12-27 21:54:59,464 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:59,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:59,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1652262591, now seen corresponding path program 1 times [2021-12-27 21:54:59,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:59,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567974203] [2021-12-27 21:54:59,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:59,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:59,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-27 21:54:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:59,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-27 21:54:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:59,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:59,533 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:59,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567974203] [2021-12-27 21:54:59,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567974203] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:59,533 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:59,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-27 21:54:59,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903239332] [2021-12-27 21:54:59,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:59,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-27 21:54:59,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:59,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-27 21:54:59,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-27 21:54:59,535 INFO L87 Difference]: Start difference. First operand 351 states and 434 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 21:54:59,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:59,718 INFO L93 Difference]: Finished difference Result 378 states and 463 transitions. [2021-12-27 21:54:59,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-27 21:54:59,719 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 7 states have internal predecessors, (59), 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) Word has length 64 [2021-12-27 21:54:59,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:59,720 INFO L225 Difference]: With dead ends: 378 [2021-12-27 21:54:59,720 INFO L226 Difference]: Without dead ends: 359 [2021-12-27 21:54:59,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-12-27 21:54:59,721 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 50 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 1389 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:59,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 1389 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:54:59,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2021-12-27 21:54:59,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 343. [2021-12-27 21:54:59,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 304 states have (on average 1.25) internal successors, (380), 308 states have internal predecessors, (380), 21 states have call successors, (21), 16 states have call predecessors, (21), 17 states have return successors, (23), 19 states have call predecessors, (23), 19 states have call successors, (23) [2021-12-27 21:54:59,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 424 transitions. [2021-12-27 21:54:59,738 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 424 transitions. Word has length 64 [2021-12-27 21:54:59,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:59,738 INFO L470 AbstractCegarLoop]: Abstraction has 343 states and 424 transitions. [2021-12-27 21:54:59,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 21:54:59,739 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 424 transitions. [2021-12-27 21:54:59,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-27 21:54:59,739 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:59,739 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:54:59,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-12-27 21:54:59,740 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:59,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:59,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1123895006, now seen corresponding path program 1 times [2021-12-27 21:54:59,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:59,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854870801] [2021-12-27 21:54:59,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:59,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:59,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-27 21:54:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:59,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-27 21:54:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:59,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:59,802 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:59,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854870801] [2021-12-27 21:54:59,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854870801] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:59,802 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:59,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-27 21:54:59,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321035318] [2021-12-27 21:54:59,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:59,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-27 21:54:59,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:59,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-27 21:54:59,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-27 21:54:59,804 INFO L87 Difference]: Start difference. First operand 343 states and 424 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 21:54:59,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:59,964 INFO L93 Difference]: Finished difference Result 501 states and 617 transitions. [2021-12-27 21:54:59,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-27 21:54:59,964 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 68 [2021-12-27 21:54:59,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:59,966 INFO L225 Difference]: With dead ends: 501 [2021-12-27 21:54:59,966 INFO L226 Difference]: Without dead ends: 370 [2021-12-27 21:54:59,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-12-27 21:54:59,967 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 106 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:59,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 1016 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:54:59,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-12-27 21:54:59,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 354. [2021-12-27 21:54:59,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 314 states have (on average 1.2261146496815287) internal successors, (385), 319 states have internal predecessors, (385), 22 states have call successors, (22), 16 states have call predecessors, (22), 17 states have return successors, (23), 19 states have call predecessors, (23), 19 states have call successors, (23) [2021-12-27 21:54:59,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 430 transitions. [2021-12-27 21:54:59,985 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 430 transitions. Word has length 68 [2021-12-27 21:54:59,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:59,986 INFO L470 AbstractCegarLoop]: Abstraction has 354 states and 430 transitions. [2021-12-27 21:54:59,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 21:54:59,986 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 430 transitions. [2021-12-27 21:54:59,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-27 21:54:59,988 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:59,988 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:54:59,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-12-27 21:54:59,988 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:59,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:59,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1269620070, now seen corresponding path program 1 times [2021-12-27 21:54:59,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:59,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812470754] [2021-12-27 21:54:59,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:59,989 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:59,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:00,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-27 21:55:00,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:00,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-27 21:55:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:00,055 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-27 21:55:00,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:00,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812470754] [2021-12-27 21:55:00,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812470754] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:00,056 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:00,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-27 21:55:00,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042566881] [2021-12-27 21:55:00,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:00,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-27 21:55:00,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:00,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-27 21:55:00,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-27 21:55:00,057 INFO L87 Difference]: Start difference. First operand 354 states and 430 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-27 21:55:00,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:00,171 INFO L93 Difference]: Finished difference Result 453 states and 553 transitions. [2021-12-27 21:55:00,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-27 21:55:00,172 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 71 [2021-12-27 21:55:00,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:00,173 INFO L225 Difference]: With dead ends: 453 [2021-12-27 21:55:00,173 INFO L226 Difference]: Without dead ends: 389 [2021-12-27 21:55:00,173 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-27 21:55:00,174 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 77 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:55:00,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 1151 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:55:00,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-12-27 21:55:00,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 262. [2021-12-27 21:55:00,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 231 states have (on average 1.1818181818181819) internal successors, (273), 235 states have internal predecessors, (273), 16 states have call successors, (16), 12 states have call predecessors, (16), 14 states have return successors, (19), 15 states have call predecessors, (19), 15 states have call successors, (19) [2021-12-27 21:55:00,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 308 transitions. [2021-12-27 21:55:00,190 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 308 transitions. Word has length 71 [2021-12-27 21:55:00,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:00,190 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 308 transitions. [2021-12-27 21:55:00,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-27 21:55:00,191 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 308 transitions. [2021-12-27 21:55:00,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-27 21:55:00,191 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:00,191 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:55:00,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-12-27 21:55:00,192 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:00,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:00,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1011268274, now seen corresponding path program 1 times [2021-12-27 21:55:00,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:00,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148288238] [2021-12-27 21:55:00,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:00,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:00,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-27 21:55:00,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:00,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-27 21:55:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:00,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-27 21:55:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:00,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:55:00,244 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:00,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148288238] [2021-12-27 21:55:00,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148288238] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:00,244 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:00,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-27 21:55:00,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042524149] [2021-12-27 21:55:00,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:00,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-27 21:55:00,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:00,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-27 21:55:00,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-27 21:55:00,247 INFO L87 Difference]: Start difference. First operand 262 states and 308 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-27 21:55:00,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:00,386 INFO L93 Difference]: Finished difference Result 293 states and 338 transitions. [2021-12-27 21:55:00,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-27 21:55:00,387 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 74 [2021-12-27 21:55:00,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:00,388 INFO L225 Difference]: With dead ends: 293 [2021-12-27 21:55:00,388 INFO L226 Difference]: Without dead ends: 256 [2021-12-27 21:55:00,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-12-27 21:55:00,388 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 46 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:55:00,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 1046 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:55:00,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-12-27 21:55:00,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 208. [2021-12-27 21:55:00,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 184 states have (on average 1.1630434782608696) internal successors, (214), 187 states have internal predecessors, (214), 12 states have call successors, (12), 10 states have call predecessors, (12), 11 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2021-12-27 21:55:00,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 239 transitions. [2021-12-27 21:55:00,409 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 239 transitions. Word has length 74 [2021-12-27 21:55:00,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:00,409 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 239 transitions. [2021-12-27 21:55:00,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-27 21:55:00,410 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 239 transitions. [2021-12-27 21:55:00,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-27 21:55:00,410 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:00,410 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:55:00,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-12-27 21:55:00,411 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:00,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:00,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1133406279, now seen corresponding path program 1 times [2021-12-27 21:55:00,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:00,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974604402] [2021-12-27 21:55:00,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:00,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:00,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-27 21:55:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:00,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-27 21:55:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:00,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-27 21:55:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:00,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:55:00,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:00,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974604402] [2021-12-27 21:55:00,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974604402] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:00,469 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:00,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-27 21:55:00,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619683719] [2021-12-27 21:55:00,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:00,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-27 21:55:00,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:00,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-27 21:55:00,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-27 21:55:00,471 INFO L87 Difference]: Start difference. First operand 208 states and 239 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-27 21:55:00,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:00,787 INFO L93 Difference]: Finished difference Result 402 states and 463 transitions. [2021-12-27 21:55:00,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-27 21:55:00,787 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 74 [2021-12-27 21:55:00,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:00,788 INFO L225 Difference]: With dead ends: 402 [2021-12-27 21:55:00,788 INFO L226 Difference]: Without dead ends: 359 [2021-12-27 21:55:00,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2021-12-27 21:55:00,789 INFO L933 BasicCegarLoop]: 279 mSDtfsCounter, 370 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-27 21:55:00,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [370 Valid, 1362 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-27 21:55:00,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2021-12-27 21:55:00,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 188. [2021-12-27 21:55:00,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 168 states have (on average 1.1607142857142858) internal successors, (195), 170 states have internal predecessors, (195), 9 states have call successors, (9), 9 states have call predecessors, (9), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2021-12-27 21:55:00,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 214 transitions. [2021-12-27 21:55:00,814 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 214 transitions. Word has length 74 [2021-12-27 21:55:00,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:00,814 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 214 transitions. [2021-12-27 21:55:00,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-27 21:55:00,815 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 214 transitions. [2021-12-27 21:55:00,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-12-27 21:55:00,816 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:00,816 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:55:00,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-12-27 21:55:00,816 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:00,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:00,817 INFO L85 PathProgramCache]: Analyzing trace with hash -2004746452, now seen corresponding path program 1 times [2021-12-27 21:55:00,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:00,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420774896] [2021-12-27 21:55:00,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:00,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:00,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:00,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-27 21:55:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:00,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-27 21:55:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:00,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:55:00,874 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:00,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420774896] [2021-12-27 21:55:00,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420774896] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:00,874 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:00,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-27 21:55:00,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170510073] [2021-12-27 21:55:00,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:00,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-27 21:55:00,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:00,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-27 21:55:00,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-27 21:55:00,876 INFO L87 Difference]: Start difference. First operand 188 states and 214 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 21:55:00,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:00,954 INFO L93 Difference]: Finished difference Result 253 states and 291 transitions. [2021-12-27 21:55:00,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-27 21:55:00,954 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 80 [2021-12-27 21:55:00,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:00,955 INFO L225 Difference]: With dead ends: 253 [2021-12-27 21:55:00,955 INFO L226 Difference]: Without dead ends: 194 [2021-12-27 21:55:00,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-27 21:55:00,956 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 45 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:55:00,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 473 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:55:00,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-12-27 21:55:00,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 188. [2021-12-27 21:55:00,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 168 states have (on average 1.1547619047619047) internal successors, (194), 170 states have internal predecessors, (194), 9 states have call successors, (9), 9 states have call predecessors, (9), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2021-12-27 21:55:00,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 213 transitions. [2021-12-27 21:55:00,968 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 213 transitions. Word has length 80 [2021-12-27 21:55:00,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:00,969 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 213 transitions. [2021-12-27 21:55:00,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-27 21:55:00,969 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 213 transitions. [2021-12-27 21:55:00,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-27 21:55:00,970 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:00,970 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:55:00,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-12-27 21:55:00,970 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:00,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:00,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1995188002, now seen corresponding path program 1 times [2021-12-27 21:55:00,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:00,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115924274] [2021-12-27 21:55:00,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:00,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:00,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:01,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-27 21:55:01,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:01,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-27 21:55:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:01,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-27 21:55:01,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:01,022 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-27 21:55:01,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:01,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115924274] [2021-12-27 21:55:01,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115924274] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:01,023 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:01,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-27 21:55:01,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411371827] [2021-12-27 21:55:01,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:01,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-27 21:55:01,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:01,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-27 21:55:01,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-27 21:55:01,024 INFO L87 Difference]: Start difference. First operand 188 states and 213 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-27 21:55:01,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:01,099 INFO L93 Difference]: Finished difference Result 244 states and 274 transitions. [2021-12-27 21:55:01,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-27 21:55:01,100 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 100 [2021-12-27 21:55:01,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:01,101 INFO L225 Difference]: With dead ends: 244 [2021-12-27 21:55:01,101 INFO L226 Difference]: Without dead ends: 218 [2021-12-27 21:55:01,101 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-27 21:55:01,101 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 67 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:55:01,102 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 538 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:55:01,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-12-27 21:55:01,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 190. [2021-12-27 21:55:01,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 170 states have (on average 1.1529411764705881) internal successors, (196), 172 states have internal predecessors, (196), 9 states have call successors, (9), 9 states have call predecessors, (9), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2021-12-27 21:55:01,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 215 transitions. [2021-12-27 21:55:01,114 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 215 transitions. Word has length 100 [2021-12-27 21:55:01,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:01,115 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 215 transitions. [2021-12-27 21:55:01,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-27 21:55:01,115 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 215 transitions. [2021-12-27 21:55:01,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-27 21:55:01,116 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:01,116 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:55:01,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-12-27 21:55:01,116 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:01,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:01,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1423048990, now seen corresponding path program 1 times [2021-12-27 21:55:01,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:01,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259562579] [2021-12-27 21:55:01,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:01,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:01,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-27 21:55:01,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:01,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-27 21:55:01,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:01,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-27 21:55:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:01,186 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-27 21:55:01,186 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:01,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259562579] [2021-12-27 21:55:01,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259562579] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:01,186 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:01,186 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-27 21:55:01,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16008240] [2021-12-27 21:55:01,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:01,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-27 21:55:01,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:01,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-27 21:55:01,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-27 21:55:01,190 INFO L87 Difference]: Start difference. First operand 190 states and 215 transitions. Second operand has 10 states, 10 states have (on average 7.8) internal successors, (78), 8 states have internal predecessors, (78), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-27 21:55:01,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:01,349 INFO L93 Difference]: Finished difference Result 230 states and 261 transitions. [2021-12-27 21:55:01,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-27 21:55:01,350 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 8 states have internal predecessors, (78), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 100 [2021-12-27 21:55:01,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:01,351 INFO L225 Difference]: With dead ends: 230 [2021-12-27 21:55:01,351 INFO L226 Difference]: Without dead ends: 194 [2021-12-27 21:55:01,351 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2021-12-27 21:55:01,351 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 300 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:55:01,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [300 Valid, 762 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:55:01,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-12-27 21:55:01,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 188. [2021-12-27 21:55:01,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 168 states have (on average 1.1428571428571428) internal successors, (192), 170 states have internal predecessors, (192), 9 states have call successors, (9), 9 states have call predecessors, (9), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2021-12-27 21:55:01,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 211 transitions. [2021-12-27 21:55:01,365 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 211 transitions. Word has length 100 [2021-12-27 21:55:01,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:01,366 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 211 transitions. [2021-12-27 21:55:01,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 8 states have internal predecessors, (78), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-27 21:55:01,366 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 211 transitions. [2021-12-27 21:55:01,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-12-27 21:55:01,367 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:01,367 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:55:01,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-12-27 21:55:01,367 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:01,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:01,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1958156221, now seen corresponding path program 1 times [2021-12-27 21:55:01,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:01,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022699954] [2021-12-27 21:55:01,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:01,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:01,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:01,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-27 21:55:01,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:01,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-27 21:55:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:01,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-27 21:55:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:01,486 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-27 21:55:01,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:01,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022699954] [2021-12-27 21:55:01,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022699954] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:01,487 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:01,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-27 21:55:01,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196387293] [2021-12-27 21:55:01,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:01,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-27 21:55:01,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:01,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-27 21:55:01,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2021-12-27 21:55:01,488 INFO L87 Difference]: Start difference. First operand 188 states and 211 transitions. Second operand has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 11 states have internal predecessors, (85), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-27 21:55:01,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:01,807 INFO L93 Difference]: Finished difference Result 296 states and 340 transitions. [2021-12-27 21:55:01,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-27 21:55:01,807 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 11 states have internal predecessors, (85), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 101 [2021-12-27 21:55:01,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:01,809 INFO L225 Difference]: With dead ends: 296 [2021-12-27 21:55:01,809 INFO L226 Difference]: Without dead ends: 262 [2021-12-27 21:55:01,809 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2021-12-27 21:55:01,810 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 464 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-27 21:55:01,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [464 Valid, 1321 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-27 21:55:01,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-12-27 21:55:01,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 203. [2021-12-27 21:55:01,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 182 states have (on average 1.1483516483516483) internal successors, (209), 184 states have internal predecessors, (209), 9 states have call successors, (9), 9 states have call predecessors, (9), 11 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2021-12-27 21:55:01,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 229 transitions. [2021-12-27 21:55:01,824 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 229 transitions. Word has length 101 [2021-12-27 21:55:01,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:01,825 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 229 transitions. [2021-12-27 21:55:01,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 11 states have internal predecessors, (85), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-27 21:55:01,825 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 229 transitions. [2021-12-27 21:55:01,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-12-27 21:55:01,826 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:01,826 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:55:01,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-12-27 21:55:01,826 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:01,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:01,826 INFO L85 PathProgramCache]: Analyzing trace with hash -795331448, now seen corresponding path program 1 times [2021-12-27 21:55:01,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:01,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143945565] [2021-12-27 21:55:01,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:01,827 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:01,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:01,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-27 21:55:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:01,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-27 21:55:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:01,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-27 21:55:01,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:01,962 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-27 21:55:01,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:01,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143945565] [2021-12-27 21:55:01,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143945565] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:01,962 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:01,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-27 21:55:01,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856541488] [2021-12-27 21:55:01,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:01,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-27 21:55:01,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:01,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-27 21:55:01,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2021-12-27 21:55:01,963 INFO L87 Difference]: Start difference. First operand 203 states and 229 transitions. Second operand has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 11 states have internal predecessors, (87), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-27 21:55:02,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:02,136 INFO L93 Difference]: Finished difference Result 277 states and 315 transitions. [2021-12-27 21:55:02,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-27 21:55:02,136 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 11 states have internal predecessors, (87), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 102 [2021-12-27 21:55:02,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:02,137 INFO L225 Difference]: With dead ends: 277 [2021-12-27 21:55:02,137 INFO L226 Difference]: Without dead ends: 217 [2021-12-27 21:55:02,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2021-12-27 21:55:02,138 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 30 mSDsluCounter, 1422 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1570 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:55:02,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 1570 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:55:02,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-12-27 21:55:02,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 203. [2021-12-27 21:55:02,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 182 states have (on average 1.1428571428571428) internal successors, (208), 184 states have internal predecessors, (208), 9 states have call successors, (9), 9 states have call predecessors, (9), 11 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2021-12-27 21:55:02,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 228 transitions. [2021-12-27 21:55:02,155 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 228 transitions. Word has length 102 [2021-12-27 21:55:02,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:02,156 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 228 transitions. [2021-12-27 21:55:02,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 11 states have internal predecessors, (87), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-27 21:55:02,156 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 228 transitions. [2021-12-27 21:55:02,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-12-27 21:55:02,157 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:02,157 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:55:02,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-12-27 21:55:02,157 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:02,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:02,157 INFO L85 PathProgramCache]: Analyzing trace with hash -994336985, now seen corresponding path program 1 times [2021-12-27 21:55:02,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:02,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842900651] [2021-12-27 21:55:02,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:02,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:02,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-27 21:55:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:02,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-27 21:55:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:02,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-27 21:55:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:02,205 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-27 21:55:02,205 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:02,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842900651] [2021-12-27 21:55:02,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842900651] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:02,205 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:02,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-27 21:55:02,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727809092] [2021-12-27 21:55:02,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:02,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-27 21:55:02,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:02,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-27 21:55:02,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-27 21:55:02,206 INFO L87 Difference]: Start difference. First operand 203 states and 228 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-27 21:55:02,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:02,283 INFO L93 Difference]: Finished difference Result 255 states and 285 transitions. [2021-12-27 21:55:02,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-27 21:55:02,283 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 105 [2021-12-27 21:55:02,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:02,284 INFO L225 Difference]: With dead ends: 255 [2021-12-27 21:55:02,284 INFO L226 Difference]: Without dead ends: 195 [2021-12-27 21:55:02,284 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-27 21:55:02,285 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 122 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:55:02,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 357 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:55:02,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-12-27 21:55:02,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 181. [2021-12-27 21:55:02,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 161 states have (on average 1.124223602484472) internal successors, (181), 163 states have internal predecessors, (181), 9 states have call successors, (9), 9 states have call predecessors, (9), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2021-12-27 21:55:02,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 200 transitions. [2021-12-27 21:55:02,296 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 200 transitions. Word has length 105 [2021-12-27 21:55:02,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:02,297 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 200 transitions. [2021-12-27 21:55:02,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-27 21:55:02,297 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 200 transitions. [2021-12-27 21:55:02,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-12-27 21:55:02,297 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:02,298 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:55:02,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-12-27 21:55:02,298 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:02,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:02,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1779359193, now seen corresponding path program 1 times [2021-12-27 21:55:02,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:02,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057372296] [2021-12-27 21:55:02,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:02,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:02,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-27 21:55:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:02,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-27 21:55:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:02,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-27 21:55:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:02,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-27 21:55:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:02,377 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-27 21:55:02,377 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:02,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057372296] [2021-12-27 21:55:02,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057372296] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:02,377 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:02,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-27 21:55:02,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741276417] [2021-12-27 21:55:02,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:02,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-27 21:55:02,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:02,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-27 21:55:02,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-27 21:55:02,379 INFO L87 Difference]: Start difference. First operand 181 states and 200 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-27 21:55:02,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:02,500 INFO L93 Difference]: Finished difference Result 235 states and 260 transitions. [2021-12-27 21:55:02,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-27 21:55:02,500 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 111 [2021-12-27 21:55:02,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:02,501 INFO L225 Difference]: With dead ends: 235 [2021-12-27 21:55:02,501 INFO L226 Difference]: Without dead ends: 160 [2021-12-27 21:55:02,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-12-27 21:55:02,502 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 46 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:55:02,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 769 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:55:02,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-12-27 21:55:02,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2021-12-27 21:55:02,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 143 states have (on average 1.1118881118881119) internal successors, (159), 144 states have internal predecessors, (159), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2021-12-27 21:55:02,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 175 transitions. [2021-12-27 21:55:02,513 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 175 transitions. Word has length 111 [2021-12-27 21:55:02,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:02,514 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 175 transitions. [2021-12-27 21:55:02,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-27 21:55:02,514 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 175 transitions. [2021-12-27 21:55:02,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-12-27 21:55:02,514 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:02,515 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:55:02,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-12-27 21:55:02,515 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:02,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:02,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1895619621, now seen corresponding path program 1 times [2021-12-27 21:55:02,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:02,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854976969] [2021-12-27 21:55:02,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:02,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:02,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-27 21:55:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:02,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-27 21:55:02,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:02,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-27 21:55:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:02,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-27 21:55:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:02,590 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-27 21:55:02,590 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:02,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854976969] [2021-12-27 21:55:02,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854976969] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:02,591 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:02,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-27 21:55:02,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601509933] [2021-12-27 21:55:02,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:02,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-27 21:55:02,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:02,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-27 21:55:02,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-27 21:55:02,592 INFO L87 Difference]: Start difference. First operand 160 states and 175 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 6 states have internal predecessors, (91), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-27 21:55:02,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:02,763 INFO L93 Difference]: Finished difference Result 328 states and 360 transitions. [2021-12-27 21:55:02,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-27 21:55:02,764 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 6 states have internal predecessors, (91), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 112 [2021-12-27 21:55:02,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:02,766 INFO L225 Difference]: With dead ends: 328 [2021-12-27 21:55:02,766 INFO L226 Difference]: Without dead ends: 160 [2021-12-27 21:55:02,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2021-12-27 21:55:02,767 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 136 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:55:02,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 744 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:55:02,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-12-27 21:55:02,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2021-12-27 21:55:02,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 143 states have (on average 1.1048951048951048) internal successors, (158), 144 states have internal predecessors, (158), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2021-12-27 21:55:02,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 174 transitions. [2021-12-27 21:55:02,778 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 174 transitions. Word has length 112 [2021-12-27 21:55:02,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:02,778 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 174 transitions. [2021-12-27 21:55:02,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 6 states have internal predecessors, (91), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-27 21:55:02,778 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 174 transitions. [2021-12-27 21:55:02,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-12-27 21:55:02,779 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:02,779 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:55:02,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-12-27 21:55:02,779 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:02,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:02,780 INFO L85 PathProgramCache]: Analyzing trace with hash -77545757, now seen corresponding path program 1 times [2021-12-27 21:55:02,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:02,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337966457] [2021-12-27 21:55:02,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:02,780 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:02,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-27 21:55:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:02,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-27 21:55:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:02,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-27 21:55:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:02,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-27 21:55:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:02,871 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-27 21:55:02,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:02,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337966457] [2021-12-27 21:55:02,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337966457] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:02,871 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:02,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-27 21:55:02,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850012287] [2021-12-27 21:55:02,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:02,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-27 21:55:02,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:02,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-27 21:55:02,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-12-27 21:55:02,872 INFO L87 Difference]: Start difference. First operand 160 states and 174 transitions. Second operand has 13 states, 13 states have (on average 7.0) internal successors, (91), 10 states have internal predecessors, (91), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-27 21:55:03,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:03,147 INFO L93 Difference]: Finished difference Result 173 states and 190 transitions. [2021-12-27 21:55:03,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-27 21:55:03,148 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.0) internal successors, (91), 10 states have internal predecessors, (91), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 112 [2021-12-27 21:55:03,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:03,148 INFO L225 Difference]: With dead ends: 173 [2021-12-27 21:55:03,148 INFO L226 Difference]: Without dead ends: 0 [2021-12-27 21:55:03,149 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2021-12-27 21:55:03,149 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 382 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-27 21:55:03,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [382 Valid, 739 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-27 21:55:03,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-27 21:55:03,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-27 21:55:03,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-27 21:55:03,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-27 21:55:03,150 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 112 [2021-12-27 21:55:03,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:03,151 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-27 21:55:03,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.0) internal successors, (91), 10 states have internal predecessors, (91), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-27 21:55:03,151 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-27 21:55:03,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-27 21:55:03,153 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-27 21:55:03,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-12-27 21:55:03,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.