./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.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-simplified/cdaudio_simpl1.cil-1.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 bfc29f03d3be9b41eb07ac14f0f7eac45bf3a60a4a6601e3132f720b72534d53 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:28:45,239 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:28:45,241 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:28:45,282 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:28:45,282 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:28:45,284 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:28:45,285 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:28:45,287 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:28:45,289 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:28:45,293 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:28:45,294 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:28:45,296 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:28:45,296 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:28:45,298 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:28:45,299 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:28:45,301 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:28:45,302 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:28:45,303 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:28:45,305 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:28:45,310 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:28:45,311 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:28:45,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:28:45,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:28:45,313 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:28:45,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:28:45,321 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:28:45,321 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:28:45,321 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:28:45,322 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:28:45,323 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:28:45,324 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:28:45,324 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:28:45,325 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:28:45,326 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:28:45,326 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:28:45,328 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:28:45,328 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:28:45,329 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:28:45,329 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:28:45,329 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:28:45,330 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:28:45,332 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:28:45,332 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:28:45,361 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:28:45,361 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:28:45,362 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:28:45,362 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:28:45,363 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:28:45,363 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:28:45,363 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:28:45,363 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:28:45,364 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:28:45,364 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:28:45,365 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:28:45,365 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 11:28:45,365 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:28:45,365 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:28:45,365 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:28:45,366 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:28:45,366 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:28:45,366 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:28:45,366 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:28:45,366 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:28:45,367 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:28:45,367 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:28:45,367 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:28:45,367 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:28:45,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:28:45,368 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:28:45,368 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:28:45,368 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:28:45,368 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 11:28:45,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 11:28:45,369 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:28:45,369 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:28:45,369 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:28:45,369 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 -> bfc29f03d3be9b41eb07ac14f0f7eac45bf3a60a4a6601e3132f720b72534d53 [2022-07-13 11:28:45,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:28:45,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:28:45,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:28:45,618 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:28:45,618 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:28:45,619 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2022-07-13 11:28:45,683 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ae79b0c0/6242fb02311a4a2cb0c2c368cb80e0a2/FLAG955947e4f [2022-07-13 11:28:46,097 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:28:46,098 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2022-07-13 11:28:46,132 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ae79b0c0/6242fb02311a4a2cb0c2c368cb80e0a2/FLAG955947e4f [2022-07-13 11:28:46,143 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ae79b0c0/6242fb02311a4a2cb0c2c368cb80e0a2 [2022-07-13 11:28:46,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:28:46,149 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:28:46,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:28:46,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:28:46,155 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:28:46,155 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:28:46" (1/1) ... [2022-07-13 11:28:46,156 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51dc04c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:28:46, skipping insertion in model container [2022-07-13 11:28:46,156 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:28:46" (1/1) ... [2022-07-13 11:28:46,163 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:28:46,227 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:28:46,391 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c[2074,2087] [2022-07-13 11:28:46,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:28:46,552 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:28:46,564 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c[2074,2087] [2022-07-13 11:28:46,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:28:46,679 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:28:46,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:28:46 WrapperNode [2022-07-13 11:28:46,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:28:46,681 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:28:46,681 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:28:46,681 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:28:46,687 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:28:46" (1/1) ... [2022-07-13 11:28:46,707 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:28:46" (1/1) ... [2022-07-13 11:28:46,766 INFO L137 Inliner]: procedures = 41, calls = 108, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 1583 [2022-07-13 11:28:46,767 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:28:46,768 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:28:46,768 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:28:46,768 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:28:46,782 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:28:46" (1/1) ... [2022-07-13 11:28:46,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:28:46" (1/1) ... [2022-07-13 11:28:46,788 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:28:46" (1/1) ... [2022-07-13 11:28:46,789 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:28:46" (1/1) ... [2022-07-13 11:28:46,824 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:28:46" (1/1) ... [2022-07-13 11:28:46,833 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:28:46" (1/1) ... [2022-07-13 11:28:46,837 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:28:46" (1/1) ... [2022-07-13 11:28:46,845 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:28:46,846 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:28:46,846 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:28:46,846 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:28:46,847 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:28:46" (1/1) ... [2022-07-13 11:28:46,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:28:46,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:28:46,900 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:28:46,926 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:28:46,940 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2022-07-13 11:28:46,941 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2022-07-13 11:28:46,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:28:46,941 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2022-07-13 11:28:46,941 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2022-07-13 11:28:46,941 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-07-13 11:28:46,941 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-07-13 11:28:46,943 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2022-07-13 11:28:46,943 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2022-07-13 11:28:46,943 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-07-13 11:28:46,943 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-07-13 11:28:46,944 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-07-13 11:28:46,944 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-07-13 11:28:46,944 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2022-07-13 11:28:46,944 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2022-07-13 11:28:46,944 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-07-13 11:28:46,944 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-07-13 11:28:46,944 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2022-07-13 11:28:46,945 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2022-07-13 11:28:46,945 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-07-13 11:28:46,945 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-07-13 11:28:46,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 11:28:46,945 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-07-13 11:28:46,945 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-07-13 11:28:46,945 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2022-07-13 11:28:46,946 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2022-07-13 11:28:46,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:28:46,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:28:46,946 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2022-07-13 11:28:46,946 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2022-07-13 11:28:47,202 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:28:47,204 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:28:47,329 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:28:47,384 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-07-13 11:28:47,384 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-07-13 11:28:47,443 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:28:47,455 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-07-13 11:28:47,455 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-07-13 11:28:47,465 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:28:47,468 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:28:47,471 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:28:47,480 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:28:47,496 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:28:47,505 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:28:47,511 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:28:48,008 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: CdAudioPnp_#res#1 := 0; [2022-07-13 11:28:48,008 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##258: assume !false; [2022-07-13 11:28:48,008 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##257: assume false; [2022-07-13 11:28:48,008 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##286: assume !false; [2022-07-13 11:28:48,009 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##285: assume false; [2022-07-13 11:28:48,009 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume !false; [2022-07-13 11:28:48,009 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume false; [2022-07-13 11:28:48,010 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##133: assume false; [2022-07-13 11:28:48,010 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##134: assume !false; [2022-07-13 11:28:48,010 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume !false; [2022-07-13 11:28:48,010 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume false; [2022-07-13 11:28:48,011 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-07-13 11:28:48,011 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-07-13 11:28:48,011 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##331: assume false; [2022-07-13 11:28:48,012 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##332: assume !false; [2022-07-13 11:28:48,043 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:28:48,058 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:28:48,058 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 11:28:48,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:28:48 BoogieIcfgContainer [2022-07-13 11:28:48,061 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:28:48,063 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:28:48,063 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:28:48,066 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:28:48,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:28:46" (1/3) ... [2022-07-13 11:28:48,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f2d9bc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:28:48, skipping insertion in model container [2022-07-13 11:28:48,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:28:46" (2/3) ... [2022-07-13 11:28:48,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f2d9bc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:28:48, skipping insertion in model container [2022-07-13 11:28:48,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:28:48" (3/3) ... [2022-07-13 11:28:48,069 INFO L111 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-1.c [2022-07-13 11:28:48,080 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:28:48,081 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:28:48,137 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:28:48,144 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@5360e001, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2d0e80bd [2022-07-13 11:28:48,144 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:28:48,154 INFO L276 IsEmpty]: Start isEmpty. Operand has 470 states, 368 states have (on average 1.5081521739130435) internal successors, (555), 387 states have internal predecessors, (555), 87 states have call successors, (87), 13 states have call predecessors, (87), 13 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-07-13 11:28:48,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 11:28:48,167 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:28:48,167 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:28:48,168 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:28:48,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:28:48,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1469618458, now seen corresponding path program 1 times [2022-07-13 11:28:48,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:28:48,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707264318] [2022-07-13 11:28:48,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:28:48,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:28:48,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:48,365 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:28:48,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:28:48,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707264318] [2022-07-13 11:28:48,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707264318] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:28:48,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:28:48,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:28:48,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393128399] [2022-07-13 11:28:48,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:28:48,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:28:48,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:28:48,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:28:48,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:28:48,404 INFO L87 Difference]: Start difference. First operand has 470 states, 368 states have (on average 1.5081521739130435) internal successors, (555), 387 states have internal predecessors, (555), 87 states have call successors, (87), 13 states have call predecessors, (87), 13 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) 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:28:48,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:28:48,619 INFO L93 Difference]: Finished difference Result 813 states and 1302 transitions. [2022-07-13 11:28:48,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:28:48,621 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:28:48,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:28:48,638 INFO L225 Difference]: With dead ends: 813 [2022-07-13 11:28:48,638 INFO L226 Difference]: Without dead ends: 463 [2022-07-13 11:28:48,648 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:28:48,652 INFO L413 NwaCegarLoop]: 703 mSDtfsCounter, 8 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1357 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:28:48,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1357 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:28:48,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2022-07-13 11:28:48,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 463. [2022-07-13 11:28:48,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 363 states have (on average 1.4765840220385675) internal successors, (536), 380 states have internal predecessors, (536), 87 states have call successors, (87), 13 states have call predecessors, (87), 12 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2022-07-13 11:28:48,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 694 transitions. [2022-07-13 11:28:48,768 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 694 transitions. Word has length 13 [2022-07-13 11:28:48,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:28:48,769 INFO L495 AbstractCegarLoop]: Abstraction has 463 states and 694 transitions. [2022-07-13 11:28:48,770 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:28:48,770 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 694 transitions. [2022-07-13 11:28:48,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 11:28:48,771 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:28:48,771 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:28:48,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 11:28:48,772 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:28:48,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:28:48,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1712839840, now seen corresponding path program 1 times [2022-07-13 11:28:48,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:28:48,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404272106] [2022-07-13 11:28:48,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:28:48,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:28:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:48,819 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:28:48,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:28:48,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404272106] [2022-07-13 11:28:48,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404272106] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:28:48,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:28:48,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:28:48,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619619490] [2022-07-13 11:28:48,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:28:48,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:28:48,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:28:48,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:28:48,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:28:48,823 INFO L87 Difference]: Start difference. First operand 463 states and 694 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:28:49,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:28:49,019 INFO L93 Difference]: Finished difference Result 708 states and 1039 transitions. [2022-07-13 11:28:49,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:28:49,020 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:28:49,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:28:49,026 INFO L225 Difference]: With dead ends: 708 [2022-07-13 11:28:49,026 INFO L226 Difference]: Without dead ends: 601 [2022-07-13 11:28:49,030 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:28:49,031 INFO L413 NwaCegarLoop]: 820 mSDtfsCounter, 569 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:28:49,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 1047 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:28:49,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2022-07-13 11:28:49,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 581. [2022-07-13 11:28:49,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 467 states have (on average 1.436830835117773) internal successors, (671), 470 states have internal predecessors, (671), 93 states have call successors, (93), 21 states have call predecessors, (93), 20 states have return successors, (97), 91 states have call predecessors, (97), 81 states have call successors, (97) [2022-07-13 11:28:49,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 861 transitions. [2022-07-13 11:28:49,088 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 861 transitions. Word has length 15 [2022-07-13 11:28:49,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:28:49,088 INFO L495 AbstractCegarLoop]: Abstraction has 581 states and 861 transitions. [2022-07-13 11:28:49,088 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:28:49,088 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 861 transitions. [2022-07-13 11:28:49,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 11:28:49,090 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:28:49,090 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:28:49,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 11:28:49,090 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:28:49,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:28:49,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1900703522, now seen corresponding path program 1 times [2022-07-13 11:28:49,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:28:49,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188692555] [2022-07-13 11:28:49,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:28:49,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:28:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:49,186 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:28:49,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:28:49,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188692555] [2022-07-13 11:28:49,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188692555] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:28:49,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:28:49,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:28:49,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643632032] [2022-07-13 11:28:49,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:28:49,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:28:49,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:28:49,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:28:49,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:28:49,189 INFO L87 Difference]: Start difference. First operand 581 states and 861 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:28:49,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:28:49,242 INFO L93 Difference]: Finished difference Result 864 states and 1250 transitions. [2022-07-13 11:28:49,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:28:49,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 19 [2022-07-13 11:28:49,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:28:49,250 INFO L225 Difference]: With dead ends: 864 [2022-07-13 11:28:49,251 INFO L226 Difference]: Without dead ends: 727 [2022-07-13 11:28:49,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:28:49,252 INFO L413 NwaCegarLoop]: 684 mSDtfsCounter, 608 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 874 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:28:49,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 874 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:28:49,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2022-07-13 11:28:49,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 689. [2022-07-13 11:28:49,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 565 states have (on average 1.4336283185840708) internal successors, (810), 564 states have internal predecessors, (810), 94 states have call successors, (94), 26 states have call predecessors, (94), 29 states have return successors, (110), 98 states have call predecessors, (110), 85 states have call successors, (110) [2022-07-13 11:28:49,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1014 transitions. [2022-07-13 11:28:49,294 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1014 transitions. Word has length 19 [2022-07-13 11:28:49,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:28:49,294 INFO L495 AbstractCegarLoop]: Abstraction has 689 states and 1014 transitions. [2022-07-13 11:28:49,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:28:49,295 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1014 transitions. [2022-07-13 11:28:49,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-13 11:28:49,301 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:28:49,301 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] [2022-07-13 11:28:49,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 11:28:49,302 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:28:49,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:28:49,303 INFO L85 PathProgramCache]: Analyzing trace with hash 2011147442, now seen corresponding path program 1 times [2022-07-13 11:28:49,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:28:49,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042174649] [2022-07-13 11:28:49,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:28:49,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:28:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:49,379 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:28:49,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:28:49,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042174649] [2022-07-13 11:28:49,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042174649] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:28:49,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:28:49,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:28:49,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287955230] [2022-07-13 11:28:49,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:28:49,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:28:49,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:28:49,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:28:49,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:28:49,382 INFO L87 Difference]: Start difference. First operand 689 states and 1014 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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:28:49,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:28:49,545 INFO L93 Difference]: Finished difference Result 1296 states and 1967 transitions. [2022-07-13 11:28:49,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:28:49,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 21 [2022-07-13 11:28:49,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:28:49,558 INFO L225 Difference]: With dead ends: 1296 [2022-07-13 11:28:49,558 INFO L226 Difference]: Without dead ends: 1061 [2022-07-13 11:28:49,560 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:28:49,570 INFO L413 NwaCegarLoop]: 1012 mSDtfsCounter, 341 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:28:49,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 1631 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:28:49,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2022-07-13 11:28:49,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 821. [2022-07-13 11:28:49,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 674 states have (on average 1.4347181008902077) internal successors, (967), 672 states have internal predecessors, (967), 107 states have call successors, (107), 34 states have call predecessors, (107), 39 states have return successors, (172), 114 states have call predecessors, (172), 98 states have call successors, (172) [2022-07-13 11:28:49,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1246 transitions. [2022-07-13 11:28:49,653 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1246 transitions. Word has length 21 [2022-07-13 11:28:49,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:28:49,654 INFO L495 AbstractCegarLoop]: Abstraction has 821 states and 1246 transitions. [2022-07-13 11:28:49,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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:28:49,654 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1246 transitions. [2022-07-13 11:28:49,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 11:28:49,655 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:28:49,655 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:28:49,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 11:28:49,655 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:28:49,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:28:49,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1977476652, now seen corresponding path program 1 times [2022-07-13 11:28:49,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:28:49,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233899527] [2022-07-13 11:28:49,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:28:49,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:28:49,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:49,732 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:28:49,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:28:49,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233899527] [2022-07-13 11:28:49,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233899527] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:28:49,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:28:49,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:28:49,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568438056] [2022-07-13 11:28:49,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:28:49,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:28:49,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:28:49,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:28:49,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:28:49,735 INFO L87 Difference]: Start difference. First operand 821 states and 1246 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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:28:50,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:28:50,113 INFO L93 Difference]: Finished difference Result 1378 states and 2097 transitions. [2022-07-13 11:28:50,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:28:50,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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:28:50,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:28:50,118 INFO L225 Difference]: With dead ends: 1378 [2022-07-13 11:28:50,119 INFO L226 Difference]: Without dead ends: 833 [2022-07-13 11:28:50,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:28:50,121 INFO L413 NwaCegarLoop]: 719 mSDtfsCounter, 1036 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:28:50,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 873 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:28:50,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2022-07-13 11:28:50,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 809. [2022-07-13 11:28:50,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 664 states have (on average 1.4292168674698795) internal successors, (949), 662 states have internal predecessors, (949), 105 states have call successors, (105), 32 states have call predecessors, (105), 39 states have return successors, (168), 114 states have call predecessors, (168), 96 states have call successors, (168) [2022-07-13 11:28:50,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1222 transitions. [2022-07-13 11:28:50,163 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1222 transitions. Word has length 22 [2022-07-13 11:28:50,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:28:50,164 INFO L495 AbstractCegarLoop]: Abstraction has 809 states and 1222 transitions. [2022-07-13 11:28:50,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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:28:50,164 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1222 transitions. [2022-07-13 11:28:50,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-13 11:28:50,167 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:28:50,167 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:28:50,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 11:28:50,167 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:28:50,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:28:50,168 INFO L85 PathProgramCache]: Analyzing trace with hash -401986458, now seen corresponding path program 1 times [2022-07-13 11:28:50,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:28:50,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148993949] [2022-07-13 11:28:50,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:28:50,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:28:50,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:50,197 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:28:50,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:28:50,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148993949] [2022-07-13 11:28:50,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148993949] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:28:50,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:28:50,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:28:50,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216226662] [2022-07-13 11:28:50,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:28:50,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:28:50,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:28:50,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:28:50,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:28:50,200 INFO L87 Difference]: Start difference. First operand 809 states and 1222 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:28:50,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:28:50,259 INFO L93 Difference]: Finished difference Result 812 states and 1224 transitions. [2022-07-13 11:28:50,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:28:50,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 23 [2022-07-13 11:28:50,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:28:50,264 INFO L225 Difference]: With dead ends: 812 [2022-07-13 11:28:50,264 INFO L226 Difference]: Without dead ends: 808 [2022-07-13 11:28:50,264 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:28:50,265 INFO L413 NwaCegarLoop]: 652 mSDtfsCounter, 22 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1258 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:28:50,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1258 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:28:50,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2022-07-13 11:28:50,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 808. [2022-07-13 11:28:50,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 664 states have (on average 1.4262048192771084) internal successors, (947), 661 states have internal predecessors, (947), 104 states have call successors, (104), 32 states have call predecessors, (104), 39 states have return successors, (168), 114 states have call predecessors, (168), 96 states have call successors, (168) [2022-07-13 11:28:50,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1219 transitions. [2022-07-13 11:28:50,307 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1219 transitions. Word has length 23 [2022-07-13 11:28:50,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:28:50,308 INFO L495 AbstractCegarLoop]: Abstraction has 808 states and 1219 transitions. [2022-07-13 11:28:50,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:28:50,308 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1219 transitions. [2022-07-13 11:28:50,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 11:28:50,310 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:28:50,310 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] [2022-07-13 11:28:50,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 11:28:50,310 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:28:50,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:28:50,311 INFO L85 PathProgramCache]: Analyzing trace with hash 18720905, now seen corresponding path program 1 times [2022-07-13 11:28:50,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:28:50,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789789479] [2022-07-13 11:28:50,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:28:50,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:28:50,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:50,346 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:28:50,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:28:50,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789789479] [2022-07-13 11:28:50,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789789479] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:28:50,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:28:50,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:28:50,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817754791] [2022-07-13 11:28:50,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:28:50,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:28:50,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:28:50,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:28:50,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:28:50,348 INFO L87 Difference]: Start difference. First operand 808 states and 1219 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:28:50,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:28:50,452 INFO L93 Difference]: Finished difference Result 1228 states and 1788 transitions. [2022-07-13 11:28:50,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 11:28:50,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-13 11:28:50,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:28:50,456 INFO L225 Difference]: With dead ends: 1228 [2022-07-13 11:28:50,457 INFO L226 Difference]: Without dead ends: 812 [2022-07-13 11:28:50,458 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:28:50,458 INFO L413 NwaCegarLoop]: 766 mSDtfsCounter, 323 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 1958 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:28:50,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 1958 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:28:50,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-07-13 11:28:50,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 683. [2022-07-13 11:28:50,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 560 states have (on average 1.4089285714285715) internal successors, (789), 559 states have internal predecessors, (789), 89 states have call successors, (89), 28 states have call predecessors, (89), 33 states have return successors, (109), 95 states have call predecessors, (109), 81 states have call successors, (109) [2022-07-13 11:28:50,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 987 transitions. [2022-07-13 11:28:50,495 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 987 transitions. Word has length 28 [2022-07-13 11:28:50,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:28:50,495 INFO L495 AbstractCegarLoop]: Abstraction has 683 states and 987 transitions. [2022-07-13 11:28:50,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:28:50,496 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 987 transitions. [2022-07-13 11:28:50,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 11:28:50,497 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:28:50,497 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] [2022-07-13 11:28:50,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 11:28:50,498 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:28:50,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:28:50,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1728135655, now seen corresponding path program 1 times [2022-07-13 11:28:50,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:28:50,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620314587] [2022-07-13 11:28:50,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:28:50,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:28:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:50,532 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:28:50,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:28:50,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620314587] [2022-07-13 11:28:50,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620314587] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:28:50,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:28:50,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:28:50,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135421006] [2022-07-13 11:28:50,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:28:50,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:28:50,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:28:50,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:28:50,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:28:50,534 INFO L87 Difference]: Start difference. First operand 683 states and 987 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:28:50,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:28:50,585 INFO L93 Difference]: Finished difference Result 768 states and 1098 transitions. [2022-07-13 11:28:50,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:28:50,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-13 11:28:50,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:28:50,589 INFO L225 Difference]: With dead ends: 768 [2022-07-13 11:28:50,589 INFO L226 Difference]: Without dead ends: 748 [2022-07-13 11:28:50,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:28:50,590 INFO L413 NwaCegarLoop]: 657 mSDtfsCounter, 628 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:28:50,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 721 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:28:50,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2022-07-13 11:28:50,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 711. [2022-07-13 11:28:50,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 586 states have (on average 1.418088737201365) internal successors, (831), 592 states have internal predecessors, (831), 89 states have call successors, (89), 29 states have call predecessors, (89), 35 states have return successors, (104), 89 states have call predecessors, (104), 82 states have call successors, (104) [2022-07-13 11:28:50,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1024 transitions. [2022-07-13 11:28:50,619 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1024 transitions. Word has length 29 [2022-07-13 11:28:50,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:28:50,619 INFO L495 AbstractCegarLoop]: Abstraction has 711 states and 1024 transitions. [2022-07-13 11:28:50,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:28:50,620 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1024 transitions. [2022-07-13 11:28:50,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-13 11:28:50,622 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:28:50,622 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:28:50,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 11:28:50,622 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:28:50,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:28:50,623 INFO L85 PathProgramCache]: Analyzing trace with hash -881374565, now seen corresponding path program 1 times [2022-07-13 11:28:50,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:28:50,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132075131] [2022-07-13 11:28:50,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:28:50,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:28:50,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:50,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 11:28:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:50,656 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:28:50,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:28:50,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132075131] [2022-07-13 11:28:50,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132075131] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:28:50,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:28:50,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:28:50,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740101860] [2022-07-13 11:28:50,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:28:50,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:28:50,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:28:50,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:28:50,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:28:50,658 INFO L87 Difference]: Start difference. First operand 711 states and 1024 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (4), 4 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:28:50,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:28:50,891 INFO L93 Difference]: Finished difference Result 1007 states and 1455 transitions. [2022-07-13 11:28:50,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 11:28:50,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (4), 4 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 35 [2022-07-13 11:28:50,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:28:50,895 INFO L225 Difference]: With dead ends: 1007 [2022-07-13 11:28:50,896 INFO L226 Difference]: Without dead ends: 780 [2022-07-13 11:28:50,896 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:28:50,897 INFO L413 NwaCegarLoop]: 732 mSDtfsCounter, 254 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1782 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:28:50,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 1782 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:28:50,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2022-07-13 11:28:50,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 694. [2022-07-13 11:28:50,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 571 states have (on average 1.4133099824868651) internal successors, (807), 579 states have internal predecessors, (807), 88 states have call successors, (88), 28 states have call predecessors, (88), 34 states have return successors, (100), 86 states have call predecessors, (100), 81 states have call successors, (100) [2022-07-13 11:28:50,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 995 transitions. [2022-07-13 11:28:50,926 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 995 transitions. Word has length 35 [2022-07-13 11:28:50,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:28:50,927 INFO L495 AbstractCegarLoop]: Abstraction has 694 states and 995 transitions. [2022-07-13 11:28:50,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (4), 4 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:28:50,927 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 995 transitions. [2022-07-13 11:28:50,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-13 11:28:50,929 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:28:50,929 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] [2022-07-13 11:28:50,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 11:28:50,929 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:28:50,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:28:50,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1008894041, now seen corresponding path program 1 times [2022-07-13 11:28:50,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:28:50,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570951100] [2022-07-13 11:28:50,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:28:50,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:28:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:50,960 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:28:50,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:28:50,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570951100] [2022-07-13 11:28:50,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570951100] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:28:50,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:28:50,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:28:50,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042803644] [2022-07-13 11:28:50,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:28:50,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:28:50,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:28:50,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:28:50,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:28:50,963 INFO L87 Difference]: Start difference. First operand 694 states and 995 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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:28:51,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:28:51,245 INFO L93 Difference]: Finished difference Result 754 states and 1071 transitions. [2022-07-13 11:28:51,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:28:51,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 32 [2022-07-13 11:28:51,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:28:51,249 INFO L225 Difference]: With dead ends: 754 [2022-07-13 11:28:51,249 INFO L226 Difference]: Without dead ends: 712 [2022-07-13 11:28:51,250 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:28:51,250 INFO L413 NwaCegarLoop]: 647 mSDtfsCounter, 696 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:28:51,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 1109 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:28:51,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2022-07-13 11:28:51,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 694. [2022-07-13 11:28:51,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 571 states have (on average 1.4098073555166375) internal successors, (805), 579 states have internal predecessors, (805), 88 states have call successors, (88), 28 states have call predecessors, (88), 34 states have return successors, (100), 86 states have call predecessors, (100), 81 states have call successors, (100) [2022-07-13 11:28:51,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 993 transitions. [2022-07-13 11:28:51,282 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 993 transitions. Word has length 32 [2022-07-13 11:28:51,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:28:51,283 INFO L495 AbstractCegarLoop]: Abstraction has 694 states and 993 transitions. [2022-07-13 11:28:51,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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:28:51,284 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 993 transitions. [2022-07-13 11:28:51,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 11:28:51,286 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:28:51,286 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:28:51,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 11:28:51,287 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:28:51,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:28:51,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1219758973, now seen corresponding path program 1 times [2022-07-13 11:28:51,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:28:51,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218234824] [2022-07-13 11:28:51,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:28:51,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:28:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:51,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 11:28:51,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:51,330 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:28:51,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:28:51,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218234824] [2022-07-13 11:28:51,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218234824] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:28:51,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:28:51,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:28:51,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237230468] [2022-07-13 11:28:51,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:28:51,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:28:51,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:28:51,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:28:51,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:28:51,332 INFO L87 Difference]: Start difference. First operand 694 states and 993 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:28:51,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:28:51,550 INFO L93 Difference]: Finished difference Result 779 states and 1121 transitions. [2022-07-13 11:28:51,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 11:28:51,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-07-13 11:28:51,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:28:51,554 INFO L225 Difference]: With dead ends: 779 [2022-07-13 11:28:51,554 INFO L226 Difference]: Without dead ends: 719 [2022-07-13 11:28:51,555 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:28:51,555 INFO L413 NwaCegarLoop]: 653 mSDtfsCounter, 706 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:28:51,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 1259 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:28:51,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2022-07-13 11:28:51,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 683. [2022-07-13 11:28:51,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 564 states have (on average 1.4113475177304964) internal successors, (796), 572 states have internal predecessors, (796), 86 states have call successors, (86), 26 states have call predecessors, (86), 32 states have return successors, (98), 84 states have call predecessors, (98), 79 states have call successors, (98) [2022-07-13 11:28:51,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 980 transitions. [2022-07-13 11:28:51,584 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 980 transitions. Word has length 36 [2022-07-13 11:28:51,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:28:51,584 INFO L495 AbstractCegarLoop]: Abstraction has 683 states and 980 transitions. [2022-07-13 11:28:51,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:28:51,585 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 980 transitions. [2022-07-13 11:28:51,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-13 11:28:51,586 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:28:51,587 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:28:51,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 11:28:51,587 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:28:51,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:28:51,588 INFO L85 PathProgramCache]: Analyzing trace with hash 138802018, now seen corresponding path program 1 times [2022-07-13 11:28:51,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:28:51,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921721403] [2022-07-13 11:28:51,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:28:51,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:28:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:51,615 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:28:51,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:28:51,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921721403] [2022-07-13 11:28:51,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921721403] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:28:51,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:28:51,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:28:51,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727266779] [2022-07-13 11:28:51,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:28:51,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:28:51,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:28:51,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:28:51,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:28:51,617 INFO L87 Difference]: Start difference. First operand 683 states and 980 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 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:28:51,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:28:51,707 INFO L93 Difference]: Finished difference Result 851 states and 1212 transitions. [2022-07-13 11:28:51,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:28:51,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:28:51,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:28:51,711 INFO L225 Difference]: With dead ends: 851 [2022-07-13 11:28:51,711 INFO L226 Difference]: Without dead ends: 835 [2022-07-13 11:28:51,712 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:28:51,712 INFO L413 NwaCegarLoop]: 772 mSDtfsCounter, 135 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1388 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:28:51,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1388 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:28:51,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2022-07-13 11:28:51,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 734. [2022-07-13 11:28:51,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 611 states have (on average 1.386252045826514) internal successors, (847), 612 states have internal predecessors, (847), 86 states have call successors, (86), 26 states have call predecessors, (86), 36 states have return successors, (109), 95 states have call predecessors, (109), 79 states have call successors, (109) [2022-07-13 11:28:51,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1042 transitions. [2022-07-13 11:28:51,746 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1042 transitions. Word has length 34 [2022-07-13 11:28:51,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:28:51,747 INFO L495 AbstractCegarLoop]: Abstraction has 734 states and 1042 transitions. [2022-07-13 11:28:51,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 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:28:51,747 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1042 transitions. [2022-07-13 11:28:51,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-13 11:28:51,749 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:28:51,749 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:28:51,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 11:28:51,749 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:28:51,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:28:51,750 INFO L85 PathProgramCache]: Analyzing trace with hash -298326112, now seen corresponding path program 1 times [2022-07-13 11:28:51,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:28:51,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485904281] [2022-07-13 11:28:51,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:28:51,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:28:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:51,793 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:28:51,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:28:51,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485904281] [2022-07-13 11:28:51,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485904281] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:28:51,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:28:51,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:28:51,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894581356] [2022-07-13 11:28:51,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:28:51,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:28:51,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:28:51,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:28:51,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:28:51,796 INFO L87 Difference]: Start difference. First operand 734 states and 1042 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:28:52,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:28:52,037 INFO L93 Difference]: Finished difference Result 762 states and 1073 transitions. [2022-07-13 11:28:52,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:28:52,037 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:28:52,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:28:52,041 INFO L225 Difference]: With dead ends: 762 [2022-07-13 11:28:52,041 INFO L226 Difference]: Without dead ends: 715 [2022-07-13 11:28:52,042 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:28:52,042 INFO L413 NwaCegarLoop]: 643 mSDtfsCounter, 674 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:28:52,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 1105 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:28:52,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2022-07-13 11:28:52,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 705. [2022-07-13 11:28:52,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 585 states have (on average 1.3914529914529914) internal successors, (814), 592 states have internal predecessors, (814), 86 states have call successors, (86), 26 states have call predecessors, (86), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-07-13 11:28:52,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 998 transitions. [2022-07-13 11:28:52,076 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 998 transitions. Word has length 34 [2022-07-13 11:28:52,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:28:52,076 INFO L495 AbstractCegarLoop]: Abstraction has 705 states and 998 transitions. [2022-07-13 11:28:52,077 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:28:52,077 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 998 transitions. [2022-07-13 11:28:52,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-13 11:28:52,078 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:28:52,079 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:28:52,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 11:28:52,079 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:28:52,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:28:52,080 INFO L85 PathProgramCache]: Analyzing trace with hash 452395620, now seen corresponding path program 1 times [2022-07-13 11:28:52,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:28:52,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55118390] [2022-07-13 11:28:52,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:28:52,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:28:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:52,135 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:28:52,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:28:52,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55118390] [2022-07-13 11:28:52,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55118390] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:28:52,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:28:52,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:28:52,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069337830] [2022-07-13 11:28:52,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:28:52,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:28:52,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:28:52,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:28:52,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:28:52,138 INFO L87 Difference]: Start difference. First operand 705 states and 998 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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:28:52,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:28:52,427 INFO L93 Difference]: Finished difference Result 806 states and 1144 transitions. [2022-07-13 11:28:52,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:28:52,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 35 [2022-07-13 11:28:52,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:28:52,431 INFO L225 Difference]: With dead ends: 806 [2022-07-13 11:28:52,431 INFO L226 Difference]: Without dead ends: 802 [2022-07-13 11:28:52,432 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:28:52,432 INFO L413 NwaCegarLoop]: 726 mSDtfsCounter, 759 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:28:52,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 1184 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:28:52,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-07-13 11:28:52,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 708. [2022-07-13 11:28:52,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 588 states have (on average 1.3911564625850341) internal successors, (818), 595 states have internal predecessors, (818), 86 states have call successors, (86), 26 states have call predecessors, (86), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-07-13 11:28:52,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1002 transitions. [2022-07-13 11:28:52,476 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1002 transitions. Word has length 35 [2022-07-13 11:28:52,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:28:52,477 INFO L495 AbstractCegarLoop]: Abstraction has 708 states and 1002 transitions. [2022-07-13 11:28:52,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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:28:52,478 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1002 transitions. [2022-07-13 11:28:52,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-13 11:28:52,479 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:28:52,480 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:28:52,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 11:28:52,480 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:28:52,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:28:52,481 INFO L85 PathProgramCache]: Analyzing trace with hash 452672450, now seen corresponding path program 1 times [2022-07-13 11:28:52,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:28:52,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695747975] [2022-07-13 11:28:52,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:28:52,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:28:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:52,522 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:28:52,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:28:52,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695747975] [2022-07-13 11:28:52,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695747975] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:28:52,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:28:52,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 11:28:52,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037091405] [2022-07-13 11:28:52,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:28:52,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:28:52,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:28:52,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:28:52,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:28:52,525 INFO L87 Difference]: Start difference. First operand 708 states and 1002 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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:28:52,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:28:52,615 INFO L93 Difference]: Finished difference Result 721 states and 1015 transitions. [2022-07-13 11:28:52,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:28:52,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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 35 [2022-07-13 11:28:52,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:28:52,619 INFO L225 Difference]: With dead ends: 721 [2022-07-13 11:28:52,619 INFO L226 Difference]: Without dead ends: 691 [2022-07-13 11:28:52,620 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:28:52,621 INFO L413 NwaCegarLoop]: 651 mSDtfsCounter, 38 mSDsluCounter, 2556 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 3207 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:28:52,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 3207 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:28:52,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2022-07-13 11:28:52,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 691. [2022-07-13 11:28:52,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 571 states have (on average 1.3975481611208407) internal successors, (798), 578 states have internal predecessors, (798), 86 states have call successors, (86), 26 states have call predecessors, (86), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-07-13 11:28:52,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 982 transitions. [2022-07-13 11:28:52,663 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 982 transitions. Word has length 35 [2022-07-13 11:28:52,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:28:52,663 INFO L495 AbstractCegarLoop]: Abstraction has 691 states and 982 transitions. [2022-07-13 11:28:52,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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:28:52,663 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 982 transitions. [2022-07-13 11:28:52,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-13 11:28:52,665 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:28:52,665 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:28:52,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 11:28:52,665 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:28:52,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:28:52,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1417116411, now seen corresponding path program 1 times [2022-07-13 11:28:52,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:28:52,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177981079] [2022-07-13 11:28:52,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:28:52,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:28:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:52,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 11:28:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:52,695 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:28:52,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:28:52,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177981079] [2022-07-13 11:28:52,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177981079] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:28:52,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:28:52,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:28:52,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95232560] [2022-07-13 11:28:52,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:28:52,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:28:52,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:28:52,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:28:52,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:28:52,697 INFO L87 Difference]: Start difference. First operand 691 states and 982 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:28:52,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:28:52,935 INFO L93 Difference]: Finished difference Result 732 states and 1051 transitions. [2022-07-13 11:28:52,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 11:28:52,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-07-13 11:28:52,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:28:52,939 INFO L225 Difference]: With dead ends: 732 [2022-07-13 11:28:52,939 INFO L226 Difference]: Without dead ends: 725 [2022-07-13 11:28:52,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:28:52,940 INFO L413 NwaCegarLoop]: 628 mSDtfsCounter, 153 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1553 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:28:52,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 1553 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:28:52,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2022-07-13 11:28:52,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 705. [2022-07-13 11:28:52,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 585 states have (on average 1.393162393162393) internal successors, (815), 592 states have internal predecessors, (815), 86 states have call successors, (86), 26 states have call predecessors, (86), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-07-13 11:28:52,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 999 transitions. [2022-07-13 11:28:52,979 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 999 transitions. Word has length 37 [2022-07-13 11:28:52,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:28:52,980 INFO L495 AbstractCegarLoop]: Abstraction has 705 states and 999 transitions. [2022-07-13 11:28:52,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:28:52,980 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 999 transitions. [2022-07-13 11:28:52,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-13 11:28:52,982 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:28:52,982 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:28:52,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 11:28:52,982 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:28:52,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:28:52,983 INFO L85 PathProgramCache]: Analyzing trace with hash 607738208, now seen corresponding path program 1 times [2022-07-13 11:28:52,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:28:52,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150815841] [2022-07-13 11:28:52,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:28:52,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:28:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:53,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 11:28:53,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:53,063 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:28:53,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:28:53,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150815841] [2022-07-13 11:28:53,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150815841] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:28:53,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:28:53,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 11:28:53,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732740648] [2022-07-13 11:28:53,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:28:53,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:28:53,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:28:53,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:28:53,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:28:53,066 INFO L87 Difference]: Start difference. First operand 705 states and 999 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:28:53,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:28:53,489 INFO L93 Difference]: Finished difference Result 731 states and 1047 transitions. [2022-07-13 11:28:53,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 11:28:53,490 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-07-13 11:28:53,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:28:53,493 INFO L225 Difference]: With dead ends: 731 [2022-07-13 11:28:53,494 INFO L226 Difference]: Without dead ends: 725 [2022-07-13 11:28:53,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:28:53,495 INFO L413 NwaCegarLoop]: 622 mSDtfsCounter, 750 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 1884 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:28:53,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 1884 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 11:28:53,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2022-07-13 11:28:53,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 705. [2022-07-13 11:28:53,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 585 states have (on average 1.3914529914529914) internal successors, (814), 592 states have internal predecessors, (814), 86 states have call successors, (86), 26 states have call predecessors, (86), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-07-13 11:28:53,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 998 transitions. [2022-07-13 11:28:53,538 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 998 transitions. Word has length 39 [2022-07-13 11:28:53,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:28:53,538 INFO L495 AbstractCegarLoop]: Abstraction has 705 states and 998 transitions. [2022-07-13 11:28:53,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:28:53,539 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 998 transitions. [2022-07-13 11:28:53,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-13 11:28:53,540 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:28:53,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, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:28:53,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 11:28:53,541 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:28:53,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:28:53,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1973073460, now seen corresponding path program 1 times [2022-07-13 11:28:53,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:28:53,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592981075] [2022-07-13 11:28:53,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:28:53,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:28:53,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:53,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 11:28:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:53,605 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:28:53,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:28:53,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592981075] [2022-07-13 11:28:53,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592981075] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:28:53,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:28:53,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 11:28:53,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967711987] [2022-07-13 11:28:53,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:28:53,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 11:28:53,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:28:53,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 11:28:53,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:28:53,608 INFO L87 Difference]: Start difference. First operand 705 states and 998 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:28:53,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:28:53,972 INFO L93 Difference]: Finished difference Result 744 states and 1063 transitions. [2022-07-13 11:28:53,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 11:28:53,972 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-07-13 11:28:53,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:28:53,978 INFO L225 Difference]: With dead ends: 744 [2022-07-13 11:28:53,978 INFO L226 Difference]: Without dead ends: 712 [2022-07-13 11:28:53,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-07-13 11:28:53,979 INFO L413 NwaCegarLoop]: 621 mSDtfsCounter, 158 mSDsluCounter, 3356 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 3977 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:28:53,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 3977 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:28:53,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2022-07-13 11:28:54,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 696. [2022-07-13 11:28:54,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 578 states have (on average 1.3737024221453287) internal successors, (794), 585 states have internal predecessors, (794), 84 states have call successors, (84), 26 states have call predecessors, (84), 33 states have return successors, (96), 84 states have call predecessors, (96), 77 states have call successors, (96) [2022-07-13 11:28:54,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 974 transitions. [2022-07-13 11:28:54,028 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 974 transitions. Word has length 40 [2022-07-13 11:28:54,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:28:54,029 INFO L495 AbstractCegarLoop]: Abstraction has 696 states and 974 transitions. [2022-07-13 11:28:54,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:28:54,029 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 974 transitions. [2022-07-13 11:28:54,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-13 11:28:54,031 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:28:54,032 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:28:54,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 11:28:54,033 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:28:54,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:28:54,033 INFO L85 PathProgramCache]: Analyzing trace with hash -577176493, now seen corresponding path program 1 times [2022-07-13 11:28:54,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:28:54,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308861280] [2022-07-13 11:28:54,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:28:54,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:28:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:54,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 11:28:54,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:54,070 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:28:54,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:28:54,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308861280] [2022-07-13 11:28:54,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308861280] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:28:54,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:28:54,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:28:54,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466488597] [2022-07-13 11:28:54,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:28:54,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:28:54,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:28:54,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:28:54,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:28:54,073 INFO L87 Difference]: Start difference. First operand 696 states and 974 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:28:54,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:28:54,518 INFO L93 Difference]: Finished difference Result 777 states and 1087 transitions. [2022-07-13 11:28:54,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:28:54,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-07-13 11:28:54,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:28:54,522 INFO L225 Difference]: With dead ends: 777 [2022-07-13 11:28:54,522 INFO L226 Difference]: Without dead ends: 741 [2022-07-13 11:28:54,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:28:54,523 INFO L413 NwaCegarLoop]: 663 mSDtfsCounter, 792 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:28:54,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 1517 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 11:28:54,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2022-07-13 11:28:54,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 696. [2022-07-13 11:28:54,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 578 states have (on average 1.3719723183391004) internal successors, (793), 585 states have internal predecessors, (793), 84 states have call successors, (84), 26 states have call predecessors, (84), 33 states have return successors, (96), 84 states have call predecessors, (96), 77 states have call successors, (96) [2022-07-13 11:28:54,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 973 transitions. [2022-07-13 11:28:54,563 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 973 transitions. Word has length 41 [2022-07-13 11:28:54,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:28:54,564 INFO L495 AbstractCegarLoop]: Abstraction has 696 states and 973 transitions. [2022-07-13 11:28:54,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:28:54,564 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 973 transitions. [2022-07-13 11:28:54,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-13 11:28:54,566 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:28:54,566 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:28:54,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 11:28:54,566 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:28:54,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:28:54,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1220210391, now seen corresponding path program 1 times [2022-07-13 11:28:54,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:28:54,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273868847] [2022-07-13 11:28:54,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:28:54,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:28:54,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:54,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 11:28:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:54,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 11:28:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:54,601 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:28:54,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:28:54,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273868847] [2022-07-13 11:28:54,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273868847] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:28:54,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:28:54,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:28:54,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189364127] [2022-07-13 11:28:54,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:28:54,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:28:54,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:28:54,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:28:54,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:28:54,603 INFO L87 Difference]: Start difference. First operand 696 states and 973 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 11:28:54,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:28:54,995 INFO L93 Difference]: Finished difference Result 906 states and 1276 transitions. [2022-07-13 11:28:54,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 11:28:54,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-07-13 11:28:54,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:28:54,999 INFO L225 Difference]: With dead ends: 906 [2022-07-13 11:28:54,999 INFO L226 Difference]: Without dead ends: 688 [2022-07-13 11:28:55,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:28:55,001 INFO L413 NwaCegarLoop]: 605 mSDtfsCounter, 252 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 1799 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:28:55,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 1799 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:28:55,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2022-07-13 11:28:55,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 672. [2022-07-13 11:28:55,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 557 states have (on average 1.3698384201077198) internal successors, (763), 563 states have internal predecessors, (763), 83 states have call successors, (83), 26 states have call predecessors, (83), 31 states have return successors, (94), 82 states have call predecessors, (94), 77 states have call successors, (94) [2022-07-13 11:28:55,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 940 transitions. [2022-07-13 11:28:55,048 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 940 transitions. Word has length 43 [2022-07-13 11:28:55,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:28:55,049 INFO L495 AbstractCegarLoop]: Abstraction has 672 states and 940 transitions. [2022-07-13 11:28:55,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 11:28:55,049 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 940 transitions. [2022-07-13 11:28:55,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-13 11:28:55,051 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:28:55,051 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:28:55,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-13 11:28:55,052 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:28:55,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:28:55,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1828304678, now seen corresponding path program 1 times [2022-07-13 11:28:55,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:28:55,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277617315] [2022-07-13 11:28:55,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:28:55,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:28:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:55,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 11:28:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:55,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:28:55,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:55,179 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:28:55,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:28:55,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277617315] [2022-07-13 11:28:55,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277617315] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:28:55,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:28:55,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 11:28:55,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321977470] [2022-07-13 11:28:55,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:28:55,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 11:28:55,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:28:55,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 11:28:55,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-13 11:28:55,183 INFO L87 Difference]: Start difference. First operand 672 states and 940 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 7 states have internal predecessors, (38), 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:28:55,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:28:55,910 INFO L93 Difference]: Finished difference Result 702 states and 994 transitions. [2022-07-13 11:28:55,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 11:28:55,911 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 7 states have internal predecessors, (38), 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 43 [2022-07-13 11:28:55,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:28:55,916 INFO L225 Difference]: With dead ends: 702 [2022-07-13 11:28:55,916 INFO L226 Difference]: Without dead ends: 686 [2022-07-13 11:28:55,917 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:28:55,919 INFO L413 NwaCegarLoop]: 611 mSDtfsCounter, 98 mSDsluCounter, 3850 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 4461 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 11:28:55,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 4461 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 11:28:55,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2022-07-13 11:28:55,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 670. [2022-07-13 11:28:55,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 556 states have (on average 1.368705035971223) internal successors, (761), 562 states have internal predecessors, (761), 82 states have call successors, (82), 26 states have call predecessors, (82), 31 states have return successors, (93), 81 states have call predecessors, (93), 76 states have call successors, (93) [2022-07-13 11:28:55,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 936 transitions. [2022-07-13 11:28:55,964 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 936 transitions. Word has length 43 [2022-07-13 11:28:55,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:28:55,964 INFO L495 AbstractCegarLoop]: Abstraction has 670 states and 936 transitions. [2022-07-13 11:28:55,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 7 states have internal predecessors, (38), 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:28:55,964 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 936 transitions. [2022-07-13 11:28:55,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-13 11:28:55,966 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:28:55,966 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:28:55,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-13 11:28:55,967 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:28:55,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:28:55,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1534576112, now seen corresponding path program 1 times [2022-07-13 11:28:55,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:28:55,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543582739] [2022-07-13 11:28:55,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:28:55,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:28:55,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:56,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 11:28:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:56,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:28:56,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:56,113 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:28:56,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:28:56,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543582739] [2022-07-13 11:28:56,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543582739] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:28:56,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:28:56,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-13 11:28:56,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349252729] [2022-07-13 11:28:56,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:28:56,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 11:28:56,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:28:56,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 11:28:56,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-13 11:28:56,116 INFO L87 Difference]: Start difference. First operand 670 states and 936 transitions. Second operand has 13 states, 12 states have (on average 3.5) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 11:28:56,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:28:56,954 INFO L93 Difference]: Finished difference Result 722 states and 1014 transitions. [2022-07-13 11:28:56,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 11:28:56,955 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 47 [2022-07-13 11:28:56,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:28:56,958 INFO L225 Difference]: With dead ends: 722 [2022-07-13 11:28:56,959 INFO L226 Difference]: Without dead ends: 702 [2022-07-13 11:28:56,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-07-13 11:28:56,960 INFO L413 NwaCegarLoop]: 597 mSDtfsCounter, 247 mSDsluCounter, 4106 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 4703 SdHoareTripleChecker+Invalid, 1564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:28:56,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 4703 Invalid, 1564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 1397 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 11:28:56,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2022-07-13 11:28:56,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 668. [2022-07-13 11:28:56,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 555 states have (on average 1.3675675675675676) internal successors, (759), 561 states have internal predecessors, (759), 81 states have call successors, (81), 26 states have call predecessors, (81), 31 states have return successors, (92), 80 states have call predecessors, (92), 75 states have call successors, (92) [2022-07-13 11:28:57,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 932 transitions. [2022-07-13 11:28:57,000 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 932 transitions. Word has length 47 [2022-07-13 11:28:57,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:28:57,000 INFO L495 AbstractCegarLoop]: Abstraction has 668 states and 932 transitions. [2022-07-13 11:28:57,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 11:28:57,001 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 932 transitions. [2022-07-13 11:28:57,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 11:28:57,002 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:28:57,003 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:28:57,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-13 11:28:57,003 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:28:57,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:28:57,003 INFO L85 PathProgramCache]: Analyzing trace with hash 397890919, now seen corresponding path program 1 times [2022-07-13 11:28:57,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:28:57,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278043293] [2022-07-13 11:28:57,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:28:57,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:28:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:57,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 11:28:57,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:57,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:28:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:57,143 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:28:57,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:28:57,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278043293] [2022-07-13 11:28:57,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278043293] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:28:57,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:28:57,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-13 11:28:57,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983138514] [2022-07-13 11:28:57,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:28:57,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 11:28:57,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:28:57,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 11:28:57,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-13 11:28:57,146 INFO L87 Difference]: Start difference. First operand 668 states and 932 transitions. Second operand has 13 states, 12 states have (on average 3.25) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 11:28:58,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:28:58,060 INFO L93 Difference]: Finished difference Result 720 states and 1010 transitions. [2022-07-13 11:28:58,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 11:28:58,061 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-07-13 11:28:58,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:28:58,065 INFO L225 Difference]: With dead ends: 720 [2022-07-13 11:28:58,065 INFO L226 Difference]: Without dead ends: 699 [2022-07-13 11:28:58,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-07-13 11:28:58,071 INFO L413 NwaCegarLoop]: 581 mSDtfsCounter, 168 mSDsluCounter, 4915 mSDsCounter, 0 mSdLazyCounter, 1654 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 5496 SdHoareTripleChecker+Invalid, 1740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 11:28:58,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 5496 Invalid, 1740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1654 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 11:28:58,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-07-13 11:28:58,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 667. [2022-07-13 11:28:58,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 554 states have (on average 1.3501805054151625) internal successors, (748), 560 states have internal predecessors, (748), 81 states have call successors, (81), 26 states have call predecessors, (81), 31 states have return successors, (92), 80 states have call predecessors, (92), 75 states have call successors, (92) [2022-07-13 11:28:58,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 921 transitions. [2022-07-13 11:28:58,134 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 921 transitions. Word has length 44 [2022-07-13 11:28:58,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:28:58,134 INFO L495 AbstractCegarLoop]: Abstraction has 667 states and 921 transitions. [2022-07-13 11:28:58,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 11:28:58,134 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 921 transitions. [2022-07-13 11:28:58,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 11:28:58,140 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:28:58,140 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:28:58,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-13 11:28:58,141 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:28:58,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:28:58,141 INFO L85 PathProgramCache]: Analyzing trace with hash 117751789, now seen corresponding path program 1 times [2022-07-13 11:28:58,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:28:58,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206124523] [2022-07-13 11:28:58,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:28:58,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:28:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:58,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 11:28:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:58,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:28:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:58,273 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:28:58,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:28:58,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206124523] [2022-07-13 11:28:58,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206124523] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:28:58,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:28:58,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 11:28:58,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121203503] [2022-07-13 11:28:58,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:28:58,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 11:28:58,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:28:58,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 11:28:58,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-13 11:28:58,276 INFO L87 Difference]: Start difference. First operand 667 states and 921 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 7 states have internal predecessors, (39), 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:28:58,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:28:58,880 INFO L93 Difference]: Finished difference Result 696 states and 974 transitions. [2022-07-13 11:28:58,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 11:28:58,880 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 7 states have internal predecessors, (39), 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 44 [2022-07-13 11:28:58,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:28:58,884 INFO L225 Difference]: With dead ends: 696 [2022-07-13 11:28:58,884 INFO L226 Difference]: Without dead ends: 680 [2022-07-13 11:28:58,885 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:28:58,886 INFO L413 NwaCegarLoop]: 589 mSDtfsCounter, 98 mSDsluCounter, 3693 mSDsCounter, 0 mSdLazyCounter, 1080 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 4282 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:28:58,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 4282 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1080 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 11:28:58,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2022-07-13 11:28:58,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 664. [2022-07-13 11:28:58,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 552 states have (on average 1.3496376811594204) internal successors, (745), 558 states have internal predecessors, (745), 80 states have call successors, (80), 26 states have call predecessors, (80), 31 states have return successors, (91), 79 states have call predecessors, (91), 74 states have call successors, (91) [2022-07-13 11:28:58,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 916 transitions. [2022-07-13 11:28:58,936 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 916 transitions. Word has length 44 [2022-07-13 11:28:58,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:28:58,937 INFO L495 AbstractCegarLoop]: Abstraction has 664 states and 916 transitions. [2022-07-13 11:28:58,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 7 states have internal predecessors, (39), 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:28:58,937 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 916 transitions. [2022-07-13 11:28:58,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 11:28:58,939 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:28:58,939 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:28:58,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-13 11:28:58,939 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:28:58,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:28:58,940 INFO L85 PathProgramCache]: Analyzing trace with hash -914670889, now seen corresponding path program 1 times [2022-07-13 11:28:58,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:28:58,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936476866] [2022-07-13 11:28:58,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:28:58,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:28:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:58,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 11:28:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:59,001 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:28:59,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:28:59,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936476866] [2022-07-13 11:28:59,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936476866] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:28:59,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:28:59,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 11:28:59,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613792978] [2022-07-13 11:28:59,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:28:59,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 11:28:59,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:28:59,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 11:28:59,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:28:59,003 INFO L87 Difference]: Start difference. First operand 664 states and 916 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:28:59,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:28:59,350 INFO L93 Difference]: Finished difference Result 735 states and 1013 transitions. [2022-07-13 11:28:59,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 11:28:59,351 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-07-13 11:28:59,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:28:59,354 INFO L225 Difference]: With dead ends: 735 [2022-07-13 11:28:59,354 INFO L226 Difference]: Without dead ends: 668 [2022-07-13 11:28:59,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2022-07-13 11:28:59,355 INFO L413 NwaCegarLoop]: 585 mSDtfsCounter, 235 mSDsluCounter, 3099 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 3684 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:28:59,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 3684 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:28:59,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2022-07-13 11:28:59,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 652. [2022-07-13 11:28:59,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 543 states have (on average 1.3443830570902393) internal successors, (730), 549 states have internal predecessors, (730), 77 states have call successors, (77), 26 states have call predecessors, (77), 31 states have return successors, (88), 76 states have call predecessors, (88), 71 states have call successors, (88) [2022-07-13 11:28:59,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 895 transitions. [2022-07-13 11:28:59,395 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 895 transitions. Word has length 44 [2022-07-13 11:28:59,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:28:59,395 INFO L495 AbstractCegarLoop]: Abstraction has 652 states and 895 transitions. [2022-07-13 11:28:59,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:28:59,395 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 895 transitions. [2022-07-13 11:28:59,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 11:28:59,397 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:28:59,397 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:28:59,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-13 11:28:59,398 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:28:59,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:28:59,398 INFO L85 PathProgramCache]: Analyzing trace with hash -501722536, now seen corresponding path program 1 times [2022-07-13 11:28:59,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:28:59,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898360356] [2022-07-13 11:28:59,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:28:59,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:28:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:59,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 11:28:59,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:59,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 11:28:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:59,438 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:28:59,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:28:59,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898360356] [2022-07-13 11:28:59,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898360356] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:28:59,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:28:59,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 11:28:59,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576641256] [2022-07-13 11:28:59,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:28:59,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:28:59,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:28:59,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:28:59,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:28:59,442 INFO L87 Difference]: Start difference. First operand 652 states and 895 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 11:28:59,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:28:59,825 INFO L93 Difference]: Finished difference Result 797 states and 1137 transitions. [2022-07-13 11:28:59,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 11:28:59,825 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-07-13 11:28:59,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:28:59,831 INFO L225 Difference]: With dead ends: 797 [2022-07-13 11:28:59,831 INFO L226 Difference]: Without dead ends: 703 [2022-07-13 11:28:59,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:28:59,834 INFO L413 NwaCegarLoop]: 540 mSDtfsCounter, 130 mSDsluCounter, 1669 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 2209 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:28:59,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 2209 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:28:59,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2022-07-13 11:28:59,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 659. [2022-07-13 11:28:59,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 548 states have (on average 1.344890510948905) internal successors, (737), 555 states have internal predecessors, (737), 78 states have call successors, (78), 26 states have call predecessors, (78), 32 states have return successors, (95), 77 states have call predecessors, (95), 72 states have call successors, (95) [2022-07-13 11:28:59,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 910 transitions. [2022-07-13 11:28:59,877 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 910 transitions. Word has length 45 [2022-07-13 11:28:59,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:28:59,878 INFO L495 AbstractCegarLoop]: Abstraction has 659 states and 910 transitions. [2022-07-13 11:28:59,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 11:28:59,878 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 910 transitions. [2022-07-13 11:28:59,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 11:28:59,880 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:28:59,880 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:28:59,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-13 11:28:59,881 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:28:59,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:28:59,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1011195626, now seen corresponding path program 1 times [2022-07-13 11:28:59,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:28:59,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994236983] [2022-07-13 11:28:59,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:28:59,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:28:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:59,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 11:28:59,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:59,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 11:28:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:28:59,941 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:28:59,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:28:59,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994236983] [2022-07-13 11:28:59,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994236983] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:28:59,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:28:59,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 11:28:59,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759137493] [2022-07-13 11:28:59,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:28:59,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 11:28:59,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:28:59,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 11:28:59,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:28:59,943 INFO L87 Difference]: Start difference. First operand 659 states and 910 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 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:29:00,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:00,345 INFO L93 Difference]: Finished difference Result 697 states and 978 transitions. [2022-07-13 11:29:00,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 11:29:00,345 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 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 45 [2022-07-13 11:29:00,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:00,349 INFO L225 Difference]: With dead ends: 697 [2022-07-13 11:29:00,349 INFO L226 Difference]: Without dead ends: 677 [2022-07-13 11:29:00,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-07-13 11:29:00,350 INFO L413 NwaCegarLoop]: 553 mSDtfsCounter, 245 mSDsluCounter, 2872 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 3425 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:00,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 3425 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:29:00,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2022-07-13 11:29:00,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 657. [2022-07-13 11:29:00,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 547 states have (on average 1.3436928702010968) internal successors, (735), 554 states have internal predecessors, (735), 77 states have call successors, (77), 26 states have call predecessors, (77), 32 states have return successors, (94), 76 states have call predecessors, (94), 71 states have call successors, (94) [2022-07-13 11:29:00,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 906 transitions. [2022-07-13 11:29:00,396 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 906 transitions. Word has length 45 [2022-07-13 11:29:00,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:00,396 INFO L495 AbstractCegarLoop]: Abstraction has 657 states and 906 transitions. [2022-07-13 11:29:00,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 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:29:00,397 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 906 transitions. [2022-07-13 11:29:00,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 11:29:00,399 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:00,399 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:29:00,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-13 11:29:00,399 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:00,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:00,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1504244121, now seen corresponding path program 1 times [2022-07-13 11:29:00,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:00,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497355352] [2022-07-13 11:29:00,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:00,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:00,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:00,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 11:29:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:00,450 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:29:00,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:00,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497355352] [2022-07-13 11:29:00,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497355352] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:00,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:00,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 11:29:00,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679971891] [2022-07-13 11:29:00,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:00,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 11:29:00,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:00,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 11:29:00,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:29:00,453 INFO L87 Difference]: Start difference. First operand 657 states and 906 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:29:00,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:00,752 INFO L93 Difference]: Finished difference Result 704 states and 988 transitions. [2022-07-13 11:29:00,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 11:29:00,753 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-07-13 11:29:00,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:00,755 INFO L225 Difference]: With dead ends: 704 [2022-07-13 11:29:00,756 INFO L226 Difference]: Without dead ends: 669 [2022-07-13 11:29:00,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-07-13 11:29:00,757 INFO L413 NwaCegarLoop]: 553 mSDtfsCounter, 166 mSDsluCounter, 2979 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 3532 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:00,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 3532 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:29:00,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-07-13 11:29:00,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 649. [2022-07-13 11:29:00,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 541 states have (on average 1.3364140480591498) internal successors, (723), 548 states have internal predecessors, (723), 75 states have call successors, (75), 26 states have call predecessors, (75), 32 states have return successors, (92), 74 states have call predecessors, (92), 69 states have call successors, (92) [2022-07-13 11:29:00,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 890 transitions. [2022-07-13 11:29:00,794 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 890 transitions. Word has length 45 [2022-07-13 11:29:00,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:00,795 INFO L495 AbstractCegarLoop]: Abstraction has 649 states and 890 transitions. [2022-07-13 11:29:00,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:29:00,795 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 890 transitions. [2022-07-13 11:29:00,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-13 11:29:00,797 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:00,797 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:29:00,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-13 11:29:00,797 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:00,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:00,798 INFO L85 PathProgramCache]: Analyzing trace with hash -945301524, now seen corresponding path program 1 times [2022-07-13 11:29:00,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:00,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357396761] [2022-07-13 11:29:00,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:00,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:00,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 11:29:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:00,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:00,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:00,922 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:29:00,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:00,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357396761] [2022-07-13 11:29:00,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357396761] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:00,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:00,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 11:29:00,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445846898] [2022-07-13 11:29:00,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:00,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:29:00,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:00,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:29:00,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:29:00,925 INFO L87 Difference]: Start difference. First operand 649 states and 890 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 8 states have internal predecessors, (41), 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:29:01,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:01,596 INFO L93 Difference]: Finished difference Result 684 states and 955 transitions. [2022-07-13 11:29:01,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 11:29:01,596 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 8 states have internal predecessors, (41), 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 46 [2022-07-13 11:29:01,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:01,599 INFO L225 Difference]: With dead ends: 684 [2022-07-13 11:29:01,599 INFO L226 Difference]: Without dead ends: 666 [2022-07-13 11:29:01,600 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:29:01,600 INFO L413 NwaCegarLoop]: 544 mSDtfsCounter, 110 mSDsluCounter, 3773 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 4317 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:01,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 4317 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 11:29:01,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2022-07-13 11:29:01,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 646. [2022-07-13 11:29:01,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 539 states have (on average 1.3358070500927643) internal successors, (720), 546 states have internal predecessors, (720), 74 states have call successors, (74), 26 states have call predecessors, (74), 32 states have return successors, (91), 73 states have call predecessors, (91), 68 states have call successors, (91) [2022-07-13 11:29:01,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 885 transitions. [2022-07-13 11:29:01,636 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 885 transitions. Word has length 46 [2022-07-13 11:29:01,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:01,636 INFO L495 AbstractCegarLoop]: Abstraction has 646 states and 885 transitions. [2022-07-13 11:29:01,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 8 states have internal predecessors, (41), 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:29:01,637 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 885 transitions. [2022-07-13 11:29:01,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-13 11:29:01,639 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:01,639 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:29:01,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-13 11:29:01,639 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:01,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:01,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1146484836, now seen corresponding path program 1 times [2022-07-13 11:29:01,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:01,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796304532] [2022-07-13 11:29:01,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:01,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:01,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 11:29:01,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:01,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-13 11:29:01,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:01,685 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:29:01,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:01,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796304532] [2022-07-13 11:29:01,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796304532] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:01,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:01,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 11:29:01,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499643743] [2022-07-13 11:29:01,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:01,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 11:29:01,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:01,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 11:29:01,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:29:01,688 INFO L87 Difference]: Start difference. First operand 646 states and 885 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 11:29:02,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:02,008 INFO L93 Difference]: Finished difference Result 703 states and 992 transitions. [2022-07-13 11:29:02,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 11:29:02,008 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2022-07-13 11:29:02,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:02,012 INFO L225 Difference]: With dead ends: 703 [2022-07-13 11:29:02,012 INFO L226 Difference]: Without dead ends: 676 [2022-07-13 11:29:02,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:29:02,013 INFO L413 NwaCegarLoop]: 532 mSDtfsCounter, 102 mSDsluCounter, 2116 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 2648 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:02,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 2648 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:29:02,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-07-13 11:29:02,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 650. [2022-07-13 11:29:02,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 541 states have (on average 1.33456561922366) internal successors, (722), 550 states have internal predecessors, (722), 74 states have call successors, (74), 26 states have call predecessors, (74), 34 states have return successors, (107), 73 states have call predecessors, (107), 68 states have call successors, (107) [2022-07-13 11:29:02,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 903 transitions. [2022-07-13 11:29:02,057 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 903 transitions. Word has length 46 [2022-07-13 11:29:02,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:02,057 INFO L495 AbstractCegarLoop]: Abstraction has 650 states and 903 transitions. [2022-07-13 11:29:02,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 11:29:02,058 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 903 transitions. [2022-07-13 11:29:02,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-13 11:29:02,060 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:02,060 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:29:02,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-13 11:29:02,060 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:02,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:02,061 INFO L85 PathProgramCache]: Analyzing trace with hash -876237255, now seen corresponding path program 1 times [2022-07-13 11:29:02,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:02,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250998552] [2022-07-13 11:29:02,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:02,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:02,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 11:29:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:02,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:02,206 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:29:02,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:02,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250998552] [2022-07-13 11:29:02,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250998552] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:02,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:02,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-13 11:29:02,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553552017] [2022-07-13 11:29:02,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:02,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 11:29:02,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:02,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 11:29:02,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-13 11:29:02,209 INFO L87 Difference]: Start difference. First operand 650 states and 903 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 9 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:29:03,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:03,003 INFO L93 Difference]: Finished difference Result 685 states and 968 transitions. [2022-07-13 11:29:03,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 11:29:03,004 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 9 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:29:03,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:03,007 INFO L225 Difference]: With dead ends: 685 [2022-07-13 11:29:03,007 INFO L226 Difference]: Without dead ends: 667 [2022-07-13 11:29:03,008 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:29:03,008 INFO L413 NwaCegarLoop]: 538 mSDtfsCounter, 123 mSDsluCounter, 4152 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 4690 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:03,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 4690 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1348 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 11:29:03,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2022-07-13 11:29:03,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 647. [2022-07-13 11:29:03,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 539 states have (on average 1.3339517625231911) internal successors, (719), 548 states have internal predecessors, (719), 73 states have call successors, (73), 26 states have call predecessors, (73), 34 states have return successors, (106), 72 states have call predecessors, (106), 67 states have call successors, (106) [2022-07-13 11:29:03,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 898 transitions. [2022-07-13 11:29:03,062 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 898 transitions. Word has length 47 [2022-07-13 11:29:03,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:03,063 INFO L495 AbstractCegarLoop]: Abstraction has 647 states and 898 transitions. [2022-07-13 11:29:03,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 9 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:29:03,063 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 898 transitions. [2022-07-13 11:29:03,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-13 11:29:03,065 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:03,065 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:03,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-13 11:29:03,065 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:03,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:03,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1600404883, now seen corresponding path program 1 times [2022-07-13 11:29:03,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:03,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436602090] [2022-07-13 11:29:03,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:03,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:03,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:03,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 11:29:03,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:03,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 11:29:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:03,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 11:29:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:03,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 11:29:03,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:03,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:03,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:03,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436602090] [2022-07-13 11:29:03,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436602090] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:03,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:03,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 11:29:03,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470187758] [2022-07-13 11:29:03,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:03,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 11:29:03,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:03,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 11:29:03,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:29:03,128 INFO L87 Difference]: Start difference. First operand 647 states and 898 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-13 11:29:03,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:03,577 INFO L93 Difference]: Finished difference Result 1017 states and 1421 transitions. [2022-07-13 11:29:03,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 11:29:03,577 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 63 [2022-07-13 11:29:03,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:03,580 INFO L225 Difference]: With dead ends: 1017 [2022-07-13 11:29:03,580 INFO L226 Difference]: Without dead ends: 647 [2022-07-13 11:29:03,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-07-13 11:29:03,583 INFO L413 NwaCegarLoop]: 463 mSDtfsCounter, 862 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 1397 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:03,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 1397 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 11:29:03,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-07-13 11:29:03,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2022-07-13 11:29:03,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 539 states have (on average 1.3265306122448979) internal successors, (715), 548 states have internal predecessors, (715), 73 states have call successors, (73), 26 states have call predecessors, (73), 34 states have return successors, (101), 72 states have call predecessors, (101), 67 states have call successors, (101) [2022-07-13 11:29:03,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 889 transitions. [2022-07-13 11:29:03,619 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 889 transitions. Word has length 63 [2022-07-13 11:29:03,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:03,619 INFO L495 AbstractCegarLoop]: Abstraction has 647 states and 889 transitions. [2022-07-13 11:29:03,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-13 11:29:03,620 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 889 transitions. [2022-07-13 11:29:03,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-13 11:29:03,621 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:03,622 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:03,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-13 11:29:03,622 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:03,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:03,622 INFO L85 PathProgramCache]: Analyzing trace with hash -816949344, now seen corresponding path program 1 times [2022-07-13 11:29:03,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:03,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163728969] [2022-07-13 11:29:03,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:03,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:03,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-13 11:29:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:03,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 11:29:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:03,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 11:29:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:03,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 11:29:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:03,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:03,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:03,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163728969] [2022-07-13 11:29:03,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163728969] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:29:03,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067741871] [2022-07-13 11:29:03,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:03,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:29:03,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:29:03,707 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:29:03,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 11:29:03,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:03,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 11:29:03,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:29:04,185 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:04,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:29:04,296 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:04,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067741871] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 11:29:04,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:29:04,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 12 [2022-07-13 11:29:04,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882411120] [2022-07-13 11:29:04,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:04,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:29:04,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:04,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:29:04,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-13 11:29:04,298 INFO L87 Difference]: Start difference. First operand 647 states and 889 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:29:04,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:04,626 INFO L93 Difference]: Finished difference Result 935 states and 1273 transitions. [2022-07-13 11:29:04,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 11:29:04,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 64 [2022-07-13 11:29:04,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:04,630 INFO L225 Difference]: With dead ends: 935 [2022-07-13 11:29:04,630 INFO L226 Difference]: Without dead ends: 784 [2022-07-13 11:29:04,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 127 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-07-13 11:29:04,631 INFO L413 NwaCegarLoop]: 580 mSDtfsCounter, 658 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:04,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 1352 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:29:04,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2022-07-13 11:29:04,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 685. [2022-07-13 11:29:04,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 570 states have (on average 1.3263157894736841) internal successors, (756), 579 states have internal predecessors, (756), 76 states have call successors, (76), 28 states have call predecessors, (76), 38 states have return successors, (107), 77 states have call predecessors, (107), 70 states have call successors, (107) [2022-07-13 11:29:04,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 939 transitions. [2022-07-13 11:29:04,677 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 939 transitions. Word has length 64 [2022-07-13 11:29:04,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:04,678 INFO L495 AbstractCegarLoop]: Abstraction has 685 states and 939 transitions. [2022-07-13 11:29:04,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:29:04,678 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 939 transitions. [2022-07-13 11:29:04,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-13 11:29:04,680 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:04,680 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:29:04,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 11:29:04,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-07-13 11:29:04,895 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:04,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:04,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1640527845, now seen corresponding path program 1 times [2022-07-13 11:29:04,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:04,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73743045] [2022-07-13 11:29:04,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:04,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:04,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 11:29:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:04,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:04,992 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:29:04,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:04,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73743045] [2022-07-13 11:29:04,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73743045] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:04,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:04,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-13 11:29:04,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760282839] [2022-07-13 11:29:04,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:04,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 11:29:04,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:04,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 11:29:04,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-13 11:29:04,995 INFO L87 Difference]: Start difference. First operand 685 states and 939 transitions. Second operand has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 11:29:05,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:05,762 INFO L93 Difference]: Finished difference Result 703 states and 957 transitions. [2022-07-13 11:29:05,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 11:29:05,763 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2022-07-13 11:29:05,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:05,767 INFO L225 Difference]: With dead ends: 703 [2022-07-13 11:29:05,767 INFO L226 Difference]: Without dead ends: 683 [2022-07-13 11:29:05,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-07-13 11:29:05,768 INFO L413 NwaCegarLoop]: 499 mSDtfsCounter, 239 mSDsluCounter, 3755 mSDsCounter, 0 mSdLazyCounter, 1476 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 4254 SdHoareTripleChecker+Invalid, 1608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:05,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 4254 Invalid, 1608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1476 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 11:29:05,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2022-07-13 11:29:05,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 683. [2022-07-13 11:29:05,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 569 states have (on average 1.3251318101933216) internal successors, (754), 578 states have internal predecessors, (754), 75 states have call successors, (75), 28 states have call predecessors, (75), 38 states have return successors, (106), 76 states have call predecessors, (106), 69 states have call successors, (106) [2022-07-13 11:29:05,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 935 transitions. [2022-07-13 11:29:05,813 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 935 transitions. Word has length 48 [2022-07-13 11:29:05,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:05,813 INFO L495 AbstractCegarLoop]: Abstraction has 683 states and 935 transitions. [2022-07-13 11:29:05,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 11:29:05,814 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 935 transitions. [2022-07-13 11:29:05,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-13 11:29:05,816 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:05,816 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:29:05,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-13 11:29:05,816 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:05,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:05,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1335817887, now seen corresponding path program 1 times [2022-07-13 11:29:05,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:05,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695763996] [2022-07-13 11:29:05,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:05,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:05,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 11:29:05,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:05,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 11:29:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:05,845 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:29:05,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:05,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695763996] [2022-07-13 11:29:05,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695763996] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:05,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:05,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:29:05,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667518667] [2022-07-13 11:29:05,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:05,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:29:05,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:05,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:29:05,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:29:05,848 INFO L87 Difference]: Start difference. First operand 683 states and 935 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 11:29:06,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:06,121 INFO L93 Difference]: Finished difference Result 919 states and 1254 transitions. [2022-07-13 11:29:06,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 11:29:06,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2022-07-13 11:29:06,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:06,123 INFO L225 Difference]: With dead ends: 919 [2022-07-13 11:29:06,124 INFO L226 Difference]: Without dead ends: 641 [2022-07-13 11:29:06,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:29:06,125 INFO L413 NwaCegarLoop]: 496 mSDtfsCounter, 99 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:06,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1584 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:29:06,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2022-07-13 11:29:06,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 606. [2022-07-13 11:29:06,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 509 states have (on average 1.3143418467583496) internal successors, (669), 517 states have internal predecessors, (669), 65 states have call successors, (65), 25 states have call predecessors, (65), 31 states have return successors, (73), 63 states have call predecessors, (73), 59 states have call successors, (73) [2022-07-13 11:29:06,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 807 transitions. [2022-07-13 11:29:06,161 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 807 transitions. Word has length 48 [2022-07-13 11:29:06,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:06,161 INFO L495 AbstractCegarLoop]: Abstraction has 606 states and 807 transitions. [2022-07-13 11:29:06,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 11:29:06,161 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 807 transitions. [2022-07-13 11:29:06,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-13 11:29:06,163 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:06,163 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, 1] [2022-07-13 11:29:06,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-13 11:29:06,163 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:06,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:06,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1170302788, now seen corresponding path program 1 times [2022-07-13 11:29:06,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:06,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143879477] [2022-07-13 11:29:06,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:06,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:06,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 11:29:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:06,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:06,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:06,310 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:29:06,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:06,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143879477] [2022-07-13 11:29:06,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143879477] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:06,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:06,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-13 11:29:06,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623666242] [2022-07-13 11:29:06,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:06,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 11:29:06,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:06,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 11:29:06,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-13 11:29:06,313 INFO L87 Difference]: Start difference. First operand 606 states and 807 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 9 states have internal predecessors, (49), 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:29:07,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:07,058 INFO L93 Difference]: Finished difference Result 621 states and 822 transitions. [2022-07-13 11:29:07,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 11:29:07,059 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 9 states have internal predecessors, (49), 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 54 [2022-07-13 11:29:07,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:07,061 INFO L225 Difference]: With dead ends: 621 [2022-07-13 11:29:07,061 INFO L226 Difference]: Without dead ends: 597 [2022-07-13 11:29:07,062 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:29:07,062 INFO L413 NwaCegarLoop]: 501 mSDtfsCounter, 118 mSDsluCounter, 3884 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 4385 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:07,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 4385 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 11:29:07,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2022-07-13 11:29:07,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2022-07-13 11:29:07,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 502 states have (on average 1.3147410358565736) internal successors, (660), 510 states have internal predecessors, (660), 63 states have call successors, (63), 25 states have call predecessors, (63), 31 states have return successors, (71), 61 states have call predecessors, (71), 57 states have call successors, (71) [2022-07-13 11:29:07,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 794 transitions. [2022-07-13 11:29:07,115 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 794 transitions. Word has length 54 [2022-07-13 11:29:07,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:07,115 INFO L495 AbstractCegarLoop]: Abstraction has 597 states and 794 transitions. [2022-07-13 11:29:07,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 9 states have internal predecessors, (49), 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:29:07,115 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 794 transitions. [2022-07-13 11:29:07,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-13 11:29:07,117 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:07,117 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:29:07,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-13 11:29:07,117 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:07,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:07,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1066234985, now seen corresponding path program 1 times [2022-07-13 11:29:07,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:07,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174839322] [2022-07-13 11:29:07,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:07,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:07,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:07,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:29:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:07,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:07,278 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:29:07,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:07,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174839322] [2022-07-13 11:29:07,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174839322] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:07,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:07,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-13 11:29:07,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296154140] [2022-07-13 11:29:07,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:07,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 11:29:07,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:07,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 11:29:07,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-13 11:29:07,282 INFO L87 Difference]: Start difference. First operand 597 states and 794 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 9 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:29:07,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:07,968 INFO L93 Difference]: Finished difference Result 612 states and 809 transitions. [2022-07-13 11:29:07,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 11:29:07,969 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 9 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:29:07,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:07,972 INFO L225 Difference]: With dead ends: 612 [2022-07-13 11:29:07,972 INFO L226 Difference]: Without dead ends: 594 [2022-07-13 11:29:07,972 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:29:07,973 INFO L413 NwaCegarLoop]: 476 mSDtfsCounter, 118 mSDsluCounter, 3715 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 4191 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:07,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 4191 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1200 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 11:29:07,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-07-13 11:29:08,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2022-07-13 11:29:08,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 500 states have (on average 1.314) internal successors, (657), 508 states have internal predecessors, (657), 62 states have call successors, (62), 25 states have call predecessors, (62), 31 states have return successors, (70), 60 states have call predecessors, (70), 56 states have call successors, (70) [2022-07-13 11:29:08,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 789 transitions. [2022-07-13 11:29:08,012 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 789 transitions. Word has length 48 [2022-07-13 11:29:08,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:08,012 INFO L495 AbstractCegarLoop]: Abstraction has 594 states and 789 transitions. [2022-07-13 11:29:08,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 9 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:29:08,012 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 789 transitions. [2022-07-13 11:29:08,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-13 11:29:08,014 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:08,014 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] [2022-07-13 11:29:08,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-13 11:29:08,015 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:08,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:08,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1131207190, now seen corresponding path program 1 times [2022-07-13 11:29:08,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:08,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650873038] [2022-07-13 11:29:08,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:08,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:08,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 11:29:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:08,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 11:29:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:08,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:08,150 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:29:08,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:08,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650873038] [2022-07-13 11:29:08,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650873038] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:08,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:08,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-13 11:29:08,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145912999] [2022-07-13 11:29:08,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:08,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 11:29:08,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:08,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 11:29:08,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:29:08,153 INFO L87 Difference]: Start difference. First operand 594 states and 789 transitions. Second operand has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 11:29:09,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:09,005 INFO L93 Difference]: Finished difference Result 628 states and 824 transitions. [2022-07-13 11:29:09,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 11:29:09,005 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2022-07-13 11:29:09,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:09,008 INFO L225 Difference]: With dead ends: 628 [2022-07-13 11:29:09,008 INFO L226 Difference]: Without dead ends: 608 [2022-07-13 11:29:09,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-07-13 11:29:09,009 INFO L413 NwaCegarLoop]: 462 mSDtfsCounter, 256 mSDsluCounter, 3726 mSDsCounter, 0 mSdLazyCounter, 1467 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 4188 SdHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:09,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 4188 Invalid, 1587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1467 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 11:29:09,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-07-13 11:29:09,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 592. [2022-07-13 11:29:09,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 499 states have (on average 1.312625250501002) internal successors, (655), 507 states have internal predecessors, (655), 61 states have call successors, (61), 25 states have call predecessors, (61), 31 states have return successors, (69), 59 states have call predecessors, (69), 55 states have call successors, (69) [2022-07-13 11:29:09,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 785 transitions. [2022-07-13 11:29:09,047 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 785 transitions. Word has length 51 [2022-07-13 11:29:09,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:09,048 INFO L495 AbstractCegarLoop]: Abstraction has 592 states and 785 transitions. [2022-07-13 11:29:09,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 11:29:09,048 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 785 transitions. [2022-07-13 11:29:09,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-13 11:29:09,050 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:09,050 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:29:09,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-07-13 11:29:09,050 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:09,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:09,051 INFO L85 PathProgramCache]: Analyzing trace with hash -480998912, now seen corresponding path program 1 times [2022-07-13 11:29:09,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:09,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759239178] [2022-07-13 11:29:09,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:09,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:09,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:29:09,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:09,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 11:29:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:09,097 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:29:09,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:09,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759239178] [2022-07-13 11:29:09,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759239178] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:09,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:09,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 11:29:09,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050849860] [2022-07-13 11:29:09,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:09,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 11:29:09,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:09,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 11:29:09,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:29:09,099 INFO L87 Difference]: Start difference. First operand 592 states and 785 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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:29:09,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:09,484 INFO L93 Difference]: Finished difference Result 674 states and 879 transitions. [2022-07-13 11:29:09,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 11:29:09,484 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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 50 [2022-07-13 11:29:09,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:09,486 INFO L225 Difference]: With dead ends: 674 [2022-07-13 11:29:09,486 INFO L226 Difference]: Without dead ends: 648 [2022-07-13 11:29:09,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:29:09,487 INFO L413 NwaCegarLoop]: 510 mSDtfsCounter, 267 mSDsluCounter, 1830 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 2340 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:09,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 2340 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:29:09,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2022-07-13 11:29:09,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 598. [2022-07-13 11:29:09,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 504 states have (on average 1.3115079365079365) internal successors, (661), 512 states have internal predecessors, (661), 62 states have call successors, (62), 25 states have call predecessors, (62), 31 states have return successors, (70), 60 states have call predecessors, (70), 56 states have call successors, (70) [2022-07-13 11:29:09,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 793 transitions. [2022-07-13 11:29:09,518 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 793 transitions. Word has length 50 [2022-07-13 11:29:09,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:09,518 INFO L495 AbstractCegarLoop]: Abstraction has 598 states and 793 transitions. [2022-07-13 11:29:09,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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:29:09,518 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 793 transitions. [2022-07-13 11:29:09,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-13 11:29:09,520 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:09,521 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:29:09,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-07-13 11:29:09,521 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:09,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:09,521 INFO L85 PathProgramCache]: Analyzing trace with hash 266979750, now seen corresponding path program 1 times [2022-07-13 11:29:09,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:09,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772031300] [2022-07-13 11:29:09,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:09,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:09,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 11:29:09,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:09,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 11:29:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:09,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 11:29:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:09,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 11:29:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:09,575 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:29:09,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:09,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772031300] [2022-07-13 11:29:09,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772031300] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:09,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:09,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 11:29:09,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359022813] [2022-07-13 11:29:09,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:09,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:29:09,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:09,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:29:09,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:29:09,577 INFO L87 Difference]: Start difference. First operand 598 states and 793 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 11:29:09,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:09,941 INFO L93 Difference]: Finished difference Result 703 states and 934 transitions. [2022-07-13 11:29:09,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:29:09,941 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (6), 4 states have call predecessors, (6), 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:29:09,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:09,944 INFO L225 Difference]: With dead ends: 703 [2022-07-13 11:29:09,944 INFO L226 Difference]: Without dead ends: 598 [2022-07-13 11:29:09,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:29:09,945 INFO L413 NwaCegarLoop]: 463 mSDtfsCounter, 113 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:09,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1415 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:29:09,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2022-07-13 11:29:09,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2022-07-13 11:29:09,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 504 states have (on average 1.3055555555555556) internal successors, (658), 512 states have internal predecessors, (658), 62 states have call successors, (62), 25 states have call predecessors, (62), 31 states have return successors, (70), 60 states have call predecessors, (70), 56 states have call successors, (70) [2022-07-13 11:29:09,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 790 transitions. [2022-07-13 11:29:09,984 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 790 transitions. Word has length 53 [2022-07-13 11:29:09,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:09,985 INFO L495 AbstractCegarLoop]: Abstraction has 598 states and 790 transitions. [2022-07-13 11:29:09,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 11:29:09,985 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 790 transitions. [2022-07-13 11:29:09,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-13 11:29:09,987 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:09,987 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] [2022-07-13 11:29:09,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-07-13 11:29:09,987 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:09,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:09,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1095084481, now seen corresponding path program 1 times [2022-07-13 11:29:09,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:09,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733200295] [2022-07-13 11:29:09,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:09,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:10,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 11:29:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:10,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 11:29:10,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:10,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:10,119 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:29:10,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:10,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733200295] [2022-07-13 11:29:10,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733200295] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:10,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:10,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-13 11:29:10,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618506914] [2022-07-13 11:29:10,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:10,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 11:29:10,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:10,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 11:29:10,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:29:10,123 INFO L87 Difference]: Start difference. First operand 598 states and 790 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 10 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 11:29:10,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:10,826 INFO L93 Difference]: Finished difference Result 616 states and 808 transitions. [2022-07-13 11:29:10,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 11:29:10,827 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 10 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 52 [2022-07-13 11:29:10,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:10,830 INFO L225 Difference]: With dead ends: 616 [2022-07-13 11:29:10,830 INFO L226 Difference]: Without dead ends: 596 [2022-07-13 11:29:10,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-07-13 11:29:10,831 INFO L413 NwaCegarLoop]: 470 mSDtfsCounter, 256 mSDsluCounter, 3422 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 3892 SdHoareTripleChecker+Invalid, 1472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:10,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 3892 Invalid, 1472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1352 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 11:29:10,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-07-13 11:29:10,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2022-07-13 11:29:10,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 503 states have (on average 1.3041749502982107) internal successors, (656), 511 states have internal predecessors, (656), 61 states have call successors, (61), 25 states have call predecessors, (61), 31 states have return successors, (69), 59 states have call predecessors, (69), 55 states have call successors, (69) [2022-07-13 11:29:10,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 786 transitions. [2022-07-13 11:29:10,869 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 786 transitions. Word has length 52 [2022-07-13 11:29:10,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:10,870 INFO L495 AbstractCegarLoop]: Abstraction has 596 states and 786 transitions. [2022-07-13 11:29:10,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 10 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 11:29:10,870 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 786 transitions. [2022-07-13 11:29:10,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-13 11:29:10,871 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:10,871 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] [2022-07-13 11:29:10,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-07-13 11:29:10,872 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:10,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:10,872 INFO L85 PathProgramCache]: Analyzing trace with hash 309046761, now seen corresponding path program 1 times [2022-07-13 11:29:10,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:10,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617951025] [2022-07-13 11:29:10,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:10,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:10,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 11:29:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:10,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 11:29:10,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:10,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:29:10,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:10,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617951025] [2022-07-13 11:29:10,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617951025] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:10,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:10,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 11:29:10,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072025588] [2022-07-13 11:29:10,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:10,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 11:29:10,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:10,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 11:29:10,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:29:10,932 INFO L87 Difference]: Start difference. First operand 596 states and 786 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 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:29:11,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:11,347 INFO L93 Difference]: Finished difference Result 630 states and 826 transitions. [2022-07-13 11:29:11,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 11:29:11,347 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 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 51 [2022-07-13 11:29:11,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:11,349 INFO L225 Difference]: With dead ends: 630 [2022-07-13 11:29:11,349 INFO L226 Difference]: Without dead ends: 576 [2022-07-13 11:29:11,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-07-13 11:29:11,350 INFO L413 NwaCegarLoop]: 469 mSDtfsCounter, 266 mSDsluCounter, 2273 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 2742 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:11,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 2742 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:29:11,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2022-07-13 11:29:11,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 569. [2022-07-13 11:29:11,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 481 states have (on average 1.288981288981289) internal successors, (620), 489 states have internal predecessors, (620), 56 states have call successors, (56), 25 states have call predecessors, (56), 31 states have return successors, (63), 54 states have call predecessors, (63), 50 states have call successors, (63) [2022-07-13 11:29:11,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 739 transitions. [2022-07-13 11:29:11,388 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 739 transitions. Word has length 51 [2022-07-13 11:29:11,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:11,389 INFO L495 AbstractCegarLoop]: Abstraction has 569 states and 739 transitions. [2022-07-13 11:29:11,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 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:29:11,389 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 739 transitions. [2022-07-13 11:29:11,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-13 11:29:11,390 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:11,391 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] [2022-07-13 11:29:11,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-07-13 11:29:11,391 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:11,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:11,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1614181273, now seen corresponding path program 1 times [2022-07-13 11:29:11,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:11,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087469341] [2022-07-13 11:29:11,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:11,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:11,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:11,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 11:29:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:11,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 11:29:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:11,441 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:29:11,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:11,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087469341] [2022-07-13 11:29:11,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087469341] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:11,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:11,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 11:29:11,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061893777] [2022-07-13 11:29:11,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:11,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 11:29:11,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:11,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 11:29:11,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:29:11,443 INFO L87 Difference]: Start difference. First operand 569 states and 739 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 11:29:11,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:11,721 INFO L93 Difference]: Finished difference Result 610 states and 781 transitions. [2022-07-13 11:29:11,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 11:29:11,721 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 51 [2022-07-13 11:29:11,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:11,723 INFO L225 Difference]: With dead ends: 610 [2022-07-13 11:29:11,723 INFO L226 Difference]: Without dead ends: 563 [2022-07-13 11:29:11,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:29:11,724 INFO L413 NwaCegarLoop]: 412 mSDtfsCounter, 179 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1718 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:11,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1718 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:29:11,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2022-07-13 11:29:11,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 559. [2022-07-13 11:29:11,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 473 states have (on average 1.285412262156448) internal successors, (608), 481 states have internal predecessors, (608), 54 states have call successors, (54), 25 states have call predecessors, (54), 31 states have return successors, (61), 52 states have call predecessors, (61), 48 states have call successors, (61) [2022-07-13 11:29:11,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 723 transitions. [2022-07-13 11:29:11,760 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 723 transitions. Word has length 51 [2022-07-13 11:29:11,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:11,760 INFO L495 AbstractCegarLoop]: Abstraction has 559 states and 723 transitions. [2022-07-13 11:29:11,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 11:29:11,761 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 723 transitions. [2022-07-13 11:29:11,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-13 11:29:11,762 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:11,762 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] [2022-07-13 11:29:11,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-07-13 11:29:11,763 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:11,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:11,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1624287433, now seen corresponding path program 1 times [2022-07-13 11:29:11,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:11,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695245303] [2022-07-13 11:29:11,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:11,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:11,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 11:29:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:11,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 11:29:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:11,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:29:11,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:11,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695245303] [2022-07-13 11:29:11,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695245303] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:11,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:11,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 11:29:11,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361727933] [2022-07-13 11:29:11,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:11,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 11:29:11,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:11,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 11:29:11,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:29:11,807 INFO L87 Difference]: Start difference. First operand 559 states and 723 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 11:29:12,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:12,068 INFO L93 Difference]: Finished difference Result 586 states and 751 transitions. [2022-07-13 11:29:12,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 11:29:12,068 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2022-07-13 11:29:12,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:12,070 INFO L225 Difference]: With dead ends: 586 [2022-07-13 11:29:12,070 INFO L226 Difference]: Without dead ends: 554 [2022-07-13 11:29:12,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:29:12,071 INFO L413 NwaCegarLoop]: 412 mSDtfsCounter, 96 mSDsluCounter, 1554 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1966 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:12,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1966 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:29:12,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2022-07-13 11:29:12,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2022-07-13 11:29:12,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 469 states have (on average 1.2857142857142858) internal successors, (603), 477 states have internal predecessors, (603), 53 states have call successors, (53), 25 states have call predecessors, (53), 31 states have return successors, (60), 51 states have call predecessors, (60), 47 states have call successors, (60) [2022-07-13 11:29:12,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 716 transitions. [2022-07-13 11:29:12,098 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 716 transitions. Word has length 52 [2022-07-13 11:29:12,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:12,098 INFO L495 AbstractCegarLoop]: Abstraction has 554 states and 716 transitions. [2022-07-13 11:29:12,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 11:29:12,098 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 716 transitions. [2022-07-13 11:29:12,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-13 11:29:12,099 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:12,100 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] [2022-07-13 11:29:12,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-07-13 11:29:12,100 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:12,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:12,100 INFO L85 PathProgramCache]: Analyzing trace with hash 576638373, now seen corresponding path program 1 times [2022-07-13 11:29:12,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:12,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167401983] [2022-07-13 11:29:12,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:12,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:12,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:12,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 11:29:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:12,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:12,136 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:29:12,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:12,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167401983] [2022-07-13 11:29:12,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167401983] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:12,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:12,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:29:12,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879054824] [2022-07-13 11:29:12,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:12,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:29:12,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:12,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:29:12,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:29:12,138 INFO L87 Difference]: Start difference. First operand 554 states and 716 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 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:29:12,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:12,460 INFO L93 Difference]: Finished difference Result 653 states and 844 transitions. [2022-07-13 11:29:12,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 11:29:12,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 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 52 [2022-07-13 11:29:12,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:12,462 INFO L225 Difference]: With dead ends: 653 [2022-07-13 11:29:12,462 INFO L226 Difference]: Without dead ends: 641 [2022-07-13 11:29:12,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:29:12,463 INFO L413 NwaCegarLoop]: 427 mSDtfsCounter, 216 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:12,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 1237 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:29:12,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2022-07-13 11:29:12,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 586. [2022-07-13 11:29:12,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 499 states have (on average 1.280561122244489) internal successors, (639), 507 states have internal predecessors, (639), 53 states have call successors, (53), 25 states have call predecessors, (53), 33 states have return successors, (62), 53 states have call predecessors, (62), 47 states have call successors, (62) [2022-07-13 11:29:12,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 754 transitions. [2022-07-13 11:29:12,502 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 754 transitions. Word has length 52 [2022-07-13 11:29:12,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:12,502 INFO L495 AbstractCegarLoop]: Abstraction has 586 states and 754 transitions. [2022-07-13 11:29:12,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 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:29:12,503 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 754 transitions. [2022-07-13 11:29:12,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-13 11:29:12,504 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:12,504 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, 1, 1, 1] [2022-07-13 11:29:12,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-07-13 11:29:12,504 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:12,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:12,505 INFO L85 PathProgramCache]: Analyzing trace with hash 2037022253, now seen corresponding path program 1 times [2022-07-13 11:29:12,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:12,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928605333] [2022-07-13 11:29:12,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:12,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:12,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-13 11:29:12,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:12,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 11:29:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:12,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 11:29:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:12,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 11:29:12,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:12,556 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:29:12,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:12,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928605333] [2022-07-13 11:29:12,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928605333] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:12,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:12,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 11:29:12,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255287341] [2022-07-13 11:29:12,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:12,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:29:12,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:12,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:29:12,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:29:12,558 INFO L87 Difference]: Start difference. First operand 586 states and 754 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:29:12,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:12,833 INFO L93 Difference]: Finished difference Result 716 states and 919 transitions. [2022-07-13 11:29:12,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 11:29:12,834 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 56 [2022-07-13 11:29:12,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:12,835 INFO L225 Difference]: With dead ends: 716 [2022-07-13 11:29:12,835 INFO L226 Difference]: Without dead ends: 643 [2022-07-13 11:29:12,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-13 11:29:12,836 INFO L413 NwaCegarLoop]: 450 mSDtfsCounter, 417 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:12,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1304 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:29:12,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2022-07-13 11:29:12,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 626. [2022-07-13 11:29:12,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 533 states have (on average 1.2870544090056286) internal successors, (686), 540 states have internal predecessors, (686), 55 states have call successors, (55), 28 states have call predecessors, (55), 37 states have return successors, (67), 57 states have call predecessors, (67), 50 states have call successors, (67) [2022-07-13 11:29:12,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 808 transitions. [2022-07-13 11:29:12,877 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 808 transitions. Word has length 56 [2022-07-13 11:29:12,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:12,877 INFO L495 AbstractCegarLoop]: Abstraction has 626 states and 808 transitions. [2022-07-13 11:29:12,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:29:12,877 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 808 transitions. [2022-07-13 11:29:12,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-13 11:29:12,879 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:12,879 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:29:12,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-07-13 11:29:12,879 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:12,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:12,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1140697567, now seen corresponding path program 1 times [2022-07-13 11:29:12,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:12,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896021388] [2022-07-13 11:29:12,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:12,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:12,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 11:29:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:12,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:12,936 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:29:12,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:12,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896021388] [2022-07-13 11:29:12,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896021388] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:12,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:12,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 11:29:12,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454250373] [2022-07-13 11:29:12,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:12,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 11:29:12,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:12,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 11:29:12,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:29:12,938 INFO L87 Difference]: Start difference. First operand 626 states and 808 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 11:29:13,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:13,409 INFO L93 Difference]: Finished difference Result 687 states and 887 transitions. [2022-07-13 11:29:13,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 11:29:13,409 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 53 [2022-07-13 11:29:13,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:13,411 INFO L225 Difference]: With dead ends: 687 [2022-07-13 11:29:13,411 INFO L226 Difference]: Without dead ends: 678 [2022-07-13 11:29:13,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-13 11:29:13,412 INFO L413 NwaCegarLoop]: 408 mSDtfsCounter, 759 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:13,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 1404 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 11:29:13,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2022-07-13 11:29:13,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 626. [2022-07-13 11:29:13,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 533 states have (on average 1.2833020637898687) internal successors, (684), 540 states have internal predecessors, (684), 55 states have call successors, (55), 28 states have call predecessors, (55), 37 states have return successors, (67), 57 states have call predecessors, (67), 50 states have call successors, (67) [2022-07-13 11:29:13,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 806 transitions. [2022-07-13 11:29:13,503 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 806 transitions. Word has length 53 [2022-07-13 11:29:13,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:13,503 INFO L495 AbstractCegarLoop]: Abstraction has 626 states and 806 transitions. [2022-07-13 11:29:13,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 11:29:13,503 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 806 transitions. [2022-07-13 11:29:13,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-13 11:29:13,505 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:13,505 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, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:13,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-07-13 11:29:13,505 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:13,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:13,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1949554969, now seen corresponding path program 1 times [2022-07-13 11:29:13,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:13,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683124819] [2022-07-13 11:29:13,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:13,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:13,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 11:29:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:13,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 11:29:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:13,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 11:29:13,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:13,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:13,643 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:29:13,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:13,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683124819] [2022-07-13 11:29:13,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683124819] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:13,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:13,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-13 11:29:13,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169159534] [2022-07-13 11:29:13,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:13,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 11:29:13,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:13,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 11:29:13,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:29:13,645 INFO L87 Difference]: Start difference. First operand 626 states and 806 transitions. Second operand has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-13 11:29:14,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:14,377 INFO L93 Difference]: Finished difference Result 669 states and 855 transitions. [2022-07-13 11:29:14,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 11:29:14,377 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 59 [2022-07-13 11:29:14,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:14,378 INFO L225 Difference]: With dead ends: 669 [2022-07-13 11:29:14,379 INFO L226 Difference]: Without dead ends: 649 [2022-07-13 11:29:14,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-07-13 11:29:14,379 INFO L413 NwaCegarLoop]: 428 mSDtfsCounter, 243 mSDsluCounter, 3574 mSDsCounter, 0 mSdLazyCounter, 1573 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 4002 SdHoareTripleChecker+Invalid, 1677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:14,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 4002 Invalid, 1677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1573 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 11:29:14,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2022-07-13 11:29:14,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 624. [2022-07-13 11:29:14,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 532 states have (on average 1.281954887218045) internal successors, (682), 539 states have internal predecessors, (682), 54 states have call successors, (54), 28 states have call predecessors, (54), 37 states have return successors, (66), 56 states have call predecessors, (66), 49 states have call successors, (66) [2022-07-13 11:29:14,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 802 transitions. [2022-07-13 11:29:14,412 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 802 transitions. Word has length 59 [2022-07-13 11:29:14,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:14,412 INFO L495 AbstractCegarLoop]: Abstraction has 624 states and 802 transitions. [2022-07-13 11:29:14,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-13 11:29:14,413 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 802 transitions. [2022-07-13 11:29:14,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-13 11:29:14,414 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:14,414 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, 1, 1] [2022-07-13 11:29:14,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-07-13 11:29:14,414 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:14,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:14,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1478759627, now seen corresponding path program 1 times [2022-07-13 11:29:14,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:14,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159335248] [2022-07-13 11:29:14,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:14,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:14,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 11:29:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:14,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-13 11:29:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:14,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:14,563 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:29:14,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:14,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159335248] [2022-07-13 11:29:14,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159335248] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:14,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:14,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-13 11:29:14,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903300996] [2022-07-13 11:29:14,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:14,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-13 11:29:14,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:14,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 11:29:14,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-07-13 11:29:14,566 INFO L87 Difference]: Start difference. First operand 624 states and 802 transitions. Second operand has 16 states, 15 states have (on average 3.2) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 11:29:15,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:15,397 INFO L93 Difference]: Finished difference Result 644 states and 823 transitions. [2022-07-13 11:29:15,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 11:29:15,397 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 55 [2022-07-13 11:29:15,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:15,398 INFO L225 Difference]: With dead ends: 644 [2022-07-13 11:29:15,398 INFO L226 Difference]: Without dead ends: 620 [2022-07-13 11:29:15,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2022-07-13 11:29:15,399 INFO L413 NwaCegarLoop]: 404 mSDtfsCounter, 232 mSDsluCounter, 3954 mSDsCounter, 0 mSdLazyCounter, 1785 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 4358 SdHoareTripleChecker+Invalid, 1883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:15,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 4358 Invalid, 1883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1785 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 11:29:15,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2022-07-13 11:29:15,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2022-07-13 11:29:15,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 529 states have (on average 1.281663516068053) internal successors, (678), 536 states have internal predecessors, (678), 53 states have call successors, (53), 28 states have call predecessors, (53), 37 states have return successors, (65), 55 states have call predecessors, (65), 48 states have call successors, (65) [2022-07-13 11:29:15,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 796 transitions. [2022-07-13 11:29:15,437 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 796 transitions. Word has length 55 [2022-07-13 11:29:15,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:15,437 INFO L495 AbstractCegarLoop]: Abstraction has 620 states and 796 transitions. [2022-07-13 11:29:15,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 11:29:15,437 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 796 transitions. [2022-07-13 11:29:15,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-13 11:29:15,438 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:15,438 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, 1] [2022-07-13 11:29:15,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-07-13 11:29:15,438 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:15,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:15,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1059320829, now seen corresponding path program 1 times [2022-07-13 11:29:15,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:15,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781641525] [2022-07-13 11:29:15,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:15,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:15,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 11:29:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:15,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 11:29:15,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:15,481 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:29:15,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:15,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781641525] [2022-07-13 11:29:15,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781641525] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:15,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:15,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 11:29:15,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663342608] [2022-07-13 11:29:15,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:15,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 11:29:15,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:15,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 11:29:15,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:29:15,483 INFO L87 Difference]: Start difference. First operand 620 states and 796 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 11:29:15,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:15,724 INFO L93 Difference]: Finished difference Result 647 states and 824 transitions. [2022-07-13 11:29:15,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 11:29:15,724 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 54 [2022-07-13 11:29:15,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:15,726 INFO L225 Difference]: With dead ends: 647 [2022-07-13 11:29:15,726 INFO L226 Difference]: Without dead ends: 615 [2022-07-13 11:29:15,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:29:15,727 INFO L413 NwaCegarLoop]: 394 mSDtfsCounter, 171 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:15,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 1642 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:29:15,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2022-07-13 11:29:15,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2022-07-13 11:29:15,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 525 states have (on average 1.2819047619047619) internal successors, (673), 532 states have internal predecessors, (673), 52 states have call successors, (52), 28 states have call predecessors, (52), 37 states have return successors, (64), 54 states have call predecessors, (64), 47 states have call successors, (64) [2022-07-13 11:29:15,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 789 transitions. [2022-07-13 11:29:15,763 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 789 transitions. Word has length 54 [2022-07-13 11:29:15,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:15,763 INFO L495 AbstractCegarLoop]: Abstraction has 615 states and 789 transitions. [2022-07-13 11:29:15,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 11:29:15,763 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 789 transitions. [2022-07-13 11:29:15,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-13 11:29:15,764 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:15,764 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, 1] [2022-07-13 11:29:15,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-07-13 11:29:15,764 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:15,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:15,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1513227889, now seen corresponding path program 1 times [2022-07-13 11:29:15,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:15,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924737020] [2022-07-13 11:29:15,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:15,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:15,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 11:29:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:15,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 11:29:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:15,838 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:29:15,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:15,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924737020] [2022-07-13 11:29:15,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924737020] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:15,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:15,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 11:29:15,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339803842] [2022-07-13 11:29:15,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:15,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:29:15,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:15,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:29:15,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:29:15,840 INFO L87 Difference]: Start difference. First operand 615 states and 789 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 11:29:16,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:16,266 INFO L93 Difference]: Finished difference Result 638 states and 814 transitions. [2022-07-13 11:29:16,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 11:29:16,267 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 54 [2022-07-13 11:29:16,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:16,268 INFO L225 Difference]: With dead ends: 638 [2022-07-13 11:29:16,268 INFO L226 Difference]: Without dead ends: 612 [2022-07-13 11:29:16,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-07-13 11:29:16,269 INFO L413 NwaCegarLoop]: 403 mSDtfsCounter, 232 mSDsluCounter, 2610 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 3013 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:16,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 3013 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:29:16,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2022-07-13 11:29:16,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2022-07-13 11:29:16,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 523 states have (on average 1.2810707456978967) internal successors, (670), 530 states have internal predecessors, (670), 51 states have call successors, (51), 28 states have call predecessors, (51), 37 states have return successors, (63), 53 states have call predecessors, (63), 46 states have call successors, (63) [2022-07-13 11:29:16,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 784 transitions. [2022-07-13 11:29:16,298 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 784 transitions. Word has length 54 [2022-07-13 11:29:16,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:16,299 INFO L495 AbstractCegarLoop]: Abstraction has 612 states and 784 transitions. [2022-07-13 11:29:16,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 11:29:16,299 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 784 transitions. [2022-07-13 11:29:16,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-13 11:29:16,301 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:16,301 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, 1] [2022-07-13 11:29:16,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-07-13 11:29:16,301 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:16,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:16,301 INFO L85 PathProgramCache]: Analyzing trace with hash 362195338, now seen corresponding path program 1 times [2022-07-13 11:29:16,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:16,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509573971] [2022-07-13 11:29:16,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:16,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:16,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 11:29:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:16,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:16,354 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:29:16,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:16,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509573971] [2022-07-13 11:29:16,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509573971] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:16,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:16,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 11:29:16,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372884076] [2022-07-13 11:29:16,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:16,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 11:29:16,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:16,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 11:29:16,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:29:16,357 INFO L87 Difference]: Start difference. First operand 612 states and 784 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 11:29:16,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:16,850 INFO L93 Difference]: Finished difference Result 668 states and 856 transitions. [2022-07-13 11:29:16,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 11:29:16,851 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 54 [2022-07-13 11:29:16,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:16,853 INFO L225 Difference]: With dead ends: 668 [2022-07-13 11:29:16,853 INFO L226 Difference]: Without dead ends: 664 [2022-07-13 11:29:16,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:29:16,855 INFO L413 NwaCegarLoop]: 400 mSDtfsCounter, 723 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:16,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 1361 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 11:29:16,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2022-07-13 11:29:16,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 609. [2022-07-13 11:29:16,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 520 states have (on average 1.2788461538461537) internal successors, (665), 527 states have internal predecessors, (665), 51 states have call successors, (51), 28 states have call predecessors, (51), 37 states have return successors, (63), 53 states have call predecessors, (63), 46 states have call successors, (63) [2022-07-13 11:29:16,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 779 transitions. [2022-07-13 11:29:16,909 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 779 transitions. Word has length 54 [2022-07-13 11:29:16,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:16,910 INFO L495 AbstractCegarLoop]: Abstraction has 609 states and 779 transitions. [2022-07-13 11:29:16,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 11:29:16,910 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 779 transitions. [2022-07-13 11:29:16,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-13 11:29:16,911 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:16,911 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, 1] [2022-07-13 11:29:16,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-07-13 11:29:16,912 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:16,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:16,912 INFO L85 PathProgramCache]: Analyzing trace with hash 362472168, now seen corresponding path program 1 times [2022-07-13 11:29:16,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:16,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265495028] [2022-07-13 11:29:16,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:16,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:16,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 11:29:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:17,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:17,028 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:29:17,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:17,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265495028] [2022-07-13 11:29:17,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265495028] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:17,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:17,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 11:29:17,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163646760] [2022-07-13 11:29:17,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:17,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:29:17,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:17,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:29:17,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:29:17,031 INFO L87 Difference]: Start difference. First operand 609 states and 779 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 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:29:17,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:17,663 INFO L93 Difference]: Finished difference Result 619 states and 788 transitions. [2022-07-13 11:29:17,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 11:29:17,665 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 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 54 [2022-07-13 11:29:17,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:17,666 INFO L225 Difference]: With dead ends: 619 [2022-07-13 11:29:17,666 INFO L226 Difference]: Without dead ends: 591 [2022-07-13 11:29:17,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-07-13 11:29:17,667 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 287 mSDsluCounter, 2154 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 2526 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:17,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 2526 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 11:29:17,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2022-07-13 11:29:17,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 587. [2022-07-13 11:29:17,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 499 states have (on average 1.2725450901803608) internal successors, (635), 506 states have internal predecessors, (635), 51 states have call successors, (51), 28 states have call predecessors, (51), 36 states have return successors, (62), 52 states have call predecessors, (62), 46 states have call successors, (62) [2022-07-13 11:29:17,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 748 transitions. [2022-07-13 11:29:17,709 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 748 transitions. Word has length 54 [2022-07-13 11:29:17,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:17,709 INFO L495 AbstractCegarLoop]: Abstraction has 587 states and 748 transitions. [2022-07-13 11:29:17,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 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:29:17,709 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 748 transitions. [2022-07-13 11:29:17,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-13 11:29:17,710 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:17,710 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, 1] [2022-07-13 11:29:17,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-07-13 11:29:17,711 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:17,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:17,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1415863677, now seen corresponding path program 1 times [2022-07-13 11:29:17,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:17,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272700618] [2022-07-13 11:29:17,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:17,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:17,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:17,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 11:29:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:17,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:17,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:17,749 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:29:17,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:17,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272700618] [2022-07-13 11:29:17,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272700618] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:17,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:17,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:29:17,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564544795] [2022-07-13 11:29:17,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:17,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:29:17,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:17,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:29:17,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:29:17,751 INFO L87 Difference]: Start difference. First operand 587 states and 748 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 11:29:17,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:17,992 INFO L93 Difference]: Finished difference Result 613 states and 778 transitions. [2022-07-13 11:29:17,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 11:29:17,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2022-07-13 11:29:17,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:17,995 INFO L225 Difference]: With dead ends: 613 [2022-07-13 11:29:17,995 INFO L226 Difference]: Without dead ends: 580 [2022-07-13 11:29:17,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:29:17,996 INFO L413 NwaCegarLoop]: 412 mSDtfsCounter, 232 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:17,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 951 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:29:17,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2022-07-13 11:29:18,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 576. [2022-07-13 11:29:18,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 489 states have (on average 1.2638036809815951) internal successors, (618), 496 states have internal predecessors, (618), 51 states have call successors, (51), 28 states have call predecessors, (51), 35 states have return successors, (61), 51 states have call predecessors, (61), 46 states have call successors, (61) [2022-07-13 11:29:18,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 730 transitions. [2022-07-13 11:29:18,040 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 730 transitions. Word has length 54 [2022-07-13 11:29:18,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:18,040 INFO L495 AbstractCegarLoop]: Abstraction has 576 states and 730 transitions. [2022-07-13 11:29:18,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 11:29:18,041 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 730 transitions. [2022-07-13 11:29:18,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-13 11:29:18,042 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:18,042 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, 1, 1, 1] [2022-07-13 11:29:18,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-07-13 11:29:18,042 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:18,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:18,043 INFO L85 PathProgramCache]: Analyzing trace with hash -275547021, now seen corresponding path program 1 times [2022-07-13 11:29:18,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:18,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560571042] [2022-07-13 11:29:18,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:18,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:18,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 11:29:18,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:18,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 11:29:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:18,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:18,099 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:29:18,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:18,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560571042] [2022-07-13 11:29:18,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560571042] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:18,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:18,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 11:29:18,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441080826] [2022-07-13 11:29:18,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:18,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 11:29:18,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:18,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 11:29:18,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:29:18,101 INFO L87 Difference]: Start difference. First operand 576 states and 730 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 11:29:18,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:18,429 INFO L93 Difference]: Finished difference Result 625 states and 782 transitions. [2022-07-13 11:29:18,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 11:29:18,430 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 56 [2022-07-13 11:29:18,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:18,431 INFO L225 Difference]: With dead ends: 625 [2022-07-13 11:29:18,431 INFO L226 Difference]: Without dead ends: 594 [2022-07-13 11:29:18,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-13 11:29:18,432 INFO L413 NwaCegarLoop]: 397 mSDtfsCounter, 282 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:18,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 1506 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:29:18,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-07-13 11:29:18,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 576. [2022-07-13 11:29:18,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 489 states have (on average 1.261758691206544) internal successors, (617), 496 states have internal predecessors, (617), 51 states have call successors, (51), 28 states have call predecessors, (51), 35 states have return successors, (61), 51 states have call predecessors, (61), 46 states have call successors, (61) [2022-07-13 11:29:18,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 729 transitions. [2022-07-13 11:29:18,461 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 729 transitions. Word has length 56 [2022-07-13 11:29:18,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:18,461 INFO L495 AbstractCegarLoop]: Abstraction has 576 states and 729 transitions. [2022-07-13 11:29:18,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 11:29:18,462 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 729 transitions. [2022-07-13 11:29:18,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-13 11:29:18,463 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:18,463 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, 1, 1, 1] [2022-07-13 11:29:18,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-07-13 11:29:18,463 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:18,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:18,464 INFO L85 PathProgramCache]: Analyzing trace with hash -252914767, now seen corresponding path program 1 times [2022-07-13 11:29:18,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:18,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983319107] [2022-07-13 11:29:18,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:18,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:18,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 11:29:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:18,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 11:29:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:18,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:18,577 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:29:18,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:18,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983319107] [2022-07-13 11:29:18,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983319107] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:18,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:18,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-13 11:29:18,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595896502] [2022-07-13 11:29:18,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:18,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 11:29:18,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:18,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 11:29:18,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:29:18,580 INFO L87 Difference]: Start difference. First operand 576 states and 729 transitions. Second operand has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 11:29:19,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:19,286 INFO L93 Difference]: Finished difference Result 619 states and 778 transitions. [2022-07-13 11:29:19,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 11:29:19,286 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 56 [2022-07-13 11:29:19,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:19,288 INFO L225 Difference]: With dead ends: 619 [2022-07-13 11:29:19,288 INFO L226 Difference]: Without dead ends: 589 [2022-07-13 11:29:19,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-07-13 11:29:19,288 INFO L413 NwaCegarLoop]: 391 mSDtfsCounter, 260 mSDsluCounter, 2991 mSDsCounter, 0 mSdLazyCounter, 1369 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 3382 SdHoareTripleChecker+Invalid, 1467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:19,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 3382 Invalid, 1467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1369 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 11:29:19,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2022-07-13 11:29:19,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 571. [2022-07-13 11:29:19,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 485 states have (on average 1.2577319587628866) internal successors, (610), 492 states have internal predecessors, (610), 50 states have call successors, (50), 28 states have call predecessors, (50), 35 states have return successors, (59), 50 states have call predecessors, (59), 45 states have call successors, (59) [2022-07-13 11:29:19,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 719 transitions. [2022-07-13 11:29:19,319 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 719 transitions. Word has length 56 [2022-07-13 11:29:19,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:19,319 INFO L495 AbstractCegarLoop]: Abstraction has 571 states and 719 transitions. [2022-07-13 11:29:19,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 11:29:19,320 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 719 transitions. [2022-07-13 11:29:19,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-13 11:29:19,321 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:19,321 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, 1, 1, 1] [2022-07-13 11:29:19,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-07-13 11:29:19,322 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:19,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:19,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1867013461, now seen corresponding path program 1 times [2022-07-13 11:29:19,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:19,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77547131] [2022-07-13 11:29:19,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:19,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:19,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:19,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 11:29:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:19,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 11:29:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:19,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:19,377 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:29:19,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:19,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77547131] [2022-07-13 11:29:19,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77547131] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:19,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:19,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 11:29:19,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17495523] [2022-07-13 11:29:19,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:19,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 11:29:19,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:19,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 11:29:19,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:29:19,379 INFO L87 Difference]: Start difference. First operand 571 states and 719 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 11:29:19,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:19,777 INFO L93 Difference]: Finished difference Result 602 states and 751 transitions. [2022-07-13 11:29:19,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 11:29:19,778 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 56 [2022-07-13 11:29:19,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:19,779 INFO L225 Difference]: With dead ends: 602 [2022-07-13 11:29:19,779 INFO L226 Difference]: Without dead ends: 565 [2022-07-13 11:29:19,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-13 11:29:19,780 INFO L413 NwaCegarLoop]: 367 mSDtfsCounter, 170 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 1807 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:19,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 1807 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:29:19,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-07-13 11:29:19,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2022-07-13 11:29:19,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 480 states have (on average 1.2583333333333333) internal successors, (604), 487 states have internal predecessors, (604), 49 states have call successors, (49), 28 states have call predecessors, (49), 35 states have return successors, (58), 49 states have call predecessors, (58), 44 states have call successors, (58) [2022-07-13 11:29:19,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 711 transitions. [2022-07-13 11:29:19,819 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 711 transitions. Word has length 56 [2022-07-13 11:29:19,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:19,819 INFO L495 AbstractCegarLoop]: Abstraction has 565 states and 711 transitions. [2022-07-13 11:29:19,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 11:29:19,820 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 711 transitions. [2022-07-13 11:29:19,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-13 11:29:19,821 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:19,821 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, 1, 1, 1] [2022-07-13 11:29:19,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-07-13 11:29:19,821 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:19,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:19,822 INFO L85 PathProgramCache]: Analyzing trace with hash -929165957, now seen corresponding path program 1 times [2022-07-13 11:29:19,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:19,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553953494] [2022-07-13 11:29:19,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:19,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:19,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:19,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 11:29:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:19,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:19,913 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:29:19,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:19,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553953494] [2022-07-13 11:29:19,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553953494] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:19,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:19,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 11:29:19,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134521212] [2022-07-13 11:29:19,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:19,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:29:19,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:19,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:29:19,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:29:19,915 INFO L87 Difference]: Start difference. First operand 565 states and 711 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 8 states have internal predecessors, (51), 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:29:20,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:20,531 INFO L93 Difference]: Finished difference Result 722 states and 895 transitions. [2022-07-13 11:29:20,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 11:29:20,531 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 8 states have internal predecessors, (51), 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 56 [2022-07-13 11:29:20,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:20,533 INFO L225 Difference]: With dead ends: 722 [2022-07-13 11:29:20,533 INFO L226 Difference]: Without dead ends: 604 [2022-07-13 11:29:20,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-07-13 11:29:20,534 INFO L413 NwaCegarLoop]: 357 mSDtfsCounter, 217 mSDsluCounter, 2352 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 2709 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:20,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 2709 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 11:29:20,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2022-07-13 11:29:20,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 571. [2022-07-13 11:29:20,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 486 states have (on average 1.2469135802469136) internal successors, (606), 493 states have internal predecessors, (606), 49 states have call successors, (49), 28 states have call predecessors, (49), 35 states have return successors, (58), 49 states have call predecessors, (58), 44 states have call successors, (58) [2022-07-13 11:29:20,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 713 transitions. [2022-07-13 11:29:20,601 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 713 transitions. Word has length 56 [2022-07-13 11:29:20,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:20,602 INFO L495 AbstractCegarLoop]: Abstraction has 571 states and 713 transitions. [2022-07-13 11:29:20,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 8 states have internal predecessors, (51), 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:29:20,602 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 713 transitions. [2022-07-13 11:29:20,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-13 11:29:20,603 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:20,603 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:20,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-07-13 11:29:20,604 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:20,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:20,604 INFO L85 PathProgramCache]: Analyzing trace with hash -535968494, now seen corresponding path program 1 times [2022-07-13 11:29:20,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:20,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762912664] [2022-07-13 11:29:20,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:20,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:20,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 11:29:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:20,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 11:29:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:20,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 11:29:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:20,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:20,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:20,737 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:29:20,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:20,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762912664] [2022-07-13 11:29:20,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762912664] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:20,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:20,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-13 11:29:20,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722184238] [2022-07-13 11:29:20,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:20,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 11:29:20,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:20,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 11:29:20,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:29:20,739 INFO L87 Difference]: Start difference. First operand 571 states and 713 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 10 states have internal predecessors, (53), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-13 11:29:21,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:21,408 INFO L93 Difference]: Finished difference Result 591 states and 734 transitions. [2022-07-13 11:29:21,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 11:29:21,409 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 10 states have internal predecessors, (53), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 62 [2022-07-13 11:29:21,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:21,410 INFO L225 Difference]: With dead ends: 591 [2022-07-13 11:29:21,410 INFO L226 Difference]: Without dead ends: 569 [2022-07-13 11:29:21,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-07-13 11:29:21,411 INFO L413 NwaCegarLoop]: 364 mSDtfsCounter, 235 mSDsluCounter, 2696 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 3060 SdHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:21,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 3060 Invalid, 1419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 11:29:21,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2022-07-13 11:29:21,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2022-07-13 11:29:21,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 484 states have (on average 1.2458677685950412) internal successors, (603), 491 states have internal predecessors, (603), 49 states have call successors, (49), 28 states have call predecessors, (49), 35 states have return successors, (58), 49 states have call predecessors, (58), 44 states have call successors, (58) [2022-07-13 11:29:21,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 710 transitions. [2022-07-13 11:29:21,440 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 710 transitions. Word has length 62 [2022-07-13 11:29:21,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:21,440 INFO L495 AbstractCegarLoop]: Abstraction has 569 states and 710 transitions. [2022-07-13 11:29:21,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 10 states have internal predecessors, (53), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-13 11:29:21,441 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 710 transitions. [2022-07-13 11:29:21,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-13 11:29:21,441 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:21,442 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:21,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-07-13 11:29:21,442 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:21,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:21,442 INFO L85 PathProgramCache]: Analyzing trace with hash -274878733, now seen corresponding path program 1 times [2022-07-13 11:29:21,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:21,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798487094] [2022-07-13 11:29:21,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:21,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:21,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 11:29:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:21,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 11:29:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:21,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-13 11:29:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:21,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:21,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:29:21,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:21,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798487094] [2022-07-13 11:29:21,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798487094] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:21,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:21,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 11:29:21,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752312460] [2022-07-13 11:29:21,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:21,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 11:29:21,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:21,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 11:29:21,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:29:21,513 INFO L87 Difference]: Start difference. First operand 569 states and 710 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:29:21,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:21,903 INFO L93 Difference]: Finished difference Result 600 states and 742 transitions. [2022-07-13 11:29:21,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 11:29:21,903 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 63 [2022-07-13 11:29:21,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:21,905 INFO L225 Difference]: With dead ends: 600 [2022-07-13 11:29:21,905 INFO L226 Difference]: Without dead ends: 553 [2022-07-13 11:29:21,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-13 11:29:21,906 INFO L413 NwaCegarLoop]: 345 mSDtfsCounter, 170 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 1671 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:21,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 1671 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 11:29:21,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2022-07-13 11:29:21,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2022-07-13 11:29:21,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 471 states have (on average 1.2420382165605095) internal successors, (585), 478 states have internal predecessors, (585), 46 states have call successors, (46), 28 states have call predecessors, (46), 35 states have return successors, (54), 46 states have call predecessors, (54), 41 states have call successors, (54) [2022-07-13 11:29:21,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 685 transitions. [2022-07-13 11:29:21,949 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 685 transitions. Word has length 63 [2022-07-13 11:29:21,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:21,949 INFO L495 AbstractCegarLoop]: Abstraction has 553 states and 685 transitions. [2022-07-13 11:29:21,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:29:21,949 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 685 transitions. [2022-07-13 11:29:21,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 11:29:21,950 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:21,951 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, 1, 1, 1, 1, 1] [2022-07-13 11:29:21,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-07-13 11:29:21,951 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:21,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:21,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1927582732, now seen corresponding path program 1 times [2022-07-13 11:29:21,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:21,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901155201] [2022-07-13 11:29:21,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:21,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:21,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 11:29:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:21,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 11:29:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:22,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:22,002 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:29:22,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:22,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901155201] [2022-07-13 11:29:22,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901155201] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:22,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:22,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 11:29:22,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198101056] [2022-07-13 11:29:22,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:22,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 11:29:22,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:22,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 11:29:22,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:29:22,004 INFO L87 Difference]: Start difference. First operand 553 states and 685 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 11:29:22,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:22,316 INFO L93 Difference]: Finished difference Result 584 states and 717 transitions. [2022-07-13 11:29:22,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 11:29:22,316 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 58 [2022-07-13 11:29:22,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:22,318 INFO L225 Difference]: With dead ends: 584 [2022-07-13 11:29:22,318 INFO L226 Difference]: Without dead ends: 540 [2022-07-13 11:29:22,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-13 11:29:22,319 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 264 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:22,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1240 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:29:22,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-07-13 11:29:22,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2022-07-13 11:29:22,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 459 states have (on average 1.2374727668845316) internal successors, (568), 466 states have internal predecessors, (568), 45 states have call successors, (45), 28 states have call predecessors, (45), 35 states have return successors, (53), 45 states have call predecessors, (53), 40 states have call successors, (53) [2022-07-13 11:29:22,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 666 transitions. [2022-07-13 11:29:22,366 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 666 transitions. Word has length 58 [2022-07-13 11:29:22,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:22,366 INFO L495 AbstractCegarLoop]: Abstraction has 540 states and 666 transitions. [2022-07-13 11:29:22,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 11:29:22,367 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 666 transitions. [2022-07-13 11:29:22,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-13 11:29:22,368 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:22,368 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:22,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-07-13 11:29:22,368 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:22,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:22,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1948179698, now seen corresponding path program 1 times [2022-07-13 11:29:22,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:22,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144546289] [2022-07-13 11:29:22,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:22,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:22,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 11:29:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:22,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 11:29:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:22,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:22,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:22,534 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:29:22,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:22,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144546289] [2022-07-13 11:29:22,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144546289] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:22,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:22,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-13 11:29:22,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133150283] [2022-07-13 11:29:22,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:22,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 11:29:22,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:22,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 11:29:22,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-07-13 11:29:22,537 INFO L87 Difference]: Start difference. First operand 540 states and 666 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:29:23,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:23,306 INFO L93 Difference]: Finished difference Result 556 states and 682 transitions. [2022-07-13 11:29:23,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 11:29:23,307 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 64 [2022-07-13 11:29:23,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:23,309 INFO L225 Difference]: With dead ends: 556 [2022-07-13 11:29:23,309 INFO L226 Difference]: Without dead ends: 535 [2022-07-13 11:29:23,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-07-13 11:29:23,309 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 207 mSDsluCounter, 2323 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 2652 SdHoareTripleChecker+Invalid, 1421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:23,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 2652 Invalid, 1421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 11:29:23,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2022-07-13 11:29:23,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2022-07-13 11:29:23,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 456 states have (on average 1.236842105263158) internal successors, (564), 463 states have internal predecessors, (564), 43 states have call successors, (43), 28 states have call predecessors, (43), 35 states have return successors, (51), 43 states have call predecessors, (51), 38 states have call successors, (51) [2022-07-13 11:29:23,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 658 transitions. [2022-07-13 11:29:23,337 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 658 transitions. Word has length 64 [2022-07-13 11:29:23,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:23,337 INFO L495 AbstractCegarLoop]: Abstraction has 535 states and 658 transitions. [2022-07-13 11:29:23,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:29:23,338 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 658 transitions. [2022-07-13 11:29:23,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 11:29:23,338 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:23,338 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, 1, 1, 1, 1] [2022-07-13 11:29:23,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-07-13 11:29:23,338 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:23,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:23,339 INFO L85 PathProgramCache]: Analyzing trace with hash 233509778, now seen corresponding path program 1 times [2022-07-13 11:29:23,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:23,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309068055] [2022-07-13 11:29:23,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:23,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:23,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 11:29:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:23,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:23,488 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:29:23,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:23,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309068055] [2022-07-13 11:29:23,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309068055] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:23,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:23,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-13 11:29:23,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095611920] [2022-07-13 11:29:23,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:23,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 11:29:23,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:23,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 11:29:23,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-13 11:29:23,490 INFO L87 Difference]: Start difference. First operand 535 states and 658 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 9 states have internal predecessors, (52), 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:29:23,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:23,983 INFO L93 Difference]: Finished difference Result 537 states and 659 transitions. [2022-07-13 11:29:23,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 11:29:23,984 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 9 states have internal predecessors, (52), 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 57 [2022-07-13 11:29:23,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:23,984 INFO L225 Difference]: With dead ends: 537 [2022-07-13 11:29:23,985 INFO L226 Difference]: Without dead ends: 493 [2022-07-13 11:29:23,985 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:29:23,985 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 115 mSDsluCounter, 2211 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 2522 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:23,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 2522 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 11:29:23,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2022-07-13 11:29:24,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2022-07-13 11:29:24,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 419 states have (on average 1.2458233890214798) internal successors, (522), 425 states have internal predecessors, (522), 40 states have call successors, (40), 26 states have call predecessors, (40), 33 states have return successors, (49), 41 states have call predecessors, (49), 36 states have call successors, (49) [2022-07-13 11:29:24,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 611 transitions. [2022-07-13 11:29:24,013 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 611 transitions. Word has length 57 [2022-07-13 11:29:24,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:24,014 INFO L495 AbstractCegarLoop]: Abstraction has 493 states and 611 transitions. [2022-07-13 11:29:24,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 9 states have internal predecessors, (52), 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:29:24,014 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 611 transitions. [2022-07-13 11:29:24,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 11:29:24,015 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:24,015 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, 1, 1, 1, 1, 1] [2022-07-13 11:29:24,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-07-13 11:29:24,015 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:24,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:24,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1034079897, now seen corresponding path program 1 times [2022-07-13 11:29:24,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:24,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554778327] [2022-07-13 11:29:24,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:24,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:24,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 11:29:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:24,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:24,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:24,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 11:29:24,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:24,164 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:29:24,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:24,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554778327] [2022-07-13 11:29:24,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554778327] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:24,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:24,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 11:29:24,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071106520] [2022-07-13 11:29:24,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:24,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:29:24,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:24,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:29:24,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:29:24,166 INFO L87 Difference]: Start difference. First operand 493 states and 611 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 11:29:25,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:25,284 INFO L93 Difference]: Finished difference Result 1028 states and 1263 transitions. [2022-07-13 11:29:25,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-13 11:29:25,284 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 58 [2022-07-13 11:29:25,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:25,286 INFO L225 Difference]: With dead ends: 1028 [2022-07-13 11:29:25,287 INFO L226 Difference]: Without dead ends: 908 [2022-07-13 11:29:25,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=273, Invalid=1287, Unknown=0, NotChecked=0, Total=1560 [2022-07-13 11:29:25,288 INFO L413 NwaCegarLoop]: 356 mSDtfsCounter, 686 mSDsluCounter, 1881 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 2237 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:25,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 2237 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1211 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 11:29:25,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2022-07-13 11:29:25,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 717. [2022-07-13 11:29:25,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 604 states have (on average 1.2450331125827814) internal successors, (752), 616 states have internal predecessors, (752), 59 states have call successors, (59), 42 states have call predecessors, (59), 53 states have return successors, (75), 58 states have call predecessors, (75), 55 states have call successors, (75) [2022-07-13 11:29:25,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 886 transitions. [2022-07-13 11:29:25,360 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 886 transitions. Word has length 58 [2022-07-13 11:29:25,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:25,361 INFO L495 AbstractCegarLoop]: Abstraction has 717 states and 886 transitions. [2022-07-13 11:29:25,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 11:29:25,361 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 886 transitions. [2022-07-13 11:29:25,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 11:29:25,362 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:25,362 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, 1, 1, 1, 1, 1] [2022-07-13 11:29:25,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-07-13 11:29:25,363 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:25,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:25,363 INFO L85 PathProgramCache]: Analyzing trace with hash -158060891, now seen corresponding path program 1 times [2022-07-13 11:29:25,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:25,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62475159] [2022-07-13 11:29:25,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:25,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:25,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:25,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 11:29:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:25,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:25,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 11:29:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:25,411 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:29:25,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:25,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62475159] [2022-07-13 11:29:25,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62475159] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:25,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:25,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 11:29:25,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045704769] [2022-07-13 11:29:25,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:25,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 11:29:25,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:25,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 11:29:25,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:29:25,413 INFO L87 Difference]: Start difference. First operand 717 states and 886 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 11:29:25,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:25,898 INFO L93 Difference]: Finished difference Result 1014 states and 1243 transitions. [2022-07-13 11:29:25,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 11:29:25,898 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 58 [2022-07-13 11:29:25,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:25,900 INFO L225 Difference]: With dead ends: 1014 [2022-07-13 11:29:25,900 INFO L226 Difference]: Without dead ends: 905 [2022-07-13 11:29:25,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-07-13 11:29:25,901 INFO L413 NwaCegarLoop]: 557 mSDtfsCounter, 789 mSDsluCounter, 1319 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 1876 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:25,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 1876 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 11:29:25,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2022-07-13 11:29:25,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 537. [2022-07-13 11:29:25,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 458 states have (on average 1.2314410480349345) internal successors, (564), 464 states have internal predecessors, (564), 42 states have call successors, (42), 30 states have call predecessors, (42), 36 states have return successors, (51), 42 states have call predecessors, (51), 38 states have call successors, (51) [2022-07-13 11:29:25,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 657 transitions. [2022-07-13 11:29:25,946 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 657 transitions. Word has length 58 [2022-07-13 11:29:25,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:25,946 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 657 transitions. [2022-07-13 11:29:25,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 11:29:25,947 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 657 transitions. [2022-07-13 11:29:25,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-13 11:29:25,947 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:25,947 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:29:25,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-07-13 11:29:25,948 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:25,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:25,948 INFO L85 PathProgramCache]: Analyzing trace with hash 273629316, now seen corresponding path program 1 times [2022-07-13 11:29:25,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:25,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629987005] [2022-07-13 11:29:25,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:25,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:25,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:26,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-13 11:29:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:26,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 11:29:26,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:26,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 11:29:26,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:26,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 11:29:26,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:26,077 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:29:26,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:26,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629987005] [2022-07-13 11:29:26,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629987005] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:26,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:26,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-13 11:29:26,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175302209] [2022-07-13 11:29:26,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:26,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 11:29:26,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:26,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 11:29:26,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:29:26,080 INFO L87 Difference]: Start difference. First operand 537 states and 657 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 10 states have internal predecessors, (51), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-13 11:29:26,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:26,734 INFO L93 Difference]: Finished difference Result 554 states and 674 transitions. [2022-07-13 11:29:26,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 11:29:26,735 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 10 states have internal predecessors, (51), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 60 [2022-07-13 11:29:26,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:26,736 INFO L225 Difference]: With dead ends: 554 [2022-07-13 11:29:26,736 INFO L226 Difference]: Without dead ends: 504 [2022-07-13 11:29:26,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-07-13 11:29:26,737 INFO L413 NwaCegarLoop]: 296 mSDtfsCounter, 218 mSDsluCounter, 2081 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 2377 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:26,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 2377 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 11:29:26,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2022-07-13 11:29:26,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2022-07-13 11:29:26,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 432 states have (on average 1.2222222222222223) internal successors, (528), 438 states have internal predecessors, (528), 37 states have call successors, (37), 28 states have call predecessors, (37), 34 states have return successors, (45), 37 states have call predecessors, (45), 33 states have call successors, (45) [2022-07-13 11:29:26,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 610 transitions. [2022-07-13 11:29:26,787 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 610 transitions. Word has length 60 [2022-07-13 11:29:26,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:26,787 INFO L495 AbstractCegarLoop]: Abstraction has 504 states and 610 transitions. [2022-07-13 11:29:26,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 10 states have internal predecessors, (51), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-13 11:29:26,788 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 610 transitions. [2022-07-13 11:29:26,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 11:29:26,789 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:26,789 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, 1, 1, 1, 1, 1] [2022-07-13 11:29:26,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-07-13 11:29:26,789 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:26,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:26,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1406802114, now seen corresponding path program 1 times [2022-07-13 11:29:26,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:26,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485418183] [2022-07-13 11:29:26,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:26,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:26,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:26,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 11:29:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:26,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 11:29:26,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:29:26,834 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:29:26,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:29:26,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485418183] [2022-07-13 11:29:26,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485418183] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:29:26,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:29:26,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 11:29:26,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210758456] [2022-07-13 11:29:26,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:29:26,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 11:29:26,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:29:26,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 11:29:26,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:29:26,836 INFO L87 Difference]: Start difference. First operand 504 states and 610 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 11:29:27,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:29:27,068 INFO L93 Difference]: Finished difference Result 531 states and 638 transitions. [2022-07-13 11:29:27,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 11:29:27,069 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 58 [2022-07-13 11:29:27,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:29:27,070 INFO L225 Difference]: With dead ends: 531 [2022-07-13 11:29:27,070 INFO L226 Difference]: Without dead ends: 494 [2022-07-13 11:29:27,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:29:27,071 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 67 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:29:27,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 1135 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:29:27,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2022-07-13 11:29:27,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2022-07-13 11:29:27,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 423 states have (on average 1.2222222222222223) internal successors, (517), 429 states have internal predecessors, (517), 36 states have call successors, (36), 28 states have call predecessors, (36), 34 states have return successors, (43), 36 states have call predecessors, (43), 32 states have call successors, (43) [2022-07-13 11:29:27,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 596 transitions. [2022-07-13 11:29:27,108 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 596 transitions. Word has length 58 [2022-07-13 11:29:27,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:29:27,109 INFO L495 AbstractCegarLoop]: Abstraction has 494 states and 596 transitions. [2022-07-13 11:29:27,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 11:29:27,109 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 596 transitions. [2022-07-13 11:29:27,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 11:29:27,110 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:29:27,110 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, 1, 1, 1, 1, 1] [2022-07-13 11:29:27,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-07-13 11:29:27,110 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:29:27,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:29:27,110 INFO L85 PathProgramCache]: Analyzing trace with hash 472047151, now seen corresponding path program 1 times [2022-07-13 11:29:27,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:29:27,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469647694] [2022-07-13 11:29:27,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:29:27,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:29:27,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 11:29:27,124 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 11:29:27,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 11:29:27,169 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 11:29:27,169 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 11:29:27,170 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 11:29:27,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-07-13 11:29:27,174 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:27,177 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 11:29:27,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 11:29:27 BoogieIcfgContainer [2022-07-13 11:29:27,262 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 11:29:27,263 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 11:29:27,263 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 11:29:27,263 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 11:29:27,263 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:28:48" (3/4) ... [2022-07-13 11:29:27,265 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 11:29:27,323 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 11:29:27,323 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 11:29:27,324 INFO L158 Benchmark]: Toolchain (without parser) took 41174.78ms. Allocated memory was 100.7MB in the beginning and 346.0MB in the end (delta: 245.4MB). Free memory was 67.0MB in the beginning and 287.9MB in the end (delta: -220.9MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2022-07-13 11:29:27,324 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 100.7MB. Free memory was 54.5MB in the beginning and 54.5MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 11:29:27,324 INFO L158 Benchmark]: CACSL2BoogieTranslator took 528.21ms. Allocated memory is still 100.7MB. Free memory was 66.8MB in the beginning and 59.1MB in the end (delta: 7.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 11:29:27,324 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.20ms. Allocated memory is still 100.7MB. Free memory was 59.1MB in the beginning and 51.9MB in the end (delta: 7.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 11:29:27,325 INFO L158 Benchmark]: Boogie Preprocessor took 77.80ms. Allocated memory is still 100.7MB. Free memory was 51.9MB in the beginning and 47.5MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 11:29:27,325 INFO L158 Benchmark]: RCFGBuilder took 1214.88ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 47.0MB in the beginning and 75.6MB in the end (delta: -28.6MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. [2022-07-13 11:29:27,325 INFO L158 Benchmark]: TraceAbstraction took 39199.03ms. Allocated memory was 121.6MB in the beginning and 346.0MB in the end (delta: 224.4MB). Free memory was 75.0MB in the beginning and 297.3MB in the end (delta: -222.4MB). Peak memory consumption was 196.0MB. Max. memory is 16.1GB. [2022-07-13 11:29:27,325 INFO L158 Benchmark]: Witness Printer took 60.80ms. Allocated memory is still 346.0MB. Free memory was 296.3MB in the beginning and 287.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 11:29:27,326 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 100.7MB. Free memory was 54.5MB in the beginning and 54.5MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 528.21ms. Allocated memory is still 100.7MB. Free memory was 66.8MB in the beginning and 59.1MB in the end (delta: 7.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.20ms. Allocated memory is still 100.7MB. Free memory was 59.1MB in the beginning and 51.9MB in the end (delta: 7.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.80ms. Allocated memory is still 100.7MB. Free memory was 51.9MB in the beginning and 47.5MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1214.88ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 47.0MB in the beginning and 75.6MB in the end (delta: -28.6MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. * TraceAbstraction took 39199.03ms. Allocated memory was 121.6MB in the beginning and 346.0MB in the end (delta: 224.4MB). Free memory was 75.0MB in the beginning and 297.3MB in the end (delta: -222.4MB). Peak memory consumption was 196.0MB. Max. memory is 16.1GB. * Witness Printer took 60.80ms. Allocated memory is still 346.0MB. Free memory was 296.3MB in the beginning and 287.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 59]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int s ; [L33] int UNLOADED ; [L34] int NP ; [L35] int DC ; [L36] int SKIP1 ; [L37] int SKIP2 ; [L38] int MPR1 ; [L39] int MPR3 ; [L40] int IPC ; [L41] int pended ; [L42] int compFptr ; [L43] int compRegistered ; [L44] int lowerDriverReturn ; [L45] int setEventCalled ; [L46] int customIrp ; [L47] int routine ; [L48] int myStatus ; [L49] int pirp ; [L50] int Executive ; [L51] int Suspended ; [L52] int KernelMode ; [L53] int DeviceUsageTypePaging ; VAL [compFptr=0, compRegistered=0, customIrp=0, DC=0, DeviceUsageTypePaging=0, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, pirp=0, routine=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, Suspended=0, UNLOADED=0] [L1718] int pirp__IoStatus__Status ; [L1719] int d = __VERIFIER_nondet_int() ; [L1720] int status = __VERIFIER_nondet_int() ; [L1721] int irp = __VERIFIER_nondet_int() ; [L1722] int we_should_unload = __VERIFIER_nondet_int() ; [L1723] int irp_choice = __VERIFIER_nondet_int() ; [L1724] int devobj = __VERIFIER_nondet_int() ; [L1725] int __cil_tmp9 ; [L1730] s = 0 [L1731] UNLOADED = 0 [L1732] NP = 0 [L1733] DC = 0 [L1734] SKIP1 = 0 [L1735] SKIP2 = 0 [L1736] MPR1 = 0 [L1737] MPR3 = 0 [L1738] IPC = 0 [L1739] pended = 0 [L1740] compFptr = 0 [L1741] compRegistered = 0 [L1742] lowerDriverReturn = 0 [L1743] setEventCalled = 0 [L1744] customIrp = 0 [L1745] routine = 0 [L1746] myStatus = 0 [L1747] pirp = 0 [L1748] Executive = 0 [L1749] Suspended = 5 [L1750] KernelMode = 0 [L1751] DeviceUsageTypePaging = 1 [L1754] pirp = irp [L1755] CALL _BLAST_init() [L67] UNLOADED = 0 [L68] NP = 1 [L69] DC = 2 [L70] SKIP1 = 3 [L71] SKIP2 = 4 [L72] MPR1 = 5 [L73] MPR3 = 6 [L74] IPC = 7 [L75] s = UNLOADED [L76] pended = 0 [L77] compFptr = 0 [L78] compRegistered = 0 [L79] lowerDriverReturn = 0 [L80] setEventCalled = 0 [L81] customIrp = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, routine=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1755] RET _BLAST_init() [L1757] COND TRUE status >= 0 [L1758] s = NP [L1759] customIrp = 0 [L1760] setEventCalled = customIrp [L1761] lowerDriverReturn = setEventCalled [L1762] compRegistered = lowerDriverReturn [L1763] compFptr = compRegistered [L1764] pended = compFptr [L1765] pirp__IoStatus__Status = 0 [L1766] myStatus = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0, we_should_unload=0] [L1767] COND TRUE irp_choice == 0 [L1768] pirp__IoStatus__Status = -1073741637 [L1769] myStatus = -1073741637 VAL [compFptr=0, compRegistered=0, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0, we_should_unload=0] [L1772] CALL stub_driver_init() [L1707] s = NP [L1708] customIrp = 0 [L1709] setEventCalled = customIrp [L1710] lowerDriverReturn = setEventCalled [L1711] compRegistered = lowerDriverReturn [L1712] compFptr = compRegistered [L1713] pended = compFptr VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1772] RET stub_driver_init() [L1775] COND FALSE !(status < 0) [L1779] int tmp_ndt_1; [L1780] tmp_ndt_1 = __VERIFIER_nondet_int() [L1781] COND TRUE tmp_ndt_1 == 2 VAL [compFptr=0, compRegistered=0, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1798] CALL, EXPR CdAudioDeviceControl(devobj, pirp) [L313] int deviceExtension__Active = __VERIFIER_nondet_int() ; [L314] int status ; VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L317] COND FALSE !(deviceExtension__Active == 2) VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L320] COND FALSE !(deviceExtension__Active == 3) VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L323] COND FALSE !(deviceExtension__Active == 1) VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L326] COND TRUE deviceExtension__Active == 7 VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L348] CALL, EXPR CdAudioHPCdrDeviceControl(DeviceObject, Irp) [L1591] int currentIrpStack__Parameters__DeviceIoControl__IoControlCode = __VERIFIER_nondet_int() ; [L1592] int deviceExtension__TargetDeviceObject = __VERIFIER_nondet_int() ; [L1593] int irpSp__Control ; [L1594] int tmp ; [L1595] int tmp___0 ; [L1596] int __cil_tmp8 ; [L1597] int __cil_tmp9 ; [L1598] int __cil_tmp10 ; [L1599] int __cil_tmp11 ; [L1600] int __cil_tmp12 ; [L1604] __cil_tmp8 = 56 [L1605] __cil_tmp9 = 16384 [L1606] __cil_tmp10 = 131072 [L1607] __cil_tmp11 = 147456 [L1608] __cil_tmp12 = 147512 VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=0, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1609] COND TRUE currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp12 VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=0, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1610] COND FALSE !(s != NP) VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=0, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1615] COND FALSE !(compRegistered != 0) [L1620] compRegistered = 1 [L1621] routine = 0 VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1625] irpSp__Control = 224 VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, irpSp__Control=224, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1626] CALL, EXPR IofCallDriver(deviceExtension__TargetDeviceObject, Irp) VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1900] int Irp__PendingReturned = __VERIFIER_nondet_int() ; [L1901] int returnVal2 ; [L1902] int compRetStatus ; [L1903] int lcontext = __VERIFIER_nondet_int() ; [L1904] unsigned long __cil_tmp8 ; VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1907] COND TRUE \read(compRegistered) VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1908] COND TRUE routine == 0 VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1910] CALL, EXPR HPCdrCompletion(DeviceObject, Irp, lcontext) VAL [\old(Context)=-1, \old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1569] int Irp__PendingReturned = __VERIFIER_nondet_int() ; [L1570] int Irp__AssociatedIrp__SystemBuffer = __VERIFIER_nondet_int() ; [L1573] COND TRUE \read(Irp__PendingReturned) VAL [\old(Context)=-1, \old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, Context=-1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__AssociatedIrp__SystemBuffer=0, Irp__PendingReturned=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1574] COND TRUE pended == 0 [L1575] pended = 1 VAL [\old(Context)=-1, \old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, Context=-1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__AssociatedIrp__SystemBuffer=0, Irp__PendingReturned=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1582] COND FALSE !(myStatus >= 0) VAL [\old(Context)=-1, \old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, Context=-1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__AssociatedIrp__SystemBuffer=0, Irp__PendingReturned=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1587] return (myStatus); VAL [\old(Context)=-1, \old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \result=-1073741637, compFptr=0, compRegistered=1, Context=-1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__AssociatedIrp__SystemBuffer=0, Irp__PendingReturned=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1910] RET, EXPR HPCdrCompletion(DeviceObject, Irp, lcontext) VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, HPCdrCompletion(DeviceObject, Irp, lcontext)=-1073741637, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1910] compRetStatus = HPCdrCompletion(DeviceObject, Irp, lcontext) [L1920] __cil_tmp8 = (unsigned long )compRetStatus VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1921] COND FALSE !(__cil_tmp8 == -1073741802) VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1928] COND FALSE !(\read(Irp__PendingReturned)) [L1931] int tmp_ndt_4; [L1932] tmp_ndt_4 = __VERIFIER_nondet_int() [L1933] COND TRUE tmp_ndt_4 == 0 VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1944] returnVal2 = 0 VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, returnVal2=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1958] COND TRUE s == NP [L1959] s = IPC [L1960] lowerDriverReturn = returnVal2 VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, returnVal2=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1981] return (returnVal2); VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \result=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, returnVal2=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1626] RET, EXPR IofCallDriver(deviceExtension__TargetDeviceObject, Irp) VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IofCallDriver(deviceExtension__TargetDeviceObject, Irp)=0, IPC=7, Irp=0, irpSp__Control=224, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1626] tmp = IofCallDriver(deviceExtension__TargetDeviceObject, Irp) [L1628] return (tmp); VAL [\old(DeviceObject)=0, \old(Irp)=0, \result=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, irpSp__Control=224, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp=0, UNLOADED=0] [L348] RET, EXPR CdAudioHPCdrDeviceControl(DeviceObject, Irp) [L348] status = CdAudioHPCdrDeviceControl(DeviceObject, Irp) [L363] return (status); VAL [\old(DeviceObject)=0, \old(Irp)=0, \result=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0] [L1798] RET, EXPR CdAudioDeviceControl(devobj, pirp) [L1798] status = CdAudioDeviceControl(devobj, pirp) [L1819] COND FALSE !(\read(we_should_unload)) VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1825] COND TRUE pended == 1 VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1826] COND FALSE !(s == NP) VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1833] COND TRUE pended == 1 VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1834] COND FALSE !(s == MPR3) VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1841] COND TRUE s != UNLOADED VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1842] COND TRUE status != -1 VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1843] COND TRUE s != SKIP2 VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1844] COND FALSE !(s != IPC) VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1857] COND FALSE !(pended != 1) VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1869] COND TRUE status != 259 VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1871] CALL errorFn() VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L59] reach_error() VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 14 procedures, 470 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.1s, OverallIterations: 68, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 29.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21671 SdHoareTripleChecker+Valid, 23.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21343 mSDsluCounter, 160326 SdHoareTripleChecker+Invalid, 19.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 125168 mSDsCounter, 5722 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 41904 IncrementalHoareTripleChecker+Invalid, 47626 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5722 mSolverCounterUnsat, 35158 mSDtfsCounter, 41904 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1098 GetRequests, 424 SyntacticMatches, 10 SemanticMatches, 664 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=821occurred in iteration=4, InterpolantAutomatonStates: 598, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 67 MinimizatonAttempts, 2265 StatesRemovedByMinimization, 46 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 3221 NumberOfCodeBlocks, 3221 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 3158 ConstructedInterpolants, 0 QuantifiedInterpolants, 8979 SizeOfPredicates, 4 NumberOfNonLiveVariables, 471 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 69 InterpolantComputations, 67 PerfectInterpolantSequences, 12/15 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-13 11:29:27,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE