./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ntdrivers/cdaudio.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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/cdaudio.i.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 158aa30053f80b6c80bcbeac6f52ce0f8b5c03af85b763fe7e9897c790504a73 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:32:42,497 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:32:42,504 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:32:42,543 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:32:42,543 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:32:42,544 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:32:42,545 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:32:42,546 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:32:42,547 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:32:42,548 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:32:42,548 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:32:42,549 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:32:42,550 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:32:42,550 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:32:42,551 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:32:42,555 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:32:42,556 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:32:42,559 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:32:42,560 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:32:42,562 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:32:42,567 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:32:42,569 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:32:42,570 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:32:42,571 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:32:42,571 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:32:42,573 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:32:42,574 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:32:42,574 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:32:42,574 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:32:42,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:32:42,577 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:32:42,577 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:32:42,577 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:32:42,583 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:32:42,584 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:32:42,584 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:32:42,585 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:32:42,585 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:32:42,585 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:32:42,585 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:32:42,586 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:32:42,587 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:32:42,587 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 11:32:42,608 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:32:42,609 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:32:42,619 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:32:42,619 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:32:42,620 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:32:42,620 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:32:42,621 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:32:42,621 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:32:42,622 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:32:42,622 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:32:42,622 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:32:42,623 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 11:32:42,623 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:32:42,623 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:32:42,623 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:32:42,623 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:32:42,623 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:32:42,624 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:32:42,624 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:32:42,624 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:32:42,625 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:32:42,625 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:32:42,625 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:32:42,625 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:32:42,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:32:42,626 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:32:42,626 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:32:42,626 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:32:42,626 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 11:32:42,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 11:32:42,627 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:32:42,627 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:32:42,627 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:32:42,627 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 -> 158aa30053f80b6c80bcbeac6f52ce0f8b5c03af85b763fe7e9897c790504a73 [2022-07-13 11:32:42,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:32:42,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:32:42,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:32:42,819 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:32:42,819 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:32:42,820 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers/cdaudio.i.cil-2.c [2022-07-13 11:32:42,862 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2ed987fa/6ebed1ac5b6b4c649ff22015ee29dcef/FLAG5a9b2550e [2022-07-13 11:32:43,461 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:32:43,462 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers/cdaudio.i.cil-2.c [2022-07-13 11:32:43,492 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2ed987fa/6ebed1ac5b6b4c649ff22015ee29dcef/FLAG5a9b2550e [2022-07-13 11:32:43,871 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2ed987fa/6ebed1ac5b6b4c649ff22015ee29dcef [2022-07-13 11:32:43,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:32:43,874 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:32:43,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:32:43,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:32:43,877 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:32:43,877 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:32:43" (1/1) ... [2022-07-13 11:32:43,878 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62d4a362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:32:43, skipping insertion in model container [2022-07-13 11:32:43,878 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:32:43" (1/1) ... [2022-07-13 11:32:43,885 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:32:43,976 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:32:44,385 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/cdaudio.i.cil-2.c[90200,90213] [2022-07-13 11:32:44,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:32:44,869 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:32:44,928 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/cdaudio.i.cil-2.c[90200,90213] [2022-07-13 11:32:45,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:32:45,196 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:32:45,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:32:45 WrapperNode [2022-07-13 11:32:45,197 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:32:45,198 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:32:45,198 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:32:45,198 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:32:45,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:32:45" (1/1) ... [2022-07-13 11:32:45,275 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:32:45" (1/1) ... [2022-07-13 11:32:45,345 INFO L137 Inliner]: procedures = 121, calls = 2189, calls flagged for inlining = 23, calls inlined = 19, statements flattened = 2294 [2022-07-13 11:32:45,347 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:32:45,348 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:32:45,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:32:45,348 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:32:45,355 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:32:45" (1/1) ... [2022-07-13 11:32:45,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:32:45" (1/1) ... [2022-07-13 11:32:45,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:32:45" (1/1) ... [2022-07-13 11:32:45,378 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:32:45" (1/1) ... [2022-07-13 11:32:45,438 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:32:45" (1/1) ... [2022-07-13 11:32:45,447 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:32:45" (1/1) ... [2022-07-13 11:32:45,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:32:45" (1/1) ... [2022-07-13 11:32:45,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:32:45,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:32:45,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:32:45,486 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:32:45,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:32:45" (1/1) ... [2022-07-13 11:32:45,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:32:45,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:32:45,524 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 11:32:45,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 11:32:45,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-13 11:32:45,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-13 11:32:45,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-13 11:32:45,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 11:32:45,553 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-07-13 11:32:45,553 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-07-13 11:32:45,553 INFO L130 BoogieDeclarations]: Found specification of procedure MmLockPagableDataSection [2022-07-13 11:32:45,553 INFO L138 BoogieDeclarations]: Found implementation of procedure MmLockPagableDataSection [2022-07-13 11:32:45,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 11:32:45,554 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2022-07-13 11:32:45,554 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2022-07-13 11:32:45,554 INFO L130 BoogieDeclarations]: Found specification of procedure IoOpenDeviceRegistryKey [2022-07-13 11:32:45,554 INFO L138 BoogieDeclarations]: Found implementation of procedure IoOpenDeviceRegistryKey [2022-07-13 11:32:45,554 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-07-13 11:32:45,554 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-07-13 11:32:45,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-13 11:32:45,554 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-13 11:32:45,554 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_malloc [2022-07-13 11:32:45,555 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_malloc [2022-07-13 11:32:45,555 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-07-13 11:32:45,555 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-07-13 11:32:45,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 11:32:45,555 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2022-07-13 11:32:45,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2022-07-13 11:32:45,584 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2022-07-13 11:32:45,584 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2022-07-13 11:32:45,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:32:45,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 11:32:45,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 11:32:45,584 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-07-13 11:32:45,584 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-07-13 11:32:45,585 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-13 11:32:45,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 11:32:45,585 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-07-13 11:32:45,585 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-07-13 11:32:45,585 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2022-07-13 11:32:45,585 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2022-07-13 11:32:45,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 11:32:45,585 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-07-13 11:32:45,585 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-07-13 11:32:45,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2022-07-13 11:32:45,585 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2022-07-13 11:32:45,585 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2022-07-13 11:32:45,585 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2022-07-13 11:32:45,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 11:32:45,585 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2022-07-13 11:32:45,585 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2022-07-13 11:32:45,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-13 11:32:45,585 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2022-07-13 11:32:45,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2022-07-13 11:32:45,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:32:45,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:32:45,586 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2022-07-13 11:32:45,586 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2022-07-13 11:32:45,959 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:32:45,961 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:32:46,165 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:32:46,187 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-07-13 11:32:46,187 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-07-13 11:32:46,515 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:32:46,540 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-07-13 11:32:46,541 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-07-13 11:32:46,554 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:32:46,555 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:32:46,556 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:32:46,563 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:32:46,569 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:32:46,574 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:32:55,294 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##258: assume false; [2022-07-13 11:32:55,295 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##259: assume !false; [2022-07-13 11:32:55,295 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##485: assume false; [2022-07-13 11:32:55,295 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##486: assume !false; [2022-07-13 11:32:55,295 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L3709: CdAudioPnp_#res#1 := 0; [2022-07-13 11:32:55,295 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume !false; [2022-07-13 11:32:55,295 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume false; [2022-07-13 11:32:55,295 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume !false; [2022-07-13 11:32:55,295 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume false; [2022-07-13 11:32:55,295 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-07-13 11:32:55,295 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##154: assume !false; [2022-07-13 11:32:55,295 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##153: assume false; [2022-07-13 11:32:55,295 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-07-13 11:32:55,330 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:32:55,333 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-07-13 11:32:55,333 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-07-13 11:32:55,350 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:32:55,362 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:32:55,363 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-13 11:32:55,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:32:55 BoogieIcfgContainer [2022-07-13 11:32:55,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:32:55,368 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:32:55,368 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:32:55,370 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:32:55,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:32:43" (1/3) ... [2022-07-13 11:32:55,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed3ff24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:32:55, skipping insertion in model container [2022-07-13 11:32:55,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:32:45" (2/3) ... [2022-07-13 11:32:55,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed3ff24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:32:55, skipping insertion in model container [2022-07-13 11:32:55,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:32:55" (3/3) ... [2022-07-13 11:32:55,373 INFO L111 eAbstractionObserver]: Analyzing ICFG cdaudio.i.cil-2.c [2022-07-13 11:32:55,385 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:32:55,385 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:32:55,447 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:32:55,454 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@69beea1e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@662eb2df [2022-07-13 11:32:55,454 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:32:55,461 INFO L276 IsEmpty]: Start isEmpty. Operand has 617 states, 483 states have (on average 1.525879917184265) internal successors, (737), 502 states have internal predecessors, (737), 113 states have call successors, (113), 19 states have call predecessors, (113), 19 states have return successors, (113), 108 states have call predecessors, (113), 113 states have call successors, (113) [2022-07-13 11:32:55,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 11:32:55,468 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:55,468 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:55,469 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:55,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:55,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1346091919, now seen corresponding path program 1 times [2022-07-13 11:32:55,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:55,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856443291] [2022-07-13 11:32:55,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:55,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:55,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:55,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:32:55,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:55,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856443291] [2022-07-13 11:32:55,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856443291] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:55,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:55,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:55,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785632929] [2022-07-13 11:32:55,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:55,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:55,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:55,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:55,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:55,813 INFO L87 Difference]: Start difference. First operand has 617 states, 483 states have (on average 1.525879917184265) internal successors, (737), 502 states have internal predecessors, (737), 113 states have call successors, (113), 19 states have call predecessors, (113), 19 states have return successors, (113), 108 states have call predecessors, (113), 113 states have call successors, (113) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:56,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:56,010 INFO L93 Difference]: Finished difference Result 1094 states and 1737 transitions. [2022-07-13 11:32:56,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:56,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-13 11:32:56,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:56,029 INFO L225 Difference]: With dead ends: 1094 [2022-07-13 11:32:56,029 INFO L226 Difference]: Without dead ends: 610 [2022-07-13 11:32:56,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:56,040 INFO L413 NwaCegarLoop]: 928 mSDtfsCounter, 8 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1807 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:56,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1807 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:32:56,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-07-13 11:32:56,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2022-07-13 11:32:56,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 478 states have (on average 1.4832635983263598) internal successors, (709), 495 states have internal predecessors, (709), 113 states have call successors, (113), 19 states have call predecessors, (113), 18 states have return successors, (97), 97 states have call predecessors, (97), 97 states have call successors, (97) [2022-07-13 11:32:56,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 919 transitions. [2022-07-13 11:32:56,120 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 919 transitions. Word has length 13 [2022-07-13 11:32:56,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:56,126 INFO L495 AbstractCegarLoop]: Abstraction has 610 states and 919 transitions. [2022-07-13 11:32:56,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:56,126 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 919 transitions. [2022-07-13 11:32:56,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 11:32:56,127 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:56,127 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:56,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 11:32:56,128 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:56,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:56,128 INFO L85 PathProgramCache]: Analyzing trace with hash 503268838, now seen corresponding path program 1 times [2022-07-13 11:32:56,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:56,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985867766] [2022-07-13 11:32:56,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:56,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:56,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:32:56,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:56,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985867766] [2022-07-13 11:32:56,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985867766] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:56,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:56,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:56,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659585269] [2022-07-13 11:32:56,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:56,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:56,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:56,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:56,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:56,236 INFO L87 Difference]: Start difference. First operand 610 states and 919 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:56,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:56,381 INFO L93 Difference]: Finished difference Result 1141 states and 1702 transitions. [2022-07-13 11:32:56,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:56,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 15 [2022-07-13 11:32:56,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:56,387 INFO L225 Difference]: With dead ends: 1141 [2022-07-13 11:32:56,388 INFO L226 Difference]: Without dead ends: 891 [2022-07-13 11:32:56,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:56,390 INFO L413 NwaCegarLoop]: 1239 mSDtfsCounter, 833 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 1664 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:56,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 1664 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:32:56,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2022-07-13 11:32:56,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 871. [2022-07-13 11:32:56,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 696 states have (on average 1.4612068965517242) internal successors, (1017), 699 states have internal predecessors, (1017), 142 states have call successors, (142), 33 states have call predecessors, (142), 32 states have return successors, (146), 140 states have call predecessors, (146), 130 states have call successors, (146) [2022-07-13 11:32:56,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1305 transitions. [2022-07-13 11:32:56,433 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1305 transitions. Word has length 15 [2022-07-13 11:32:56,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:56,433 INFO L495 AbstractCegarLoop]: Abstraction has 871 states and 1305 transitions. [2022-07-13 11:32:56,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:56,434 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1305 transitions. [2022-07-13 11:32:56,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 11:32:56,437 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:56,437 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:56,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 11:32:56,438 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:56,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:56,444 INFO L85 PathProgramCache]: Analyzing trace with hash -485834161, now seen corresponding path program 1 times [2022-07-13 11:32:56,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:56,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100514313] [2022-07-13 11:32:56,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:56,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:56,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:32:56,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:56,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100514313] [2022-07-13 11:32:56,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100514313] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:56,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:56,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:56,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064098108] [2022-07-13 11:32:56,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:56,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:56,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:56,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:56,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:56,514 INFO L87 Difference]: Start difference. First operand 871 states and 1305 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:56,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:56,634 INFO L93 Difference]: Finished difference Result 1865 states and 2854 transitions. [2022-07-13 11:32:56,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:56,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 22 [2022-07-13 11:32:56,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:56,644 INFO L225 Difference]: With dead ends: 1865 [2022-07-13 11:32:56,644 INFO L226 Difference]: Without dead ends: 1453 [2022-07-13 11:32:56,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:56,650 INFO L413 NwaCegarLoop]: 1451 mSDtfsCounter, 586 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 2316 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:56,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 2316 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:32:56,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2022-07-13 11:32:56,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1050. [2022-07-13 11:32:56,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 833 states have (on average 1.446578631452581) internal successors, (1205), 835 states have internal predecessors, (1205), 170 states have call successors, (170), 46 states have call predecessors, (170), 46 states have return successors, (217), 170 states have call predecessors, (217), 158 states have call successors, (217) [2022-07-13 11:32:56,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1592 transitions. [2022-07-13 11:32:56,697 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1592 transitions. Word has length 22 [2022-07-13 11:32:56,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:56,698 INFO L495 AbstractCegarLoop]: Abstraction has 1050 states and 1592 transitions. [2022-07-13 11:32:56,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:56,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1592 transitions. [2022-07-13 11:32:56,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 11:32:56,701 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:56,701 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:56,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 11:32:56,701 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:56,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:56,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1681895330, now seen corresponding path program 1 times [2022-07-13 11:32:56,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:56,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409892231] [2022-07-13 11:32:56,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:56,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:56,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:32:56,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:56,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409892231] [2022-07-13 11:32:56,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409892231] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:56,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:56,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:56,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529255274] [2022-07-13 11:32:56,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:56,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:56,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:56,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:56,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:56,790 INFO L87 Difference]: Start difference. First operand 1050 states and 1592 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:56,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:56,853 INFO L93 Difference]: Finished difference Result 1728 states and 2570 transitions. [2022-07-13 11:32:56,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:56,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 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 22 [2022-07-13 11:32:56,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:56,860 INFO L225 Difference]: With dead ends: 1728 [2022-07-13 11:32:56,860 INFO L226 Difference]: Without dead ends: 1595 [2022-07-13 11:32:56,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:56,867 INFO L413 NwaCegarLoop]: 1131 mSDtfsCounter, 836 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:56,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 1540 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:32:56,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2022-07-13 11:32:56,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1533. [2022-07-13 11:32:56,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1533 states, 1229 states have (on average 1.4475183075671278) internal successors, (1779), 1227 states have internal predecessors, (1779), 227 states have call successors, (227), 72 states have call predecessors, (227), 76 states have return successors, (298), 233 states have call predecessors, (298), 218 states have call successors, (298) [2022-07-13 11:32:56,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 2304 transitions. [2022-07-13 11:32:56,910 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 2304 transitions. Word has length 22 [2022-07-13 11:32:56,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:56,911 INFO L495 AbstractCegarLoop]: Abstraction has 1533 states and 2304 transitions. [2022-07-13 11:32:56,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:56,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 2304 transitions. [2022-07-13 11:32:56,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-13 11:32:56,912 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:56,912 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:56,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 11:32:56,912 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:56,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:56,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1879986928, now seen corresponding path program 1 times [2022-07-13 11:32:56,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:56,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325334794] [2022-07-13 11:32:56,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:56,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:56,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:32:56,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:56,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325334794] [2022-07-13 11:32:56,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325334794] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:56,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:56,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:32:56,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578015731] [2022-07-13 11:32:56,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:56,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:32:56,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:56,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:32:56,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:32:56,975 INFO L87 Difference]: Start difference. First operand 1533 states and 2304 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:57,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:57,496 INFO L93 Difference]: Finished difference Result 2744 states and 4158 transitions. [2022-07-13 11:32:57,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:32:57,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 23 [2022-07-13 11:32:57,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:57,504 INFO L225 Difference]: With dead ends: 2744 [2022-07-13 11:32:57,504 INFO L226 Difference]: Without dead ends: 1832 [2022-07-13 11:32:57,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:32:57,507 INFO L413 NwaCegarLoop]: 1150 mSDtfsCounter, 1453 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 347 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1455 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 347 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:57,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1455 Valid, 1449 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [347 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 11:32:57,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2022-07-13 11:32:57,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1521. [2022-07-13 11:32:57,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1521 states, 1219 states have (on average 1.4446267432321576) internal successors, (1761), 1217 states have internal predecessors, (1761), 225 states have call successors, (225), 70 states have call predecessors, (225), 76 states have return successors, (294), 233 states have call predecessors, (294), 216 states have call successors, (294) [2022-07-13 11:32:57,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 2280 transitions. [2022-07-13 11:32:57,572 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 2280 transitions. Word has length 23 [2022-07-13 11:32:57,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:57,572 INFO L495 AbstractCegarLoop]: Abstraction has 1521 states and 2280 transitions. [2022-07-13 11:32:57,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:32:57,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 2280 transitions. [2022-07-13 11:32:57,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 11:32:57,573 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:57,573 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:57,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 11:32:57,573 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:57,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:57,574 INFO L85 PathProgramCache]: Analyzing trace with hash 405401967, now seen corresponding path program 1 times [2022-07-13 11:32:57,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:57,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745157035] [2022-07-13 11:32:57,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:57,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:57,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:32:57,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:57,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745157035] [2022-07-13 11:32:57,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745157035] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:57,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:57,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:32:57,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307233144] [2022-07-13 11:32:57,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:57,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:32:57,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:57,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:32:57,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:57,621 INFO L87 Difference]: Start difference. First operand 1521 states and 2280 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) [2022-07-13 11:32:57,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:32:57,687 INFO L93 Difference]: Finished difference Result 1524 states and 2282 transitions. [2022-07-13 11:32:57,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:32:57,687 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 [2022-07-13 11:32:57,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:32:57,693 INFO L225 Difference]: With dead ends: 1524 [2022-07-13 11:32:57,693 INFO L226 Difference]: Without dead ends: 1520 [2022-07-13 11:32:57,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:32:57,695 INFO L413 NwaCegarLoop]: 878 mSDtfsCounter, 22 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1711 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:32:57,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1711 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:32:57,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2022-07-13 11:32:57,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1520. [2022-07-13 11:32:57,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1520 states, 1219 states have (on average 1.44298605414274) internal successors, (1759), 1216 states have internal predecessors, (1759), 224 states have call successors, (224), 70 states have call predecessors, (224), 76 states have return successors, (294), 233 states have call predecessors, (294), 216 states have call successors, (294) [2022-07-13 11:32:57,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 2277 transitions. [2022-07-13 11:32:57,739 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 2277 transitions. Word has length 22 [2022-07-13 11:32:57,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:32:57,740 INFO L495 AbstractCegarLoop]: Abstraction has 1520 states and 2277 transitions. [2022-07-13 11:32:57,740 INFO L496 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) [2022-07-13 11:32:57,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 2277 transitions. [2022-07-13 11:32:57,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-13 11:32:57,742 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:32:57,742 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:32:57,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 11:32:57,742 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:32:57,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:32:57,743 INFO L85 PathProgramCache]: Analyzing trace with hash -605609214, now seen corresponding path program 1 times [2022-07-13 11:32:57,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:32:57,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389410167] [2022-07-13 11:32:57,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:32:57,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:32:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:57,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 11:32:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:32:57,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:32:57,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:32:57,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389410167] [2022-07-13 11:32:57,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389410167] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:32:57,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:32:57,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:32:57,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184397677] [2022-07-13 11:32:57,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:32:57,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:32:57,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:32:57,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:32:57,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:32:57,832 INFO L87 Difference]: Start difference. First operand 1520 states and 2277 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:33:03,347 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:05,581 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:07,015 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:09,565 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:11,352 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:13,373 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:13,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:13,462 INFO L93 Difference]: Finished difference Result 2367 states and 3491 transitions. [2022-07-13 11:33:13,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 11:33:13,464 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), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-07-13 11:33:13,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:13,468 INFO L225 Difference]: With dead ends: 2367 [2022-07-13 11:33:13,469 INFO L226 Difference]: Without dead ends: 1281 [2022-07-13 11:33:13,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:33:13,471 INFO L413 NwaCegarLoop]: 959 mSDtfsCounter, 804 mSDsluCounter, 1585 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 287 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 2544 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:13,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 2544 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 482 Invalid, 4 Unknown, 0 Unchecked, 15.5s Time] [2022-07-13 11:33:13,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2022-07-13 11:33:13,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1137. [2022-07-13 11:33:13,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 912 states have (on average 1.4221491228070176) internal successors, (1297), 911 states have internal predecessors, (1297), 163 states have call successors, (163), 55 states have call predecessors, (163), 61 states have return successors, (215), 170 states have call predecessors, (215), 155 states have call successors, (215) [2022-07-13 11:33:13,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1675 transitions. [2022-07-13 11:33:13,516 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1675 transitions. Word has length 35 [2022-07-13 11:33:13,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:13,517 INFO L495 AbstractCegarLoop]: Abstraction has 1137 states and 1675 transitions. [2022-07-13 11:33:13,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:33:13,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1675 transitions. [2022-07-13 11:33:13,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-13 11:33:13,520 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:13,520 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:33:13,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 11:33:13,521 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:13,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:13,521 INFO L85 PathProgramCache]: Analyzing trace with hash -81924256, now seen corresponding path program 1 times [2022-07-13 11:33:13,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:13,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605571414] [2022-07-13 11:33:13,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:13,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:13,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:13,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:33:13,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:13,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605571414] [2022-07-13 11:33:13,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605571414] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:13,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:13,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:33:13,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120545255] [2022-07-13 11:33:13,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:13,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:33:13,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:13,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:33:13,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:33:13,600 INFO L87 Difference]: Start difference. First operand 1137 states and 1675 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:13,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:13,921 INFO L93 Difference]: Finished difference Result 1200 states and 1757 transitions. [2022-07-13 11:33:13,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:33:13,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 31 [2022-07-13 11:33:13,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:13,926 INFO L225 Difference]: With dead ends: 1200 [2022-07-13 11:33:13,926 INFO L226 Difference]: Without dead ends: 1155 [2022-07-13 11:33:13,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:33:13,927 INFO L413 NwaCegarLoop]: 875 mSDtfsCounter, 924 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:13,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 1513 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:33:13,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2022-07-13 11:33:13,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1137. [2022-07-13 11:33:13,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 912 states have (on average 1.4199561403508771) internal successors, (1295), 911 states have internal predecessors, (1295), 163 states have call successors, (163), 55 states have call predecessors, (163), 61 states have return successors, (215), 170 states have call predecessors, (215), 155 states have call successors, (215) [2022-07-13 11:33:13,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1673 transitions. [2022-07-13 11:33:13,971 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1673 transitions. Word has length 31 [2022-07-13 11:33:13,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:13,971 INFO L495 AbstractCegarLoop]: Abstraction has 1137 states and 1673 transitions. [2022-07-13 11:33:13,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:13,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1673 transitions. [2022-07-13 11:33:13,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-13 11:33:13,973 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:13,973 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:33:13,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 11:33:13,974 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:13,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:13,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1935229893, now seen corresponding path program 1 times [2022-07-13 11:33:13,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:13,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286511659] [2022-07-13 11:33:13,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:13,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:14,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:14,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:33:14,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:14,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286511659] [2022-07-13 11:33:14,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286511659] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:14,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:14,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:33:14,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998561293] [2022-07-13 11:33:14,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:14,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:33:14,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:14,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:33:14,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:33:14,049 INFO L87 Difference]: Start difference. First operand 1137 states and 1673 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:14,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:14,338 INFO L93 Difference]: Finished difference Result 1189 states and 1739 transitions. [2022-07-13 11:33:14,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:33:14,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 33 [2022-07-13 11:33:14,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:14,342 INFO L225 Difference]: With dead ends: 1189 [2022-07-13 11:33:14,343 INFO L226 Difference]: Without dead ends: 1116 [2022-07-13 11:33:14,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:33:14,345 INFO L413 NwaCegarLoop]: 873 mSDtfsCounter, 904 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:14,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 1511 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:33:14,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2022-07-13 11:33:14,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1114. [2022-07-13 11:33:14,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1114 states, 891 states have (on average 1.425364758698092) internal successors, (1270), 897 states have internal predecessors, (1270), 163 states have call successors, (163), 55 states have call predecessors, (163), 59 states have return successors, (206), 161 states have call predecessors, (206), 155 states have call successors, (206) [2022-07-13 11:33:14,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 1639 transitions. [2022-07-13 11:33:14,374 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 1639 transitions. Word has length 33 [2022-07-13 11:33:14,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:14,375 INFO L495 AbstractCegarLoop]: Abstraction has 1114 states and 1639 transitions. [2022-07-13 11:33:14,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:14,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1639 transitions. [2022-07-13 11:33:14,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-13 11:33:14,376 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:14,376 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:33:14,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 11:33:14,377 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:14,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:14,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1785748283, now seen corresponding path program 1 times [2022-07-13 11:33:14,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:14,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430322099] [2022-07-13 11:33:14,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:14,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:14,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:14,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:33:14,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:14,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430322099] [2022-07-13 11:33:14,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430322099] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:14,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:14,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:33:14,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586906970] [2022-07-13 11:33:14,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:14,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:33:14,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:14,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:33:14,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:33:14,445 INFO L87 Difference]: Start difference. First operand 1114 states and 1639 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:14,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:14,485 INFO L93 Difference]: Finished difference Result 1191 states and 1741 transitions. [2022-07-13 11:33:14,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:33:14,486 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), 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 33 [2022-07-13 11:33:14,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:14,490 INFO L225 Difference]: With dead ends: 1191 [2022-07-13 11:33:14,490 INFO L226 Difference]: Without dead ends: 1172 [2022-07-13 11:33:14,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:33:14,491 INFO L413 NwaCegarLoop]: 880 mSDtfsCounter, 866 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:14,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 937 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:33:14,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2022-07-13 11:33:14,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1150. [2022-07-13 11:33:14,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 924 states have (on average 1.4274891774891776) internal successors, (1319), 930 states have internal predecessors, (1319), 164 states have call successors, (164), 56 states have call predecessors, (164), 61 states have return successors, (208), 163 states have call predecessors, (208), 156 states have call successors, (208) [2022-07-13 11:33:14,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1691 transitions. [2022-07-13 11:33:14,536 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1691 transitions. Word has length 33 [2022-07-13 11:33:14,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:14,537 INFO L495 AbstractCegarLoop]: Abstraction has 1150 states and 1691 transitions. [2022-07-13 11:33:14,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:14,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1691 transitions. [2022-07-13 11:33:14,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-13 11:33:14,540 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:14,540 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:33:14,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 11:33:14,540 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:14,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:14,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1771403374, now seen corresponding path program 1 times [2022-07-13 11:33:14,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:14,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472395856] [2022-07-13 11:33:14,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:14,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:14,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:33:14,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:14,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472395856] [2022-07-13 11:33:14,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472395856] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:14,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:14,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:33:14,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475820615] [2022-07-13 11:33:14,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:14,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:33:14,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:14,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:33:14,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:33:14,607 INFO L87 Difference]: Start difference. First operand 1150 states and 1691 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:14,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:14,683 INFO L93 Difference]: Finished difference Result 1473 states and 2153 transitions. [2022-07-13 11:33:14,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:33:14,683 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), 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 33 [2022-07-13 11:33:14,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:14,690 INFO L225 Difference]: With dead ends: 1473 [2022-07-13 11:33:14,690 INFO L226 Difference]: Without dead ends: 1457 [2022-07-13 11:33:14,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:33:14,692 INFO L413 NwaCegarLoop]: 1196 mSDtfsCounter, 354 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 2019 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:14,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 2019 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:33:14,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2022-07-13 11:33:14,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1175. [2022-07-13 11:33:14,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 947 states have (on average 1.4181626187961984) internal successors, (1343), 953 states have internal predecessors, (1343), 164 states have call successors, (164), 56 states have call predecessors, (164), 63 states have return successors, (209), 165 states have call predecessors, (209), 156 states have call successors, (209) [2022-07-13 11:33:14,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1716 transitions. [2022-07-13 11:33:14,734 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1716 transitions. Word has length 33 [2022-07-13 11:33:14,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:14,734 INFO L495 AbstractCegarLoop]: Abstraction has 1175 states and 1716 transitions. [2022-07-13 11:33:14,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:14,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1716 transitions. [2022-07-13 11:33:14,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 11:33:14,736 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:14,736 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:33:14,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 11:33:14,737 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:14,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:14,737 INFO L85 PathProgramCache]: Analyzing trace with hash 477313322, now seen corresponding path program 1 times [2022-07-13 11:33:14,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:14,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444356905] [2022-07-13 11:33:14,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:14,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:14,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:14,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:33:14,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:14,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:33:14,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:14,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444356905] [2022-07-13 11:33:14,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444356905] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:14,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:14,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:33:14,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928591987] [2022-07-13 11:33:14,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:14,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:33:14,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:14,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:33:14,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:33:14,830 INFO L87 Difference]: Start difference. First operand 1175 states and 1716 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:33:18,391 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:20,530 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:23,785 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:25,859 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:26,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:26,739 INFO L93 Difference]: Finished difference Result 1829 states and 2683 transitions. [2022-07-13 11:33:26,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:33:26,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-07-13 11:33:26,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:26,752 INFO L225 Difference]: With dead ends: 1829 [2022-07-13 11:33:26,752 INFO L226 Difference]: Without dead ends: 1167 [2022-07-13 11:33:26,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:33:26,754 INFO L413 NwaCegarLoop]: 850 mSDtfsCounter, 915 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 135 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 975 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:26,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [975 Valid, 1247 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 319 Invalid, 4 Unknown, 0 Unchecked, 11.8s Time] [2022-07-13 11:33:26,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2022-07-13 11:33:26,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1108. [2022-07-13 11:33:26,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 887 states have (on average 1.4126268320180384) internal successors, (1253), 891 states have internal predecessors, (1253), 161 states have call successors, (161), 55 states have call predecessors, (161), 59 states have return successors, (205), 161 states have call predecessors, (205), 155 states have call successors, (205) [2022-07-13 11:33:26,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1619 transitions. [2022-07-13 11:33:26,789 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1619 transitions. Word has length 36 [2022-07-13 11:33:26,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:26,789 INFO L495 AbstractCegarLoop]: Abstraction has 1108 states and 1619 transitions. [2022-07-13 11:33:26,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:33:26,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1619 transitions. [2022-07-13 11:33:26,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-13 11:33:26,791 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:26,791 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:33:26,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 11:33:26,791 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:26,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:26,792 INFO L85 PathProgramCache]: Analyzing trace with hash -467724112, now seen corresponding path program 1 times [2022-07-13 11:33:26,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:26,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933289717] [2022-07-13 11:33:26,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:26,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:26,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:33:26,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:26,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933289717] [2022-07-13 11:33:26,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933289717] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:26,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:26,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 11:33:26,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842768447] [2022-07-13 11:33:26,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:26,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:33:26,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:26,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:33:26,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:33:26,848 INFO L87 Difference]: Start difference. First operand 1108 states and 1619 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:26,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:26,941 INFO L93 Difference]: Finished difference Result 1122 states and 1634 transitions. [2022-07-13 11:33:26,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:33:26,941 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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 34 [2022-07-13 11:33:26,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:26,945 INFO L225 Difference]: With dead ends: 1122 [2022-07-13 11:33:26,945 INFO L226 Difference]: Without dead ends: 1118 [2022-07-13 11:33:26,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:33:26,947 INFO L413 NwaCegarLoop]: 866 mSDtfsCounter, 42 mSDsluCounter, 3417 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 4283 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:26,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 4283 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:33:26,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2022-07-13 11:33:26,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1116. [2022-07-13 11:33:26,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 895 states have (on average 1.4100558659217877) internal successors, (1262), 899 states have internal predecessors, (1262), 161 states have call successors, (161), 55 states have call predecessors, (161), 59 states have return successors, (205), 161 states have call predecessors, (205), 155 states have call successors, (205) [2022-07-13 11:33:26,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1628 transitions. [2022-07-13 11:33:26,984 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1628 transitions. Word has length 34 [2022-07-13 11:33:26,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:26,985 INFO L495 AbstractCegarLoop]: Abstraction has 1116 states and 1628 transitions. [2022-07-13 11:33:26,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:26,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1628 transitions. [2022-07-13 11:33:26,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-13 11:33:26,986 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:26,986 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:33:26,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 11:33:27,000 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:27,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:27,001 INFO L85 PathProgramCache]: Analyzing trace with hash -468000942, now seen corresponding path program 1 times [2022-07-13 11:33:27,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:27,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585825759] [2022-07-13 11:33:27,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:27,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:27,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:33:27,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:27,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585825759] [2022-07-13 11:33:27,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585825759] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:27,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:27,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:33:27,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491979536] [2022-07-13 11:33:27,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:27,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:33:27,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:27,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:33:27,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:33:27,070 INFO L87 Difference]: Start difference. First operand 1116 states and 1628 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:27,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:27,471 INFO L93 Difference]: Finished difference Result 1385 states and 2024 transitions. [2022-07-13 11:33:27,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:33:27,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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 34 [2022-07-13 11:33:27,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:27,476 INFO L225 Difference]: With dead ends: 1385 [2022-07-13 11:33:27,476 INFO L226 Difference]: Without dead ends: 1357 [2022-07-13 11:33:27,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:33:27,477 INFO L413 NwaCegarLoop]: 1155 mSDtfsCounter, 1145 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 1780 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:27,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 1780 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:33:27,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2022-07-13 11:33:27,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1094. [2022-07-13 11:33:27,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1094 states, 873 states have (on average 1.4158075601374571) internal successors, (1236), 877 states have internal predecessors, (1236), 161 states have call successors, (161), 55 states have call predecessors, (161), 59 states have return successors, (205), 161 states have call predecessors, (205), 155 states have call successors, (205) [2022-07-13 11:33:27,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1602 transitions. [2022-07-13 11:33:27,516 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1602 transitions. Word has length 34 [2022-07-13 11:33:27,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:27,517 INFO L495 AbstractCegarLoop]: Abstraction has 1094 states and 1602 transitions. [2022-07-13 11:33:27,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:27,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1602 transitions. [2022-07-13 11:33:27,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-13 11:33:27,518 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:27,518 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:33:27,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 11:33:27,519 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:27,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:27,519 INFO L85 PathProgramCache]: Analyzing trace with hash 962516437, now seen corresponding path program 1 times [2022-07-13 11:33:27,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:27,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394397457] [2022-07-13 11:33:27,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:27,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:27,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 11:33:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:27,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 11:33:27,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:27,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:33:27,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:27,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394397457] [2022-07-13 11:33:27,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394397457] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:27,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:27,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:33:27,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229501515] [2022-07-13 11:33:27,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:27,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:33:27,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:27,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:33:27,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:33:27,616 INFO L87 Difference]: Start difference. First operand 1094 states and 1602 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 11:33:33,295 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:35,499 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:37,430 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:39,860 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:41,957 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:43,216 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:43,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:43,427 INFO L93 Difference]: Finished difference Result 1794 states and 2641 transitions. [2022-07-13 11:33:43,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 11:33:43,428 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2022-07-13 11:33:43,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:43,434 INFO L225 Difference]: With dead ends: 1794 [2022-07-13 11:33:43,434 INFO L226 Difference]: Without dead ends: 1226 [2022-07-13 11:33:43,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:33:43,435 INFO L413 NwaCegarLoop]: 914 mSDtfsCounter, 615 mSDsluCounter, 1446 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 264 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 2360 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:43,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 2360 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 604 Invalid, 4 Unknown, 0 Unchecked, 15.7s Time] [2022-07-13 11:33:43,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2022-07-13 11:33:43,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1053. [2022-07-13 11:33:43,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 840 states have (on average 1.4166666666666667) internal successors, (1190), 847 states have internal predecessors, (1190), 156 states have call successors, (156), 51 states have call predecessors, (156), 56 states have return successors, (212), 154 states have call predecessors, (212), 150 states have call successors, (212) [2022-07-13 11:33:43,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1558 transitions. [2022-07-13 11:33:43,482 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1558 transitions. Word has length 43 [2022-07-13 11:33:43,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:43,483 INFO L495 AbstractCegarLoop]: Abstraction has 1053 states and 1558 transitions. [2022-07-13 11:33:43,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 11:33:43,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1558 transitions. [2022-07-13 11:33:43,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-13 11:33:43,485 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:43,485 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:33:43,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 11:33:43,485 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:43,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:43,486 INFO L85 PathProgramCache]: Analyzing trace with hash 314723646, now seen corresponding path program 1 times [2022-07-13 11:33:43,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:43,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113621927] [2022-07-13 11:33:43,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:43,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:43,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:43,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 11:33:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:43,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 11:33:43,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:43,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:33:43,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:43,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113621927] [2022-07-13 11:33:43,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113621927] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:43,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:43,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:33:43,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78132431] [2022-07-13 11:33:43,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:43,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:33:43,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:43,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:33:43,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:33:43,560 INFO L87 Difference]: Start difference. First operand 1053 states and 1558 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 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) [2022-07-13 11:33:45,585 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:48,896 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:51,673 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:54,120 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:56,244 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:57,840 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:57,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:57,932 INFO L93 Difference]: Finished difference Result 1167 states and 1731 transitions. [2022-07-13 11:33:57,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:33:57,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 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 43 [2022-07-13 11:33:57,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:57,937 INFO L225 Difference]: With dead ends: 1167 [2022-07-13 11:33:57,937 INFO L226 Difference]: Without dead ends: 1138 [2022-07-13 11:33:57,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:33:57,938 INFO L413 NwaCegarLoop]: 827 mSDtfsCounter, 291 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 253 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 2379 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:57,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 2379 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 646 Invalid, 3 Unknown, 0 Unchecked, 14.3s Time] [2022-07-13 11:33:57,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2022-07-13 11:33:57,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1054. [2022-07-13 11:33:57,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1054 states, 841 states have (on average 1.4161712247324614) internal successors, (1191), 848 states have internal predecessors, (1191), 156 states have call successors, (156), 51 states have call predecessors, (156), 56 states have return successors, (212), 154 states have call predecessors, (212), 150 states have call successors, (212) [2022-07-13 11:33:57,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1559 transitions. [2022-07-13 11:33:57,990 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1559 transitions. Word has length 43 [2022-07-13 11:33:57,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:57,991 INFO L495 AbstractCegarLoop]: Abstraction has 1054 states and 1559 transitions. [2022-07-13 11:33:57,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 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) [2022-07-13 11:33:57,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1559 transitions. [2022-07-13 11:33:57,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-13 11:33:57,994 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:57,994 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:33:57,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 11:33:57,994 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:57,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:57,995 INFO L85 PathProgramCache]: Analyzing trace with hash 737425472, now seen corresponding path program 1 times [2022-07-13 11:33:57,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:57,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463660118] [2022-07-13 11:33:57,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:57,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:58,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 11:33:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:58,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 11:33:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:58,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:33:58,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:58,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463660118] [2022-07-13 11:33:58,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463660118] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:58,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:58,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:33:58,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851511918] [2022-07-13 11:33:58,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:58,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:33:58,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:58,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:33:58,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:33:58,070 INFO L87 Difference]: Start difference. First operand 1054 states and 1559 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 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) [2022-07-13 11:34:00,025 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:02,049 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:05,475 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:07,334 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:09,271 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:11,693 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:13,797 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:15,142 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:15,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:34:15,241 INFO L93 Difference]: Finished difference Result 1136 states and 1692 transitions. [2022-07-13 11:34:15,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 11:34:15,243 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 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 43 [2022-07-13 11:34:15,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:34:15,247 INFO L225 Difference]: With dead ends: 1136 [2022-07-13 11:34:15,247 INFO L226 Difference]: Without dead ends: 1129 [2022-07-13 11:34:15,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:34:15,248 INFO L413 NwaCegarLoop]: 825 mSDtfsCounter, 261 mSDsluCounter, 1559 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 241 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 2384 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:34:15,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 2384 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 663 Invalid, 4 Unknown, 0 Unchecked, 17.1s Time] [2022-07-13 11:34:15,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2022-07-13 11:34:15,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1066. [2022-07-13 11:34:15,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1066 states, 853 states have (on average 1.4126611957796014) internal successors, (1205), 860 states have internal predecessors, (1205), 156 states have call successors, (156), 51 states have call predecessors, (156), 56 states have return successors, (212), 154 states have call predecessors, (212), 150 states have call successors, (212) [2022-07-13 11:34:15,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1573 transitions. [2022-07-13 11:34:15,285 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1573 transitions. Word has length 43 [2022-07-13 11:34:15,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:34:15,286 INFO L495 AbstractCegarLoop]: Abstraction has 1066 states and 1573 transitions. [2022-07-13 11:34:15,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 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) [2022-07-13 11:34:15,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1573 transitions. [2022-07-13 11:34:15,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 11:34:15,287 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:34:15,288 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:34:15,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 11:34:15,288 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:34:15,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:34:15,288 INFO L85 PathProgramCache]: Analyzing trace with hash 975586301, now seen corresponding path program 1 times [2022-07-13 11:34:15,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:34:15,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655348917] [2022-07-13 11:34:15,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:15,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:34:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:15,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:34:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:15,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 11:34:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:15,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:34:15,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:34:15,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655348917] [2022-07-13 11:34:15,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655348917] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:34:15,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:34:15,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:34:15,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110962161] [2022-07-13 11:34:15,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:34:15,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:34:15,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:34:15,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:34:15,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:34:15,362 INFO L87 Difference]: Start difference. First operand 1066 states and 1573 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 11:34:19,414 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:21,354 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:24,858 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:26,961 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:27,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:34:27,823 INFO L93 Difference]: Finished difference Result 1206 states and 1776 transitions. [2022-07-13 11:34:27,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 11:34:27,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-07-13 11:34:27,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:34:27,829 INFO L225 Difference]: With dead ends: 1206 [2022-07-13 11:34:27,829 INFO L226 Difference]: Without dead ends: 1131 [2022-07-13 11:34:27,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:34:27,829 INFO L413 NwaCegarLoop]: 835 mSDtfsCounter, 901 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 281 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 2030 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:34:27,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [964 Valid, 2030 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 581 Invalid, 3 Unknown, 0 Unchecked, 12.4s Time] [2022-07-13 11:34:27,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2022-07-13 11:34:27,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 1055. [2022-07-13 11:34:27,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 846 states have (on average 1.41371158392435) internal successors, (1196), 853 states have internal predecessors, (1196), 154 states have call successors, (154), 49 states have call predecessors, (154), 54 states have return successors, (210), 152 states have call predecessors, (210), 148 states have call successors, (210) [2022-07-13 11:34:27,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1560 transitions. [2022-07-13 11:34:27,864 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1560 transitions. Word has length 44 [2022-07-13 11:34:27,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:34:27,864 INFO L495 AbstractCegarLoop]: Abstraction has 1055 states and 1560 transitions. [2022-07-13 11:34:27,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 11:34:27,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1560 transitions. [2022-07-13 11:34:27,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-13 11:34:27,866 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:34:27,866 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:34:27,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 11:34:27,866 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:34:27,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:34:27,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1737788824, now seen corresponding path program 1 times [2022-07-13 11:34:27,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:34:27,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596220177] [2022-07-13 11:34:27,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:27,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:34:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:27,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 11:34:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:27,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:34:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:27,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:34:27,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:34:27,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596220177] [2022-07-13 11:34:27,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596220177] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:34:27,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:34:27,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 11:34:27,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458157618] [2022-07-13 11:34:27,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:34:27,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 11:34:27,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:34:27,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 11:34:27,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-13 11:34:27,991 INFO L87 Difference]: Start difference. First operand 1055 states and 1560 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 11:34:35,938 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:37,958 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:39,166 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:40,759 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:42,853 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:44,880 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:44,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:34:44,962 INFO L93 Difference]: Finished difference Result 1107 states and 1648 transitions. [2022-07-13 11:34:44,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 11:34:44,963 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2022-07-13 11:34:44,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:34:44,968 INFO L225 Difference]: With dead ends: 1107 [2022-07-13 11:34:44,968 INFO L226 Difference]: Without dead ends: 1092 [2022-07-13 11:34:44,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-07-13 11:34:44,969 INFO L413 NwaCegarLoop]: 840 mSDtfsCounter, 90 mSDsluCounter, 5255 mSDsCounter, 0 mSdLazyCounter, 1582 mSolverCounterSat, 103 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 6095 SdHoareTripleChecker+Invalid, 1688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1582 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.9s IncrementalHoareTripleChecker+Time [2022-07-13 11:34:44,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 6095 Invalid, 1688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1582 Invalid, 3 Unknown, 0 Unchecked, 16.9s Time] [2022-07-13 11:34:44,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2022-07-13 11:34:45,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 1053. [2022-07-13 11:34:45,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 845 states have (on average 1.4130177514792899) internal successors, (1194), 852 states have internal predecessors, (1194), 153 states have call successors, (153), 49 states have call predecessors, (153), 54 states have return successors, (209), 151 states have call predecessors, (209), 147 states have call successors, (209) [2022-07-13 11:34:45,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1556 transitions. [2022-07-13 11:34:45,011 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1556 transitions. Word has length 47 [2022-07-13 11:34:45,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:34:45,011 INFO L495 AbstractCegarLoop]: Abstraction has 1053 states and 1556 transitions. [2022-07-13 11:34:45,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 11:34:45,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1556 transitions. [2022-07-13 11:34:45,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 11:34:45,013 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:34:45,013 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:34:45,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 11:34:45,013 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:34:45,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:34:45,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1317341012, now seen corresponding path program 1 times [2022-07-13 11:34:45,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:34:45,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874119335] [2022-07-13 11:34:45,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:45,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:34:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:45,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 11:34:45,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:45,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:34:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:45,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:34:45,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:34:45,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874119335] [2022-07-13 11:34:45,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874119335] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:34:45,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:34:45,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 11:34:45,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613645312] [2022-07-13 11:34:45,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:34:45,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 11:34:45,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:34:45,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 11:34:45,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-13 11:34:45,157 INFO L87 Difference]: Start difference. First operand 1053 states and 1556 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 11:34:47,698 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:53,808 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:56,016 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:57,825 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:00,415 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:02,520 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:04,546 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:04,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:35:04,642 INFO L93 Difference]: Finished difference Result 1104 states and 1643 transitions. [2022-07-13 11:35:04,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 11:35:04,644 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-07-13 11:35:04,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:35:04,648 INFO L225 Difference]: With dead ends: 1104 [2022-07-13 11:35:04,648 INFO L226 Difference]: Without dead ends: 1089 [2022-07-13 11:35:04,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-07-13 11:35:04,649 INFO L413 NwaCegarLoop]: 832 mSDtfsCounter, 90 mSDsluCounter, 5212 mSDsCounter, 0 mSdLazyCounter, 1568 mSolverCounterSat, 102 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 6044 SdHoareTripleChecker+Invalid, 1675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1568 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:35:04,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 6044 Invalid, 1675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1568 Invalid, 5 Unknown, 0 Unchecked, 19.4s Time] [2022-07-13 11:35:04,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2022-07-13 11:35:04,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1050. [2022-07-13 11:35:04,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 843 states have (on average 1.4128113879003559) internal successors, (1191), 850 states have internal predecessors, (1191), 152 states have call successors, (152), 49 states have call predecessors, (152), 54 states have return successors, (208), 150 states have call predecessors, (208), 146 states have call successors, (208) [2022-07-13 11:35:04,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1551 transitions. [2022-07-13 11:35:04,688 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1551 transitions. Word has length 45 [2022-07-13 11:35:04,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:35:04,689 INFO L495 AbstractCegarLoop]: Abstraction has 1050 states and 1551 transitions. [2022-07-13 11:35:04,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 11:35:04,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1551 transitions. [2022-07-13 11:35:04,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 11:35:04,697 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:35:04,697 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:35:04,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-13 11:35:04,707 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:35:04,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:35:04,707 INFO L85 PathProgramCache]: Analyzing trace with hash 267737260, now seen corresponding path program 1 times [2022-07-13 11:35:04,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:35:04,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236442664] [2022-07-13 11:35:04,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:35:04,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:35:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:35:04,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 11:35:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:35:04,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 11:35:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:35:04,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:35:04,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:35:04,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236442664] [2022-07-13 11:35:04,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236442664] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:35:04,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:35:04,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 11:35:04,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230411216] [2022-07-13 11:35:04,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:35:04,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 11:35:04,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:35:04,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 11:35:04,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:35:04,806 INFO L87 Difference]: Start difference. First operand 1050 states and 1551 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 5 states have internal predecessors, (40), 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) [2022-07-13 11:35:09,493 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:11,945 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:14,397 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:16,384 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:18,407 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:18,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:35:18,501 INFO L93 Difference]: Finished difference Result 1121 states and 1667 transitions. [2022-07-13 11:35:18,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 11:35:18,502 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 5 states have internal predecessors, (40), 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 45 [2022-07-13 11:35:18,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:35:18,506 INFO L225 Difference]: With dead ends: 1121 [2022-07-13 11:35:18,506 INFO L226 Difference]: Without dead ends: 1115 [2022-07-13 11:35:18,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-07-13 11:35:18,508 INFO L413 NwaCegarLoop]: 809 mSDtfsCounter, 1101 mSDsluCounter, 1987 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 293 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1191 SdHoareTripleChecker+Valid, 2796 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:35:18,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1191 Valid, 2796 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 1050 Invalid, 3 Unknown, 0 Unchecked, 13.5s Time] [2022-07-13 11:35:18,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2022-07-13 11:35:18,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1050. [2022-07-13 11:35:18,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 843 states have (on average 1.4116251482799524) internal successors, (1190), 850 states have internal predecessors, (1190), 152 states have call successors, (152), 49 states have call predecessors, (152), 54 states have return successors, (208), 150 states have call predecessors, (208), 146 states have call successors, (208) [2022-07-13 11:35:18,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1550 transitions. [2022-07-13 11:35:18,561 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1550 transitions. Word has length 45 [2022-07-13 11:35:18,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:35:18,562 INFO L495 AbstractCegarLoop]: Abstraction has 1050 states and 1550 transitions. [2022-07-13 11:35:18,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 5 states have internal predecessors, (40), 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) [2022-07-13 11:35:18,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1550 transitions. [2022-07-13 11:35:18,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-13 11:35:18,563 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:35:18,563 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:35:18,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-13 11:35:18,564 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:35:18,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:35:18,564 INFO L85 PathProgramCache]: Analyzing trace with hash -234696471, now seen corresponding path program 1 times [2022-07-13 11:35:18,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:35:18,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575786853] [2022-07-13 11:35:18,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:35:18,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:35:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:35:18,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 11:35:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:35:18,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 11:35:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:35:18,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:35:18,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:35:18,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575786853] [2022-07-13 11:35:18,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575786853] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:35:18,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:35:18,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 11:35:18,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90543642] [2022-07-13 11:35:18,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:35:18,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 11:35:18,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:35:18,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 11:35:18,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:35:18,665 INFO L87 Difference]: Start difference. First operand 1050 states and 1550 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 7 states have internal predecessors, (41), 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) [2022-07-13 11:35:24,834 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:26,990 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:28,247 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:30,695 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:32,795 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:34,827 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:34,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:35:34,928 INFO L93 Difference]: Finished difference Result 1133 states and 1683 transitions. [2022-07-13 11:35:34,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 11:35:34,930 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 7 states have internal predecessors, (41), 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 46 [2022-07-13 11:35:34,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:35:34,933 INFO L225 Difference]: With dead ends: 1133 [2022-07-13 11:35:34,933 INFO L226 Difference]: Without dead ends: 1107 [2022-07-13 11:35:34,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:35:34,934 INFO L413 NwaCegarLoop]: 813 mSDtfsCounter, 300 mSDsluCounter, 4316 mSDsCounter, 0 mSdLazyCounter, 1314 mSolverCounterSat, 239 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 5129 SdHoareTripleChecker+Invalid, 1558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 1314 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:35:34,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 5129 Invalid, 1558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 1314 Invalid, 5 Unknown, 0 Unchecked, 16.1s Time] [2022-07-13 11:35:34,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2022-07-13 11:35:34,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1045. [2022-07-13 11:35:34,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 839 states have (on average 1.3945172824791419) internal successors, (1170), 846 states have internal predecessors, (1170), 151 states have call successors, (151), 49 states have call predecessors, (151), 54 states have return successors, (207), 149 states have call predecessors, (207), 145 states have call successors, (207) [2022-07-13 11:35:34,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1528 transitions. [2022-07-13 11:35:34,974 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1528 transitions. Word has length 46 [2022-07-13 11:35:34,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:35:34,975 INFO L495 AbstractCegarLoop]: Abstraction has 1045 states and 1528 transitions. [2022-07-13 11:35:34,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 7 states have internal predecessors, (41), 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) [2022-07-13 11:35:34,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1528 transitions. [2022-07-13 11:35:34,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-13 11:35:34,976 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:35:34,976 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:35:34,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-13 11:35:34,977 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:35:34,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:35:34,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1831784630, now seen corresponding path program 1 times [2022-07-13 11:35:34,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:35:34,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163384691] [2022-07-13 11:35:34,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:35:34,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:35:35,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:35:35,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 11:35:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:35:35,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 11:35:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:35:35,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:35:35,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:35:35,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163384691] [2022-07-13 11:35:35,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163384691] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:35:35,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:35:35,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:35:35,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607083536] [2022-07-13 11:35:35,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:35:35,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:35:35,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:35:35,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:35:35,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:35:35,046 INFO L87 Difference]: Start difference. First operand 1045 states and 1528 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 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) [2022-07-13 11:35:39,573 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:41,822 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:43,851 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:46,556 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:48,663 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:49,840 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:49,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:35:49,925 INFO L93 Difference]: Finished difference Result 1158 states and 1700 transitions. [2022-07-13 11:35:49,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:35:49,926 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 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 46 [2022-07-13 11:35:49,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:35:49,935 INFO L225 Difference]: With dead ends: 1158 [2022-07-13 11:35:49,935 INFO L226 Difference]: Without dead ends: 1134 [2022-07-13 11:35:49,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:35:49,936 INFO L413 NwaCegarLoop]: 817 mSDtfsCounter, 286 mSDsluCounter, 1506 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 247 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 2323 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2022-07-13 11:35:49,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 2323 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 648 Invalid, 5 Unknown, 0 Unchecked, 14.8s Time] [2022-07-13 11:35:49,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2022-07-13 11:35:49,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 1050. [2022-07-13 11:35:49,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 844 states have (on average 1.3945497630331753) internal successors, (1177), 851 states have internal predecessors, (1177), 151 states have call successors, (151), 49 states have call predecessors, (151), 54 states have return successors, (207), 149 states have call predecessors, (207), 145 states have call successors, (207) [2022-07-13 11:35:49,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1535 transitions. [2022-07-13 11:35:49,987 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1535 transitions. Word has length 46 [2022-07-13 11:35:49,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:35:49,987 INFO L495 AbstractCegarLoop]: Abstraction has 1050 states and 1535 transitions. [2022-07-13 11:35:49,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 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) [2022-07-13 11:35:49,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1535 transitions. [2022-07-13 11:35:49,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-13 11:35:49,989 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:35:49,989 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:35:49,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-13 11:35:49,990 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:35:49,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:35:49,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1697771124, now seen corresponding path program 1 times [2022-07-13 11:35:49,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:35:49,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625679410] [2022-07-13 11:35:49,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:35:49,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:35:50,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:35:50,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 11:35:50,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:35:50,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 11:35:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:35:50,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:35:50,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:35:50,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625679410] [2022-07-13 11:35:50,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625679410] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:35:50,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:35:50,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 11:35:50,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925749135] [2022-07-13 11:35:50,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:35:50,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 11:35:50,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:35:50,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 11:35:50,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:35:50,103 INFO L87 Difference]: Start difference. First operand 1050 states and 1535 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 7 states have internal predecessors, (41), 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) [2022-07-13 11:35:55,911 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:35:58,043 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:36:00,674 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:36:02,790 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:36:03,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:36:03,762 INFO L93 Difference]: Finished difference Result 1133 states and 1667 transitions. [2022-07-13 11:36:03,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 11:36:03,763 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 7 states have internal predecessors, (41), 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 46 [2022-07-13 11:36:03,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:36:03,766 INFO L225 Difference]: With dead ends: 1133 [2022-07-13 11:36:03,766 INFO L226 Difference]: Without dead ends: 1107 [2022-07-13 11:36:03,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:36:03,767 INFO L413 NwaCegarLoop]: 808 mSDtfsCounter, 300 mSDsluCounter, 4216 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 237 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 5024 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:36:03,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 5024 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 1320 Invalid, 2 Unknown, 0 Unchecked, 13.5s Time] [2022-07-13 11:36:03,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2022-07-13 11:36:03,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1041. [2022-07-13 11:36:03,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1041 states, 836 states have (on average 1.3779904306220097) internal successors, (1152), 843 states have internal predecessors, (1152), 150 states have call successors, (150), 49 states have call predecessors, (150), 54 states have return successors, (206), 148 states have call predecessors, (206), 144 states have call successors, (206) [2022-07-13 11:36:03,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1508 transitions. [2022-07-13 11:36:03,803 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1508 transitions. Word has length 46 [2022-07-13 11:36:03,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:36:03,803 INFO L495 AbstractCegarLoop]: Abstraction has 1041 states and 1508 transitions. [2022-07-13 11:36:03,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 7 states have internal predecessors, (41), 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) [2022-07-13 11:36:03,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1508 transitions. [2022-07-13 11:36:03,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-13 11:36:03,810 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:36:03,810 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:36:03,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-13 11:36:03,810 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:36:03,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:36:03,811 INFO L85 PathProgramCache]: Analyzing trace with hash 2006892282, now seen corresponding path program 1 times [2022-07-13 11:36:03,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:36:03,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860065292] [2022-07-13 11:36:03,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:36:03,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:36:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:36:03,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 11:36:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:36:03,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:36:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:36:03,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:36:03,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:36:03,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860065292] [2022-07-13 11:36:03,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860065292] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:36:03,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:36:03,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 11:36:03,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195664595] [2022-07-13 11:36:03,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:36:03,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:36:03,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:36:03,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:36:03,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:36:03,967 INFO L87 Difference]: Start difference. First operand 1041 states and 1508 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 11:36:11,807 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:36:13,955 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:36:15,078 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:36:17,256 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:36:18,367 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:36:20,122 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:36:21,858 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:36:21,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:36:21,944 INFO L93 Difference]: Finished difference Result 1094 states and 1595 transitions. [2022-07-13 11:36:21,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 11:36:21,946 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2022-07-13 11:36:21,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:36:21,948 INFO L225 Difference]: With dead ends: 1094 [2022-07-13 11:36:21,948 INFO L226 Difference]: Without dead ends: 1077 [2022-07-13 11:36:21,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:36:21,949 INFO L413 NwaCegarLoop]: 785 mSDtfsCounter, 101 mSDsluCounter, 5549 mSDsCounter, 0 mSdLazyCounter, 1702 mSolverCounterSat, 99 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 6334 SdHoareTripleChecker+Invalid, 1804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1702 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.9s IncrementalHoareTripleChecker+Time [2022-07-13 11:36:21,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 6334 Invalid, 1804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1702 Invalid, 3 Unknown, 0 Unchecked, 17.9s Time] [2022-07-13 11:36:21,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2022-07-13 11:36:21,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 1038. [2022-07-13 11:36:21,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 834 states have (on average 1.3776978417266188) internal successors, (1149), 841 states have internal predecessors, (1149), 149 states have call successors, (149), 49 states have call predecessors, (149), 54 states have return successors, (205), 147 states have call predecessors, (205), 143 states have call successors, (205) [2022-07-13 11:36:21,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1503 transitions. [2022-07-13 11:36:21,992 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1503 transitions. Word has length 48 [2022-07-13 11:36:21,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:36:21,992 INFO L495 AbstractCegarLoop]: Abstraction has 1038 states and 1503 transitions. [2022-07-13 11:36:21,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 11:36:21,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1503 transitions. [2022-07-13 11:36:21,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-13 11:36:21,994 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:36:21,994 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:36:21,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-13 11:36:21,994 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:36:21,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:36:21,995 INFO L85 PathProgramCache]: Analyzing trace with hash -337810077, now seen corresponding path program 1 times [2022-07-13 11:36:21,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:36:21,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052718689] [2022-07-13 11:36:21,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:36:21,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:36:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:36:22,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 11:36:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:36:22,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 11:36:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:36:22,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 11:36:22,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:36:22,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 11:36:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:36:22,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:36:22,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:36:22,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052718689] [2022-07-13 11:36:22,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052718689] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:36:22,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:36:22,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 11:36:22,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732792349] [2022-07-13 11:36:22,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:36:22,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:36:22,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:36:22,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:36:22,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:36:22,093 INFO L87 Difference]: Start difference. First operand 1038 states and 1503 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 11:36:27,689 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:36:29,845 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:36:31,868 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:36:34,306 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:36:34,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:36:34,391 INFO L93 Difference]: Finished difference Result 1606 states and 2346 transitions. [2022-07-13 11:36:34,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 11:36:34,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 53 [2022-07-13 11:36:34,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:36:34,395 INFO L225 Difference]: With dead ends: 1606 [2022-07-13 11:36:34,395 INFO L226 Difference]: Without dead ends: 1096 [2022-07-13 11:36:34,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-07-13 11:36:34,397 INFO L413 NwaCegarLoop]: 792 mSDtfsCounter, 446 mSDsluCounter, 1964 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 342 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 2756 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:36:34,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 2756 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 769 Invalid, 3 Unknown, 0 Unchecked, 12.2s Time] [2022-07-13 11:36:34,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2022-07-13 11:36:34,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 1040. [2022-07-13 11:36:34,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1040 states, 836 states have (on average 1.3732057416267942) internal successors, (1148), 843 states have internal predecessors, (1148), 148 states have call successors, (148), 49 states have call predecessors, (148), 55 states have return successors, (207), 147 states have call predecessors, (207), 143 states have call successors, (207) [2022-07-13 11:36:34,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1503 transitions. [2022-07-13 11:36:34,434 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1503 transitions. Word has length 53 [2022-07-13 11:36:34,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:36:34,434 INFO L495 AbstractCegarLoop]: Abstraction has 1040 states and 1503 transitions. [2022-07-13 11:36:34,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 11:36:34,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1503 transitions. [2022-07-13 11:36:34,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-13 11:36:34,436 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:36:34,436 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:36:34,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-13 11:36:34,436 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:36:34,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:36:34,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1963103447, now seen corresponding path program 1 times [2022-07-13 11:36:34,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:36:34,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242468412] [2022-07-13 11:36:34,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:36:34,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:36:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:36:34,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:36:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:36:34,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:36:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:36:34,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:36:34,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:36:34,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242468412] [2022-07-13 11:36:34,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242468412] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:36:34,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:36:34,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-13 11:36:34,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316014803] [2022-07-13 11:36:34,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:36:34,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 11:36:34,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:36:34,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 11:36:34,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-13 11:36:34,598 INFO L87 Difference]: Start difference. First operand 1040 states and 1503 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 11:36:42,933 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:36:45,099 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:36:46,638 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:36:48,041 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:36:50,126 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:36:51,230 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:36:53,247 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:36:53,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:36:53,370 INFO L93 Difference]: Finished difference Result 1093 states and 1590 transitions. [2022-07-13 11:36:53,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 11:36:53,372 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2022-07-13 11:36:53,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:36:53,375 INFO L225 Difference]: With dead ends: 1093 [2022-07-13 11:36:53,375 INFO L226 Difference]: Without dead ends: 1076 [2022-07-13 11:36:53,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-07-13 11:36:53,375 INFO L413 NwaCegarLoop]: 789 mSDtfsCounter, 113 mSDsluCounter, 6212 mSDsCounter, 0 mSdLazyCounter, 1866 mSolverCounterSat, 97 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 7001 SdHoareTripleChecker+Invalid, 1967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1866 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:36:53,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 7001 Invalid, 1967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1866 Invalid, 4 Unknown, 0 Unchecked, 18.7s Time] [2022-07-13 11:36:53,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2022-07-13 11:36:53,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1037. [2022-07-13 11:36:53,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 834 states have (on average 1.3729016786570742) internal successors, (1145), 841 states have internal predecessors, (1145), 147 states have call successors, (147), 49 states have call predecessors, (147), 55 states have return successors, (206), 146 states have call predecessors, (206), 142 states have call successors, (206) [2022-07-13 11:36:53,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1498 transitions. [2022-07-13 11:36:53,444 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1498 transitions. Word has length 50 [2022-07-13 11:36:53,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:36:53,445 INFO L495 AbstractCegarLoop]: Abstraction has 1037 states and 1498 transitions. [2022-07-13 11:36:53,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 11:36:53,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1498 transitions. [2022-07-13 11:36:53,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-13 11:36:53,447 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:36:53,447 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:36:53,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-13 11:36:53,447 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:36:53,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:36:53,448 INFO L85 PathProgramCache]: Analyzing trace with hash 667442599, now seen corresponding path program 1 times [2022-07-13 11:36:53,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:36:53,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801013382] [2022-07-13 11:36:53,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:36:53,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:36:53,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:36:53,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 11:36:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:36:53,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:36:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:36:53,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:36:53,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:36:53,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801013382] [2022-07-13 11:36:53,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801013382] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:36:53,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:36:53,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-13 11:36:53,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040337568] [2022-07-13 11:36:53,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:36:53,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 11:36:53,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:36:53,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 11:36:53,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-13 11:36:53,588 INFO L87 Difference]: Start difference. First operand 1037 states and 1498 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 11:36:56,838 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:37:03,630 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:37:07,489 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:37:09,297 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:37:11,327 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:37:11,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:37:11,425 INFO L93 Difference]: Finished difference Result 1090 states and 1585 transitions. [2022-07-13 11:37:11,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 11:37:11,427 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2022-07-13 11:37:11,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:37:11,430 INFO L225 Difference]: With dead ends: 1090 [2022-07-13 11:37:11,430 INFO L226 Difference]: Without dead ends: 1073 [2022-07-13 11:37:11,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-07-13 11:37:11,430 INFO L413 NwaCegarLoop]: 773 mSDtfsCounter, 113 mSDsluCounter, 6113 mSDsCounter, 0 mSdLazyCounter, 1852 mSolverCounterSat, 96 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 6886 SdHoareTripleChecker+Invalid, 1951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1852 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:37:11,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 6886 Invalid, 1951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1852 Invalid, 3 Unknown, 0 Unchecked, 17.7s Time] [2022-07-13 11:37:11,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2022-07-13 11:37:11,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 1034. [2022-07-13 11:37:11,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 832 states have (on average 1.3725961538461537) internal successors, (1142), 839 states have internal predecessors, (1142), 146 states have call successors, (146), 49 states have call predecessors, (146), 55 states have return successors, (205), 145 states have call predecessors, (205), 141 states have call successors, (205) [2022-07-13 11:37:11,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1493 transitions. [2022-07-13 11:37:11,473 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1493 transitions. Word has length 49 [2022-07-13 11:37:11,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:37:11,473 INFO L495 AbstractCegarLoop]: Abstraction has 1034 states and 1493 transitions. [2022-07-13 11:37:11,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 11:37:11,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1493 transitions. [2022-07-13 11:37:11,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-13 11:37:11,476 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:37:11,476 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:37:11,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-13 11:37:11,477 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:37:11,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:37:11,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1895273355, now seen corresponding path program 1 times [2022-07-13 11:37:11,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:37:11,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823300208] [2022-07-13 11:37:11,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:37:11,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:37:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:11,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:37:11,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:11,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 11:37:11,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:37:11,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:37:11,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:37:11,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823300208] [2022-07-13 11:37:11,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823300208] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:37:11,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:37:11,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 11:37:11,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939947874] [2022-07-13 11:37:11,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:37:11,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:37:11,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:37:11,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:37:11,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:37:11,566 INFO L87 Difference]: Start difference. First operand 1034 states and 1493 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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)