./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 75fd132a1a39ad1f2927845122893235fdf65fe2225472c79a2e84525dcd60fe --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:43:25,581 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:43:25,582 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:43:25,604 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:43:25,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:43:25,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:43:25,609 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:43:25,613 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:43:25,614 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:43:25,619 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:43:25,620 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:43:25,621 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:43:25,622 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:43:25,623 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:43:25,625 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:43:25,626 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:43:25,627 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:43:25,628 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:43:25,631 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:43:25,632 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:43:25,635 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:43:25,636 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:43:25,637 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:43:25,638 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:43:25,639 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:43:25,642 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:43:25,642 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:43:25,643 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:43:25,644 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:43:25,644 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:43:25,645 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:43:25,645 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:43:25,646 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:43:25,646 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:43:25,647 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:43:25,647 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:43:25,648 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:43:25,648 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:43:25,648 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:43:25,648 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:43:25,649 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:43:25,650 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:43:25,651 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 23:43:25,677 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:43:25,678 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:43:25,679 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:43:25,679 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:43:25,679 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:43:25,680 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:43:25,680 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:43:25,680 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:43:25,680 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:43:25,681 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:43:25,681 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:43:25,681 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:43:25,682 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:43:25,682 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:43:25,682 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:43:25,682 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:43:25,682 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:43:25,682 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:43:25,683 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:43:25,683 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:43:25,683 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:43:25,684 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:43:25,684 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:43:25,684 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:43:25,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:43:25,684 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:43:25,684 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:43:25,685 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:43:25,685 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:43:25,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:43:25,685 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:43:25,685 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:43:25,685 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:43:25,686 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 -> 75fd132a1a39ad1f2927845122893235fdf65fe2225472c79a2e84525dcd60fe [2022-07-11 23:43:25,867 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:43:25,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:43:25,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:43:25,885 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:43:25,885 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:43:25,886 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-2.c [2022-07-11 23:43:25,928 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d5b7c640/9db859cce12742828cd11f92ece80ed1/FLAG8c31e7553 [2022-07-11 23:43:26,369 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:43:26,370 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-2.c [2022-07-11 23:43:26,380 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d5b7c640/9db859cce12742828cd11f92ece80ed1/FLAG8c31e7553 [2022-07-11 23:43:26,388 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d5b7c640/9db859cce12742828cd11f92ece80ed1 [2022-07-11 23:43:26,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:43:26,391 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:43:26,392 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:43:26,392 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:43:26,394 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:43:26,394 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:43:26" (1/1) ... [2022-07-11 23:43:26,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bd76a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:43:26, skipping insertion in model container [2022-07-11 23:43:26,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:43:26" (1/1) ... [2022-07-11 23:43:26,422 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:43:26,477 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:43:26,623 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-2.c[2073,2086] [2022-07-11 23:43:26,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:43:26,792 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:43:26,811 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-2.c[2073,2086] [2022-07-11 23:43:26,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:43:26,877 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:43:26,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:43:26 WrapperNode [2022-07-11 23:43:26,879 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:43:26,880 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:43:26,880 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:43:26,880 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:43:26,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:43:26" (1/1) ... [2022-07-11 23:43:26,908 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:43:26" (1/1) ... [2022-07-11 23:43:26,965 INFO L137 Inliner]: procedures = 41, calls = 107, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 1581 [2022-07-11 23:43:26,965 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:43:26,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:43:26,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:43:26,966 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:43:26,972 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:43:26" (1/1) ... [2022-07-11 23:43:26,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:43:26" (1/1) ... [2022-07-11 23:43:26,979 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:43:26" (1/1) ... [2022-07-11 23:43:26,979 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:43:26" (1/1) ... [2022-07-11 23:43:27,000 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:43:26" (1/1) ... [2022-07-11 23:43:27,007 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:43:26" (1/1) ... [2022-07-11 23:43:27,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:43:26" (1/1) ... [2022-07-11 23:43:27,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:43:27,032 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:43:27,032 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:43:27,032 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:43:27,037 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:43:26" (1/1) ... [2022-07-11 23:43:27,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:43:27,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:43:27,064 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-11 23:43:27,097 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-11 23:43:27,118 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2022-07-11 23:43:27,119 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2022-07-11 23:43:27,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:43:27,120 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2022-07-11 23:43:27,120 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2022-07-11 23:43:27,120 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-07-11 23:43:27,120 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-07-11 23:43:27,120 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2022-07-11 23:43:27,120 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2022-07-11 23:43:27,120 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-07-11 23:43:27,121 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-07-11 23:43:27,121 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-07-11 23:43:27,121 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-07-11 23:43:27,121 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2022-07-11 23:43:27,121 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2022-07-11 23:43:27,121 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-07-11 23:43:27,121 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-07-11 23:43:27,122 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2022-07-11 23:43:27,122 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2022-07-11 23:43:27,122 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-07-11 23:43:27,122 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-07-11 23:43:27,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:43:27,122 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-07-11 23:43:27,122 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-07-11 23:43:27,122 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2022-07-11 23:43:27,123 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2022-07-11 23:43:27,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:43:27,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:43:27,123 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2022-07-11 23:43:27,123 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2022-07-11 23:43:27,315 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:43:27,316 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:43:27,389 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:43:27,415 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-07-11 23:43:27,416 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-07-11 23:43:27,448 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:43:27,471 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-07-11 23:43:27,471 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-07-11 23:43:27,476 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:43:27,476 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:43:27,480 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:43:27,488 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:43:27,498 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:43:27,500 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:43:27,503 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:43:27,993 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: CdAudioPnp_#res#1 := 0; [2022-07-11 23:43:27,993 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##258: assume !false; [2022-07-11 23:43:27,994 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##257: assume false; [2022-07-11 23:43:27,994 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##286: assume !false; [2022-07-11 23:43:27,994 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##285: assume false; [2022-07-11 23:43:27,994 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume !false; [2022-07-11 23:43:27,994 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume false; [2022-07-11 23:43:27,994 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##133: assume false; [2022-07-11 23:43:27,994 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##134: assume !false; [2022-07-11 23:43:27,995 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume !false; [2022-07-11 23:43:27,995 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume false; [2022-07-11 23:43:27,995 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-07-11 23:43:27,996 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-07-11 23:43:27,996 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##331: assume false; [2022-07-11 23:43:27,996 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##332: assume !false; [2022-07-11 23:43:28,030 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:43:28,043 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:43:28,043 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-11 23:43:28,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:43:28 BoogieIcfgContainer [2022-07-11 23:43:28,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:43:28,047 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:43:28,047 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:43:28,049 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:43:28,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:43:26" (1/3) ... [2022-07-11 23:43:28,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3666b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:43:28, skipping insertion in model container [2022-07-11 23:43:28,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:43:26" (2/3) ... [2022-07-11 23:43:28,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3666b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:43:28, skipping insertion in model container [2022-07-11 23:43:28,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:43:28" (3/3) ... [2022-07-11 23:43:28,051 INFO L111 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-2.c [2022-07-11 23:43:28,060 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:43:28,060 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:43:28,127 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:43:28,138 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@3fb08877, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5c4f73f1 [2022-07-11 23:43:28,138 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:43:28,153 INFO L276 IsEmpty]: Start isEmpty. Operand has 468 states, 367 states have (on average 1.5068119891008174) internal successors, (553), 385 states have internal predecessors, (553), 86 states have call successors, (86), 13 states have call predecessors, (86), 13 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2022-07-11 23:43:28,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-11 23:43:28,159 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:28,159 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:28,160 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:28,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:28,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1469618272, now seen corresponding path program 1 times [2022-07-11 23:43:28,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:28,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972442364] [2022-07-11 23:43:28,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:28,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:28,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:28,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:28,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972442364] [2022-07-11 23:43:28,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972442364] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:28,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:28,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:43:28,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711512848] [2022-07-11 23:43:28,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:28,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:43:28,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:28,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:43:28,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:43:28,361 INFO L87 Difference]: Start difference. First operand has 468 states, 367 states have (on average 1.5068119891008174) internal successors, (553), 385 states have internal predecessors, (553), 86 states have call successors, (86), 13 states have call predecessors, (86), 13 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) 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-11 23:43:28,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:28,508 INFO L93 Difference]: Finished difference Result 809 states and 1294 transitions. [2022-07-11 23:43:28,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:43:28,510 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-11 23:43:28,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:28,521 INFO L225 Difference]: With dead ends: 809 [2022-07-11 23:43:28,521 INFO L226 Difference]: Without dead ends: 461 [2022-07-11 23:43:28,527 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-11 23:43:28,530 INFO L413 NwaCegarLoop]: 700 mSDtfsCounter, 8 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1351 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-11 23:43:28,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1351 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:43:28,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-07-11 23:43:28,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 461. [2022-07-11 23:43:28,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 362 states have (on average 1.4751381215469612) internal successors, (534), 378 states have internal predecessors, (534), 86 states have call successors, (86), 13 states have call predecessors, (86), 12 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2022-07-11 23:43:28,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 691 transitions. [2022-07-11 23:43:28,620 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 691 transitions. Word has length 13 [2022-07-11 23:43:28,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:28,621 INFO L495 AbstractCegarLoop]: Abstraction has 461 states and 691 transitions. [2022-07-11 23:43:28,621 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-11 23:43:28,621 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 691 transitions. [2022-07-11 23:43:28,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-11 23:43:28,623 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:28,623 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:28,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:43:28,623 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:28,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:28,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1712840026, now seen corresponding path program 1 times [2022-07-11 23:43:28,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:28,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113354219] [2022-07-11 23:43:28,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:28,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:28,660 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-11 23:43:28,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:28,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113354219] [2022-07-11 23:43:28,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113354219] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:28,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:28,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:43:28,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949255920] [2022-07-11 23:43:28,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:28,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:43:28,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:28,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:43:28,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:43:28,662 INFO L87 Difference]: Start difference. First operand 461 states and 691 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-11 23:43:28,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:28,824 INFO L93 Difference]: Finished difference Result 702 states and 1030 transitions. [2022-07-11 23:43:28,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:43:28,824 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-11 23:43:28,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:28,832 INFO L225 Difference]: With dead ends: 702 [2022-07-11 23:43:28,833 INFO L226 Difference]: Without dead ends: 597 [2022-07-11 23:43:28,839 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-11 23:43:28,841 INFO L413 NwaCegarLoop]: 814 mSDtfsCounter, 566 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 1038 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.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:28,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 1038 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:43:28,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2022-07-11 23:43:28,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 579. [2022-07-11 23:43:28,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 466 states have (on average 1.4356223175965666) internal successors, (669), 468 states have internal predecessors, (669), 92 states have call successors, (92), 21 states have call predecessors, (92), 20 states have return successors, (97), 91 states have call predecessors, (97), 81 states have call successors, (97) [2022-07-11 23:43:28,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 858 transitions. [2022-07-11 23:43:28,897 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 858 transitions. Word has length 15 [2022-07-11 23:43:28,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:28,898 INFO L495 AbstractCegarLoop]: Abstraction has 579 states and 858 transitions. [2022-07-11 23:43:28,898 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-11 23:43:28,898 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 858 transitions. [2022-07-11 23:43:28,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-11 23:43:28,902 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:28,902 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-11 23:43:28,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 23:43:28,902 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:28,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:28,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1723202730, now seen corresponding path program 1 times [2022-07-11 23:43:28,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:28,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364177376] [2022-07-11 23:43:28,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:28,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:28,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:28,948 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-11 23:43:28,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:28,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364177376] [2022-07-11 23:43:28,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364177376] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:28,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:28,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:43:28,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264212009] [2022-07-11 23:43:28,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:28,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:43:28,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:28,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:43:28,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:43:28,950 INFO L87 Difference]: Start difference. First operand 579 states and 858 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-11 23:43:28,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:28,978 INFO L93 Difference]: Finished difference Result 858 states and 1241 transitions. [2022-07-11 23:43:28,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:43:28,979 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-11 23:43:28,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:28,984 INFO L225 Difference]: With dead ends: 858 [2022-07-11 23:43:28,984 INFO L226 Difference]: Without dead ends: 723 [2022-07-11 23:43:28,986 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-11 23:43:28,990 INFO L413 NwaCegarLoop]: 681 mSDtfsCounter, 605 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 868 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-11 23:43:28,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 868 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:43:28,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2022-07-11 23:43:29,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 687. [2022-07-11 23:43:29,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 564 states have (on average 1.4326241134751774) internal successors, (808), 562 states have internal predecessors, (808), 93 states have call successors, (93), 26 states have call predecessors, (93), 29 states have return successors, (110), 98 states have call predecessors, (110), 85 states have call successors, (110) [2022-07-11 23:43:29,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1011 transitions. [2022-07-11 23:43:29,024 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1011 transitions. Word has length 19 [2022-07-11 23:43:29,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:29,024 INFO L495 AbstractCegarLoop]: Abstraction has 687 states and 1011 transitions. [2022-07-11 23:43:29,024 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-11 23:43:29,025 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1011 transitions. [2022-07-11 23:43:29,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-11 23:43:29,028 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:29,028 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-11 23:43:29,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-11 23:43:29,029 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:29,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:29,029 INFO L85 PathProgramCache]: Analyzing trace with hash 981092466, now seen corresponding path program 1 times [2022-07-11 23:43:29,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:29,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839222463] [2022-07-11 23:43:29,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:29,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:29,072 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-11 23:43:29,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:29,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839222463] [2022-07-11 23:43:29,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839222463] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:29,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:29,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:43:29,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730041661] [2022-07-11 23:43:29,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:29,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:43:29,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:29,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:43:29,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:43:29,074 INFO L87 Difference]: Start difference. First operand 687 states and 1011 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-11 23:43:29,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:29,182 INFO L93 Difference]: Finished difference Result 1290 states and 1958 transitions. [2022-07-11 23:43:29,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:43:29,183 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-11 23:43:29,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:29,188 INFO L225 Difference]: With dead ends: 1290 [2022-07-11 23:43:29,189 INFO L226 Difference]: Without dead ends: 1057 [2022-07-11 23:43:29,190 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-11 23:43:29,196 INFO L413 NwaCegarLoop]: 1006 mSDtfsCounter, 338 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1622 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-11 23:43:29,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 1622 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:43:29,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2022-07-11 23:43:29,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 819. [2022-07-11 23:43:29,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 673 states have (on average 1.4338781575037147) internal successors, (965), 670 states have internal predecessors, (965), 106 states have call successors, (106), 34 states have call predecessors, (106), 39 states have return successors, (172), 114 states have call predecessors, (172), 98 states have call successors, (172) [2022-07-11 23:43:29,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1243 transitions. [2022-07-11 23:43:29,234 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1243 transitions. Word has length 21 [2022-07-11 23:43:29,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:29,235 INFO L495 AbstractCegarLoop]: Abstraction has 819 states and 1243 transitions. [2022-07-11 23:43:29,238 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-11 23:43:29,238 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1243 transitions. [2022-07-11 23:43:29,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-11 23:43:29,240 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:29,240 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-11 23:43:29,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-11 23:43:29,240 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:29,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:29,241 INFO L85 PathProgramCache]: Analyzing trace with hash 110549048, now seen corresponding path program 1 times [2022-07-11 23:43:29,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:29,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832843391] [2022-07-11 23:43:29,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:29,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:29,337 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-11 23:43:29,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:29,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832843391] [2022-07-11 23:43:29,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832843391] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:29,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:29,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:43:29,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003168809] [2022-07-11 23:43:29,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:29,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:43:29,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:29,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:43:29,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:43:29,340 INFO L87 Difference]: Start difference. First operand 819 states and 1243 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-11 23:43:29,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:29,610 INFO L93 Difference]: Finished difference Result 1372 states and 2088 transitions. [2022-07-11 23:43:29,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:43:29,610 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-11 23:43:29,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:29,614 INFO L225 Difference]: With dead ends: 1372 [2022-07-11 23:43:29,614 INFO L226 Difference]: Without dead ends: 829 [2022-07-11 23:43:29,615 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-11 23:43:29,616 INFO L413 NwaCegarLoop]: 717 mSDtfsCounter, 1027 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1028 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:29,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1028 Valid, 869 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:43:29,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2022-07-11 23:43:29,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 807. [2022-07-11 23:43:29,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 663 states have (on average 1.4283559577677225) internal successors, (947), 660 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-11 23:43:29,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1219 transitions. [2022-07-11 23:43:29,643 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1219 transitions. Word has length 22 [2022-07-11 23:43:29,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:29,643 INFO L495 AbstractCegarLoop]: Abstraction has 807 states and 1219 transitions. [2022-07-11 23:43:29,644 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-11 23:43:29,644 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1219 transitions. [2022-07-11 23:43:29,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-11 23:43:29,645 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:29,645 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-11 23:43:29,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-11 23:43:29,645 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:29,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:29,646 INFO L85 PathProgramCache]: Analyzing trace with hash -401986644, now seen corresponding path program 1 times [2022-07-11 23:43:29,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:29,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501946502] [2022-07-11 23:43:29,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:29,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:29,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:29,681 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-11 23:43:29,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:29,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501946502] [2022-07-11 23:43:29,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501946502] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:29,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:29,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:43:29,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165685757] [2022-07-11 23:43:29,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:29,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:43:29,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:29,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:43:29,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:43:29,683 INFO L87 Difference]: Start difference. First operand 807 states and 1219 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-11 23:43:29,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:29,731 INFO L93 Difference]: Finished difference Result 810 states and 1221 transitions. [2022-07-11 23:43:29,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:43:29,731 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-11 23:43:29,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:29,734 INFO L225 Difference]: With dead ends: 810 [2022-07-11 23:43:29,734 INFO L226 Difference]: Without dead ends: 806 [2022-07-11 23:43:29,734 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-11 23:43:29,735 INFO L413 NwaCegarLoop]: 649 mSDtfsCounter, 22 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1252 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-11 23:43:29,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1252 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:43:29,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2022-07-11 23:43:29,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 806. [2022-07-11 23:43:29,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 663 states have (on average 1.4253393665158371) internal successors, (945), 659 states have internal predecessors, (945), 103 states have call successors, (103), 32 states have call predecessors, (103), 39 states have return successors, (168), 114 states have call predecessors, (168), 96 states have call successors, (168) [2022-07-11 23:43:29,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1216 transitions. [2022-07-11 23:43:29,772 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1216 transitions. Word has length 23 [2022-07-11 23:43:29,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:29,773 INFO L495 AbstractCegarLoop]: Abstraction has 806 states and 1216 transitions. [2022-07-11 23:43:29,773 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-11 23:43:29,773 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1216 transitions. [2022-07-11 23:43:29,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-11 23:43:29,774 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:29,774 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-11 23:43:29,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-11 23:43:29,774 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:29,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:29,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1420935661, now seen corresponding path program 1 times [2022-07-11 23:43:29,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:29,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811955418] [2022-07-11 23:43:29,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:29,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:29,801 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-11 23:43:29,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:29,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811955418] [2022-07-11 23:43:29,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811955418] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:29,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:29,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:43:29,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553225997] [2022-07-11 23:43:29,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:29,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:43:29,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:29,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:43:29,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:43:29,803 INFO L87 Difference]: Start difference. First operand 806 states and 1216 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-11 23:43:29,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:29,874 INFO L93 Difference]: Finished difference Result 1220 states and 1776 transitions. [2022-07-11 23:43:29,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:43:29,875 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-11 23:43:29,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:29,878 INFO L225 Difference]: With dead ends: 1220 [2022-07-11 23:43:29,878 INFO L226 Difference]: Without dead ends: 806 [2022-07-11 23:43:29,879 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-11 23:43:29,879 INFO L413 NwaCegarLoop]: 757 mSDtfsCounter, 318 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1941 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:29,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1941 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:43:29,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2022-07-11 23:43:29,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 681. [2022-07-11 23:43:29,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 559 states have (on average 1.407871198568873) internal successors, (787), 557 states have internal predecessors, (787), 88 states have call successors, (88), 28 states have call predecessors, (88), 33 states have return successors, (109), 95 states have call predecessors, (109), 81 states have call successors, (109) [2022-07-11 23:43:29,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 984 transitions. [2022-07-11 23:43:29,900 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 984 transitions. Word has length 28 [2022-07-11 23:43:29,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:29,900 INFO L495 AbstractCegarLoop]: Abstraction has 681 states and 984 transitions. [2022-07-11 23:43:29,900 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-11 23:43:29,900 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 984 transitions. [2022-07-11 23:43:29,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-11 23:43:29,901 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:29,902 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-11 23:43:29,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-11 23:43:29,902 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:29,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:29,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1565251403, now seen corresponding path program 1 times [2022-07-11 23:43:29,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:29,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545804896] [2022-07-11 23:43:29,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:29,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:29,923 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-11 23:43:29,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:29,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545804896] [2022-07-11 23:43:29,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545804896] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:29,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:29,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:43:29,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798677835] [2022-07-11 23:43:29,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:29,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:43:29,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:29,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:43:29,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:43:29,925 INFO L87 Difference]: Start difference. First operand 681 states and 984 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-11 23:43:29,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:29,950 INFO L93 Difference]: Finished difference Result 764 states and 1091 transitions. [2022-07-11 23:43:29,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:43:29,950 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-11 23:43:29,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:29,953 INFO L225 Difference]: With dead ends: 764 [2022-07-11 23:43:29,953 INFO L226 Difference]: Without dead ends: 746 [2022-07-11 23:43:29,953 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-11 23:43:29,954 INFO L413 NwaCegarLoop]: 654 mSDtfsCounter, 628 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:29,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 716 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:43:29,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2022-07-11 23:43:29,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 703. [2022-07-11 23:43:29,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 579 states have (on average 1.4162348877374784) internal successors, (820), 584 states have internal predecessors, (820), 88 states have call successors, (88), 29 states have call predecessors, (88), 35 states have return successors, (104), 89 states have call predecessors, (104), 82 states have call successors, (104) [2022-07-11 23:43:29,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1012 transitions. [2022-07-11 23:43:29,983 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1012 transitions. Word has length 29 [2022-07-11 23:43:29,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:29,983 INFO L495 AbstractCegarLoop]: Abstraction has 703 states and 1012 transitions. [2022-07-11 23:43:29,983 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-11 23:43:29,984 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1012 transitions. [2022-07-11 23:43:29,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-11 23:43:29,985 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:29,985 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-11 23:43:29,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-11 23:43:29,986 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:29,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:29,986 INFO L85 PathProgramCache]: Analyzing trace with hash 18714975, now seen corresponding path program 1 times [2022-07-11 23:43:29,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:29,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585687013] [2022-07-11 23:43:29,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:29,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:29,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:30,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-11 23:43:30,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:30,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:30,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:30,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585687013] [2022-07-11 23:43:30,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585687013] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:30,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:30,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:43:30,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657492125] [2022-07-11 23:43:30,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:30,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:43:30,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:30,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:43:30,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:43:30,031 INFO L87 Difference]: Start difference. First operand 703 states and 1012 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-11 23:43:30,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:30,198 INFO L93 Difference]: Finished difference Result 999 states and 1443 transitions. [2022-07-11 23:43:30,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:43:30,198 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-11 23:43:30,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:30,201 INFO L225 Difference]: With dead ends: 999 [2022-07-11 23:43:30,201 INFO L226 Difference]: Without dead ends: 772 [2022-07-11 23:43:30,202 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-11 23:43:30,202 INFO L413 NwaCegarLoop]: 729 mSDtfsCounter, 254 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1774 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:30,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 1774 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:43:30,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2022-07-11 23:43:30,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 686. [2022-07-11 23:43:30,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 564 states have (on average 1.4113475177304964) internal successors, (796), 571 states have internal predecessors, (796), 87 states have call successors, (87), 28 states have call predecessors, (87), 34 states have return successors, (100), 86 states have call predecessors, (100), 81 states have call successors, (100) [2022-07-11 23:43:30,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 983 transitions. [2022-07-11 23:43:30,221 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 983 transitions. Word has length 35 [2022-07-11 23:43:30,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:30,221 INFO L495 AbstractCegarLoop]: Abstraction has 686 states and 983 transitions. [2022-07-11 23:43:30,222 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-11 23:43:30,222 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 983 transitions. [2022-07-11 23:43:30,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-11 23:43:30,223 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:30,223 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-11 23:43:30,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-11 23:43:30,223 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:30,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:30,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1008894227, now seen corresponding path program 1 times [2022-07-11 23:43:30,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:30,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153561672] [2022-07-11 23:43:30,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:30,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:30,244 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-11 23:43:30,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:30,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153561672] [2022-07-11 23:43:30,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153561672] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:30,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:30,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:43:30,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638524280] [2022-07-11 23:43:30,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:30,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:43:30,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:30,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:43:30,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:43:30,246 INFO L87 Difference]: Start difference. First operand 686 states and 983 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-11 23:43:30,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:30,443 INFO L93 Difference]: Finished difference Result 744 states and 1056 transitions. [2022-07-11 23:43:30,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:43:30,444 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-11 23:43:30,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:30,447 INFO L225 Difference]: With dead ends: 744 [2022-07-11 23:43:30,447 INFO L226 Difference]: Without dead ends: 702 [2022-07-11 23:43:30,447 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-11 23:43:30,448 INFO L413 NwaCegarLoop]: 641 mSDtfsCounter, 691 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:30,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 1101 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:43:30,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2022-07-11 23:43:30,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 686. [2022-07-11 23:43:30,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 564 states have (on average 1.4078014184397163) internal successors, (794), 571 states have internal predecessors, (794), 87 states have call successors, (87), 28 states have call predecessors, (87), 34 states have return successors, (100), 86 states have call predecessors, (100), 81 states have call successors, (100) [2022-07-11 23:43:30,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 981 transitions. [2022-07-11 23:43:30,470 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 981 transitions. Word has length 32 [2022-07-11 23:43:30,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:30,471 INFO L495 AbstractCegarLoop]: Abstraction has 686 states and 981 transitions. [2022-07-11 23:43:30,471 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-11 23:43:30,471 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 981 transitions. [2022-07-11 23:43:30,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-11 23:43:30,473 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:30,474 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-11 23:43:30,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-11 23:43:30,474 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:30,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:30,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1838861437, now seen corresponding path program 1 times [2022-07-11 23:43:30,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:30,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775083193] [2022-07-11 23:43:30,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:30,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:30,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-11 23:43:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:30,509 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-11 23:43:30,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:30,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775083193] [2022-07-11 23:43:30,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775083193] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:30,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:30,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:43:30,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917483249] [2022-07-11 23:43:30,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:30,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:43:30,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:30,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:43:30,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:43:30,511 INFO L87 Difference]: Start difference. First operand 686 states and 981 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-11 23:43:30,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:30,673 INFO L93 Difference]: Finished difference Result 771 states and 1109 transitions. [2022-07-11 23:43:30,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:43:30,673 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-11 23:43:30,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:30,676 INFO L225 Difference]: With dead ends: 771 [2022-07-11 23:43:30,676 INFO L226 Difference]: Without dead ends: 711 [2022-07-11 23:43:30,677 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-11 23:43:30,677 INFO L413 NwaCegarLoop]: 650 mSDtfsCounter, 703 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:30,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 1254 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:43:30,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2022-07-11 23:43:30,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 675. [2022-07-11 23:43:30,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 557 states have (on average 1.4093357271095153) internal successors, (785), 564 states have internal predecessors, (785), 85 states have call successors, (85), 26 states have call predecessors, (85), 32 states have return successors, (98), 84 states have call predecessors, (98), 79 states have call successors, (98) [2022-07-11 23:43:30,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 968 transitions. [2022-07-11 23:43:30,697 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 968 transitions. Word has length 36 [2022-07-11 23:43:30,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:30,697 INFO L495 AbstractCegarLoop]: Abstraction has 675 states and 968 transitions. [2022-07-11 23:43:30,698 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-11 23:43:30,698 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 968 transitions. [2022-07-11 23:43:30,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-11 23:43:30,699 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:30,699 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-11 23:43:30,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-11 23:43:30,699 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:30,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:30,700 INFO L85 PathProgramCache]: Analyzing trace with hash 138801832, now seen corresponding path program 1 times [2022-07-11 23:43:30,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:30,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16314759] [2022-07-11 23:43:30,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:30,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:30,726 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-11 23:43:30,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:30,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16314759] [2022-07-11 23:43:30,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16314759] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:30,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:30,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:43:30,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442581999] [2022-07-11 23:43:30,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:30,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:43:30,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:30,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:43:30,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:43:30,728 INFO L87 Difference]: Start difference. First operand 675 states and 968 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-11 23:43:30,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:30,791 INFO L93 Difference]: Finished difference Result 832 states and 1184 transitions. [2022-07-11 23:43:30,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:43:30,791 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-11 23:43:30,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:30,794 INFO L225 Difference]: With dead ends: 832 [2022-07-11 23:43:30,794 INFO L226 Difference]: Without dead ends: 821 [2022-07-11 23:43:30,795 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-11 23:43:30,795 INFO L413 NwaCegarLoop]: 759 mSDtfsCounter, 132 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1372 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.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:30,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1372 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:43:30,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2022-07-11 23:43:30,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 723. [2022-07-11 23:43:30,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 601 states have (on average 1.3860232945091515) internal successors, (833), 601 states have internal predecessors, (833), 85 states have call successors, (85), 26 states have call predecessors, (85), 36 states have return successors, (109), 95 states have call predecessors, (109), 79 states have call successors, (109) [2022-07-11 23:43:30,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1027 transitions. [2022-07-11 23:43:30,820 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1027 transitions. Word has length 34 [2022-07-11 23:43:30,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:30,821 INFO L495 AbstractCegarLoop]: Abstraction has 723 states and 1027 transitions. [2022-07-11 23:43:30,821 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-11 23:43:30,821 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1027 transitions. [2022-07-11 23:43:30,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-11 23:43:30,822 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:30,822 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-11 23:43:30,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-11 23:43:30,823 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:30,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:30,823 INFO L85 PathProgramCache]: Analyzing trace with hash -298326298, now seen corresponding path program 1 times [2022-07-11 23:43:30,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:30,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124834857] [2022-07-11 23:43:30,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:30,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:30,866 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-11 23:43:30,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:30,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124834857] [2022-07-11 23:43:30,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124834857] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:30,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:30,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:43:30,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423621962] [2022-07-11 23:43:30,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:30,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:43:30,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:30,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:43:30,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:43:30,868 INFO L87 Difference]: Start difference. First operand 723 states and 1027 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-11 23:43:31,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:31,054 INFO L93 Difference]: Finished difference Result 751 states and 1058 transitions. [2022-07-11 23:43:31,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:43:31,055 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-11 23:43:31,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:31,058 INFO L225 Difference]: With dead ends: 751 [2022-07-11 23:43:31,058 INFO L226 Difference]: Without dead ends: 704 [2022-07-11 23:43:31,058 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-11 23:43:31,060 INFO L413 NwaCegarLoop]: 640 mSDtfsCounter, 671 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:31,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 1100 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:43:31,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2022-07-11 23:43:31,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 694. [2022-07-11 23:43:31,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 575 states have (on average 1.391304347826087) internal successors, (800), 581 states have internal predecessors, (800), 85 states have call successors, (85), 26 states have call predecessors, (85), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-07-11 23:43:31,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 983 transitions. [2022-07-11 23:43:31,089 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 983 transitions. Word has length 34 [2022-07-11 23:43:31,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:31,089 INFO L495 AbstractCegarLoop]: Abstraction has 694 states and 983 transitions. [2022-07-11 23:43:31,089 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-11 23:43:31,089 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 983 transitions. [2022-07-11 23:43:31,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-11 23:43:31,090 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:31,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:31,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-11 23:43:31,090 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:31,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:31,090 INFO L85 PathProgramCache]: Analyzing trace with hash 452395434, now seen corresponding path program 1 times [2022-07-11 23:43:31,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:31,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988782505] [2022-07-11 23:43:31,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:31,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:31,128 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-11 23:43:31,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:31,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988782505] [2022-07-11 23:43:31,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988782505] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:31,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:31,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:43:31,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184524417] [2022-07-11 23:43:31,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:31,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:43:31,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:31,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:43:31,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:43:31,130 INFO L87 Difference]: Start difference. First operand 694 states and 983 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-11 23:43:31,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:31,344 INFO L93 Difference]: Finished difference Result 792 states and 1125 transitions. [2022-07-11 23:43:31,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:43:31,345 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-11 23:43:31,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:31,347 INFO L225 Difference]: With dead ends: 792 [2022-07-11 23:43:31,348 INFO L226 Difference]: Without dead ends: 788 [2022-07-11 23:43:31,348 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-11 23:43:31,348 INFO L413 NwaCegarLoop]: 736 mSDtfsCounter, 741 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:31,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 1192 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:43:31,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2022-07-11 23:43:31,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 696. [2022-07-11 23:43:31,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 577 states have (on average 1.389948006932409) internal successors, (802), 583 states have internal predecessors, (802), 85 states have call successors, (85), 26 states have call predecessors, (85), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-07-11 23:43:31,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 985 transitions. [2022-07-11 23:43:31,375 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 985 transitions. Word has length 35 [2022-07-11 23:43:31,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:31,376 INFO L495 AbstractCegarLoop]: Abstraction has 696 states and 985 transitions. [2022-07-11 23:43:31,376 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-11 23:43:31,376 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 985 transitions. [2022-07-11 23:43:31,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-11 23:43:31,377 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:31,378 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-11 23:43:31,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-11 23:43:31,378 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:31,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:31,378 INFO L85 PathProgramCache]: Analyzing trace with hash 452672264, now seen corresponding path program 1 times [2022-07-11 23:43:31,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:31,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938542619] [2022-07-11 23:43:31,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:31,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:31,409 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-11 23:43:31,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:31,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938542619] [2022-07-11 23:43:31,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938542619] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:31,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:31,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-11 23:43:31,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506599727] [2022-07-11 23:43:31,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:31,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:43:31,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:31,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:43:31,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:43:31,411 INFO L87 Difference]: Start difference. First operand 696 states and 985 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-11 23:43:31,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:31,479 INFO L93 Difference]: Finished difference Result 709 states and 998 transitions. [2022-07-11 23:43:31,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:43:31,480 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-11 23:43:31,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:31,483 INFO L225 Difference]: With dead ends: 709 [2022-07-11 23:43:31,483 INFO L226 Difference]: Without dead ends: 679 [2022-07-11 23:43:31,484 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-11 23:43:31,485 INFO L413 NwaCegarLoop]: 648 mSDtfsCounter, 38 mSDsluCounter, 2545 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 3193 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:31,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 3193 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:43:31,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2022-07-11 23:43:31,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 679. [2022-07-11 23:43:31,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 560 states have (on average 1.3964285714285714) internal successors, (782), 566 states have internal predecessors, (782), 85 states have call successors, (85), 26 states have call predecessors, (85), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-07-11 23:43:31,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 965 transitions. [2022-07-11 23:43:31,546 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 965 transitions. Word has length 35 [2022-07-11 23:43:31,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:31,547 INFO L495 AbstractCegarLoop]: Abstraction has 679 states and 965 transitions. [2022-07-11 23:43:31,547 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-11 23:43:31,547 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 965 transitions. [2022-07-11 23:43:31,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-11 23:43:31,549 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:31,549 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-11 23:43:31,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-11 23:43:31,549 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:31,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:31,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1733603893, now seen corresponding path program 1 times [2022-07-11 23:43:31,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:31,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19467278] [2022-07-11 23:43:31,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:31,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:31,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-11 23:43:31,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:31,581 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-11 23:43:31,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:31,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19467278] [2022-07-11 23:43:31,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19467278] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:31,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:31,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:43:31,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809592727] [2022-07-11 23:43:31,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:31,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:43:31,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:31,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:43:31,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:43:31,584 INFO L87 Difference]: Start difference. First operand 679 states and 965 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-11 23:43:31,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:31,790 INFO L93 Difference]: Finished difference Result 717 states and 1030 transitions. [2022-07-11 23:43:31,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:43:31,790 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-11 23:43:31,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:31,793 INFO L225 Difference]: With dead ends: 717 [2022-07-11 23:43:31,793 INFO L226 Difference]: Without dead ends: 710 [2022-07-11 23:43:31,793 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-11 23:43:31,793 INFO L413 NwaCegarLoop]: 622 mSDtfsCounter, 150 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:31,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1540 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:43:31,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2022-07-11 23:43:31,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 692. [2022-07-11 23:43:31,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 573 states have (on average 1.3909249563699826) internal successors, (797), 579 states have internal predecessors, (797), 85 states have call successors, (85), 26 states have call predecessors, (85), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-07-11 23:43:31,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 980 transitions. [2022-07-11 23:43:31,820 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 980 transitions. Word has length 37 [2022-07-11 23:43:31,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:31,820 INFO L495 AbstractCegarLoop]: Abstraction has 692 states and 980 transitions. [2022-07-11 23:43:31,820 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-11 23:43:31,820 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 980 transitions. [2022-07-11 23:43:31,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-11 23:43:31,821 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:31,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] [2022-07-11 23:43:31,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-11 23:43:31,822 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:31,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:31,822 INFO L85 PathProgramCache]: Analyzing trace with hash -190291046, now seen corresponding path program 1 times [2022-07-11 23:43:31,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:31,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786105861] [2022-07-11 23:43:31,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:31,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:31,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-11 23:43:31,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:31,873 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-11 23:43:31,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:31,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786105861] [2022-07-11 23:43:31,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786105861] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:31,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:31,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-11 23:43:31,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844822449] [2022-07-11 23:43:31,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:31,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:43:31,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:31,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:43:31,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:43:31,875 INFO L87 Difference]: Start difference. First operand 692 states and 980 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-11 23:43:32,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:32,144 INFO L93 Difference]: Finished difference Result 716 states and 1026 transitions. [2022-07-11 23:43:32,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-11 23:43:32,144 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-11 23:43:32,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:32,147 INFO L225 Difference]: With dead ends: 716 [2022-07-11 23:43:32,147 INFO L226 Difference]: Without dead ends: 710 [2022-07-11 23:43:32,147 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-11 23:43:32,147 INFO L413 NwaCegarLoop]: 616 mSDtfsCounter, 780 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:32,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 1451 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:43:32,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2022-07-11 23:43:32,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 692. [2022-07-11 23:43:32,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 573 states have (on average 1.3891797556719023) internal successors, (796), 579 states have internal predecessors, (796), 85 states have call successors, (85), 26 states have call predecessors, (85), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-07-11 23:43:32,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 979 transitions. [2022-07-11 23:43:32,174 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 979 transitions. Word has length 39 [2022-07-11 23:43:32,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:32,175 INFO L495 AbstractCegarLoop]: Abstraction has 692 states and 979 transitions. [2022-07-11 23:43:32,175 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-11 23:43:32,175 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 979 transitions. [2022-07-11 23:43:32,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-11 23:43:32,176 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:32,176 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-11 23:43:32,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-11 23:43:32,176 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:32,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:32,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1290991354, now seen corresponding path program 1 times [2022-07-11 23:43:32,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:32,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993668220] [2022-07-11 23:43:32,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:32,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:32,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-11 23:43:32,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:32,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:32,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:32,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993668220] [2022-07-11 23:43:32,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993668220] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:32,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:32,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-11 23:43:32,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728558522] [2022-07-11 23:43:32,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:32,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-11 23:43:32,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:32,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-11 23:43:32,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-11 23:43:32,215 INFO L87 Difference]: Start difference. First operand 692 states and 979 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-11 23:43:32,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:32,492 INFO L93 Difference]: Finished difference Result 731 states and 1044 transitions. [2022-07-11 23:43:32,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-11 23:43:32,492 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-11 23:43:32,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:32,495 INFO L225 Difference]: With dead ends: 731 [2022-07-11 23:43:32,495 INFO L226 Difference]: Without dead ends: 699 [2022-07-11 23:43:32,496 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-11 23:43:32,496 INFO L413 NwaCegarLoop]: 618 mSDtfsCounter, 158 mSDsluCounter, 3340 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 3958 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:32,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 3958 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:43:32,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-07-11 23:43:32,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 683. [2022-07-11 23:43:32,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 566 states have (on average 1.3710247349823321) internal successors, (776), 572 states have internal predecessors, (776), 83 states have call successors, (83), 26 states have call predecessors, (83), 33 states have return successors, (96), 84 states have call predecessors, (96), 77 states have call successors, (96) [2022-07-11 23:43:32,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 955 transitions. [2022-07-11 23:43:32,527 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 955 transitions. Word has length 40 [2022-07-11 23:43:32,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:32,527 INFO L495 AbstractCegarLoop]: Abstraction has 683 states and 955 transitions. [2022-07-11 23:43:32,527 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-11 23:43:32,527 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 955 transitions. [2022-07-11 23:43:32,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-11 23:43:32,529 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:32,529 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-11 23:43:32,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-11 23:43:32,529 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:32,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:32,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1689117095, now seen corresponding path program 1 times [2022-07-11 23:43:32,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:32,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759152245] [2022-07-11 23:43:32,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:32,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:32,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-11 23:43:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:32,560 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-11 23:43:32,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:32,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759152245] [2022-07-11 23:43:32,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759152245] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:32,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:32,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:43:32,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19587265] [2022-07-11 23:43:32,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:32,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:43:32,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:32,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:43:32,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:43:32,563 INFO L87 Difference]: Start difference. First operand 683 states and 955 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-11 23:43:32,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:32,905 INFO L93 Difference]: Finished difference Result 764 states and 1068 transitions. [2022-07-11 23:43:32,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:43:32,906 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-11 23:43:32,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:32,908 INFO L225 Difference]: With dead ends: 764 [2022-07-11 23:43:32,908 INFO L226 Difference]: Without dead ends: 728 [2022-07-11 23:43:32,908 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-11 23:43:32,909 INFO L413 NwaCegarLoop]: 660 mSDtfsCounter, 789 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:32,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 1511 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:43:32,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2022-07-11 23:43:32,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 683. [2022-07-11 23:43:32,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 566 states have (on average 1.3692579505300353) internal successors, (775), 572 states have internal predecessors, (775), 83 states have call successors, (83), 26 states have call predecessors, (83), 33 states have return successors, (96), 84 states have call predecessors, (96), 77 states have call successors, (96) [2022-07-11 23:43:32,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 954 transitions. [2022-07-11 23:43:32,943 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 954 transitions. Word has length 41 [2022-07-11 23:43:32,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:32,943 INFO L495 AbstractCegarLoop]: Abstraction has 683 states and 954 transitions. [2022-07-11 23:43:32,944 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-11 23:43:32,944 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 954 transitions. [2022-07-11 23:43:32,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-11 23:43:32,945 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:32,945 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-11 23:43:32,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-11 23:43:32,945 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:32,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:32,946 INFO L85 PathProgramCache]: Analyzing trace with hash -90091863, now seen corresponding path program 1 times [2022-07-11 23:43:32,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:32,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91024684] [2022-07-11 23:43:32,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:32,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:32,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:32,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-11 23:43:32,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:32,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-11 23:43:32,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:32,970 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-11 23:43:32,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:32,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91024684] [2022-07-11 23:43:32,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91024684] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:32,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:32,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:43:32,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978285431] [2022-07-11 23:43:32,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:32,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:43:32,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:32,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:43:32,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:43:32,972 INFO L87 Difference]: Start difference. First operand 683 states and 954 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-11 23:43:33,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:33,265 INFO L93 Difference]: Finished difference Result 890 states and 1253 transitions. [2022-07-11 23:43:33,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-11 23:43:33,266 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-11 23:43:33,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:33,268 INFO L225 Difference]: With dead ends: 890 [2022-07-11 23:43:33,268 INFO L226 Difference]: Without dead ends: 678 [2022-07-11 23:43:33,269 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-11 23:43:33,270 INFO L413 NwaCegarLoop]: 602 mSDtfsCounter, 252 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:33,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 1790 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:43:33,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2022-07-11 23:43:33,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 662. [2022-07-11 23:43:33,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 548 states have (on average 1.364963503649635) internal successors, (748), 553 states have internal predecessors, (748), 82 states have call successors, (82), 26 states have call predecessors, (82), 31 states have return successors, (94), 82 states have call predecessors, (94), 77 states have call successors, (94) [2022-07-11 23:43:33,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 924 transitions. [2022-07-11 23:43:33,307 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 924 transitions. Word has length 43 [2022-07-11 23:43:33,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:33,307 INFO L495 AbstractCegarLoop]: Abstraction has 662 states and 924 transitions. [2022-07-11 23:43:33,308 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-11 23:43:33,308 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 924 transitions. [2022-07-11 23:43:33,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-11 23:43:33,310 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:33,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:33,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-11 23:43:33,310 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:33,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:33,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1421107692, now seen corresponding path program 1 times [2022-07-11 23:43:33,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:33,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602068014] [2022-07-11 23:43:33,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:33,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:33,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-11 23:43:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:33,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:33,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:33,405 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-11 23:43:33,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:33,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602068014] [2022-07-11 23:43:33,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602068014] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:33,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:33,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-11 23:43:33,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320380365] [2022-07-11 23:43:33,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:33,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-11 23:43:33,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:33,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-11 23:43:33,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-11 23:43:33,407 INFO L87 Difference]: Start difference. First operand 662 states and 924 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-11 23:43:33,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:33,981 INFO L93 Difference]: Finished difference Result 692 states and 978 transitions. [2022-07-11 23:43:33,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-11 23:43:33,982 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-11 23:43:33,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:33,984 INFO L225 Difference]: With dead ends: 692 [2022-07-11 23:43:33,984 INFO L226 Difference]: Without dead ends: 676 [2022-07-11 23:43:33,984 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-11 23:43:33,985 INFO L413 NwaCegarLoop]: 608 mSDtfsCounter, 98 mSDsluCounter, 3829 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 4437 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:33,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 4437 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-11 23:43:33,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-07-11 23:43:34,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 660. [2022-07-11 23:43:34,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 547 states have (on average 1.363802559414991) internal successors, (746), 552 states have internal predecessors, (746), 81 states have call successors, (81), 26 states have call predecessors, (81), 31 states have return successors, (93), 81 states have call predecessors, (93), 76 states have call successors, (93) [2022-07-11 23:43:34,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 920 transitions. [2022-07-11 23:43:34,013 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 920 transitions. Word has length 43 [2022-07-11 23:43:34,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:34,013 INFO L495 AbstractCegarLoop]: Abstraction has 660 states and 920 transitions. [2022-07-11 23:43:34,013 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-11 23:43:34,013 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 920 transitions. [2022-07-11 23:43:34,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-11 23:43:34,015 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:34,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] [2022-07-11 23:43:34,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-11 23:43:34,015 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:34,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:34,015 INFO L85 PathProgramCache]: Analyzing trace with hash 531963361, now seen corresponding path program 1 times [2022-07-11 23:43:34,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:34,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316863375] [2022-07-11 23:43:34,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:34,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:34,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-11 23:43:34,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:34,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:34,115 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-11 23:43:34,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:34,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316863375] [2022-07-11 23:43:34,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316863375] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:34,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:34,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-11 23:43:34,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417949904] [2022-07-11 23:43:34,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:34,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-11 23:43:34,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:34,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-11 23:43:34,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-11 23:43:34,117 INFO L87 Difference]: Start difference. First operand 660 states and 920 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-11 23:43:34,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:34,829 INFO L93 Difference]: Finished difference Result 712 states and 998 transitions. [2022-07-11 23:43:34,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-11 23:43:34,831 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-11 23:43:34,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:34,833 INFO L225 Difference]: With dead ends: 712 [2022-07-11 23:43:34,833 INFO L226 Difference]: Without dead ends: 691 [2022-07-11 23:43:34,834 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-11 23:43:34,834 INFO L413 NwaCegarLoop]: 581 mSDtfsCounter, 171 mSDsluCounter, 4453 mSDsCounter, 0 mSdLazyCounter, 1516 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 5034 SdHoareTripleChecker+Invalid, 1602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:34,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 5034 Invalid, 1602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1516 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-11 23:43:34,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2022-07-11 23:43:34,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 659. [2022-07-11 23:43:34,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 546 states have (on average 1.3461538461538463) internal successors, (735), 551 states have internal predecessors, (735), 81 states have call successors, (81), 26 states have call predecessors, (81), 31 states have return successors, (93), 81 states have call predecessors, (93), 76 states have call successors, (93) [2022-07-11 23:43:34,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 909 transitions. [2022-07-11 23:43:34,862 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 909 transitions. Word has length 44 [2022-07-11 23:43:34,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:34,862 INFO L495 AbstractCegarLoop]: Abstraction has 659 states and 909 transitions. [2022-07-11 23:43:34,862 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-11 23:43:34,862 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 909 transitions. [2022-07-11 23:43:34,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-11 23:43:34,863 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:34,863 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-11 23:43:34,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-11 23:43:34,864 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:34,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:34,864 INFO L85 PathProgramCache]: Analyzing trace with hash -927803137, now seen corresponding path program 1 times [2022-07-11 23:43:34,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:34,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461219968] [2022-07-11 23:43:34,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:34,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:34,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-11 23:43:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:34,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:34,947 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-11 23:43:34,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:34,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461219968] [2022-07-11 23:43:34,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461219968] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:34,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:34,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-11 23:43:34,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492661833] [2022-07-11 23:43:34,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:34,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-11 23:43:34,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:34,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-11 23:43:34,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-11 23:43:34,949 INFO L87 Difference]: Start difference. First operand 659 states and 909 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-11 23:43:35,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:35,524 INFO L93 Difference]: Finished difference Result 688 states and 962 transitions. [2022-07-11 23:43:35,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-11 23:43:35,525 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-11 23:43:35,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:35,527 INFO L225 Difference]: With dead ends: 688 [2022-07-11 23:43:35,527 INFO L226 Difference]: Without dead ends: 672 [2022-07-11 23:43:35,528 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-11 23:43:35,528 INFO L413 NwaCegarLoop]: 590 mSDtfsCounter, 98 mSDsluCounter, 3703 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 4293 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:35,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 4293 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-11 23:43:35,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2022-07-11 23:43:35,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 656. [2022-07-11 23:43:35,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 544 states have (on average 1.3455882352941178) internal successors, (732), 549 states have internal predecessors, (732), 80 states have call successors, (80), 26 states have call predecessors, (80), 31 states have return successors, (92), 80 states have call predecessors, (92), 75 states have call successors, (92) [2022-07-11 23:43:35,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 904 transitions. [2022-07-11 23:43:35,569 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 904 transitions. Word has length 44 [2022-07-11 23:43:35,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:35,569 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 904 transitions. [2022-07-11 23:43:35,569 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-11 23:43:35,570 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 904 transitions. [2022-07-11 23:43:35,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-11 23:43:35,571 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:35,571 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-11 23:43:35,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-11 23:43:35,571 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:35,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:35,572 INFO L85 PathProgramCache]: Analyzing trace with hash 116231593, now seen corresponding path program 1 times [2022-07-11 23:43:35,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:35,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219313385] [2022-07-11 23:43:35,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:35,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:35,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-11 23:43:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:35,625 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-11 23:43:35,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:35,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219313385] [2022-07-11 23:43:35,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219313385] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:35,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:35,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-11 23:43:35,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795902371] [2022-07-11 23:43:35,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:35,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-11 23:43:35,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:35,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-11 23:43:35,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-11 23:43:35,627 INFO L87 Difference]: Start difference. First operand 656 states and 904 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-11 23:43:35,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:35,977 INFO L93 Difference]: Finished difference Result 727 states and 1001 transitions. [2022-07-11 23:43:35,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-11 23:43:35,977 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-11 23:43:35,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:35,979 INFO L225 Difference]: With dead ends: 727 [2022-07-11 23:43:35,980 INFO L226 Difference]: Without dead ends: 660 [2022-07-11 23:43:35,980 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-11 23:43:35,981 INFO L413 NwaCegarLoop]: 571 mSDtfsCounter, 218 mSDsluCounter, 3592 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 4163 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:35,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 4163 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:43:35,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2022-07-11 23:43:36,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 644. [2022-07-11 23:43:36,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 535 states have (on average 1.3401869158878505) internal successors, (717), 540 states have internal predecessors, (717), 77 states have call successors, (77), 26 states have call predecessors, (77), 31 states have return successors, (89), 77 states have call predecessors, (89), 72 states have call successors, (89) [2022-07-11 23:43:36,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 883 transitions. [2022-07-11 23:43:36,016 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 883 transitions. Word has length 44 [2022-07-11 23:43:36,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:36,016 INFO L495 AbstractCegarLoop]: Abstraction has 644 states and 883 transitions. [2022-07-11 23:43:36,016 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-11 23:43:36,016 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 883 transitions. [2022-07-11 23:43:36,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-11 23:43:36,017 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:36,018 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-11 23:43:36,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-11 23:43:36,018 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:36,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:36,018 INFO L85 PathProgramCache]: Analyzing trace with hash 39637354, now seen corresponding path program 1 times [2022-07-11 23:43:36,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:36,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237071254] [2022-07-11 23:43:36,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:36,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:36,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-11 23:43:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:36,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-11 23:43:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:36,060 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-11 23:43:36,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:36,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237071254] [2022-07-11 23:43:36,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237071254] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:36,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:36,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-11 23:43:36,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861161668] [2022-07-11 23:43:36,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:36,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:43:36,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:36,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:43:36,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:43:36,062 INFO L87 Difference]: Start difference. First operand 644 states and 883 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-11 23:43:36,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:36,361 INFO L93 Difference]: Finished difference Result 789 states and 1125 transitions. [2022-07-11 23:43:36,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-11 23:43:36,362 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-11 23:43:36,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:36,364 INFO L225 Difference]: With dead ends: 789 [2022-07-11 23:43:36,364 INFO L226 Difference]: Without dead ends: 695 [2022-07-11 23:43:36,365 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-11 23:43:36,365 INFO L413 NwaCegarLoop]: 539 mSDtfsCounter, 134 mSDsluCounter, 1667 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 2206 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.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:36,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 2206 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:43:36,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2022-07-11 23:43:36,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 651. [2022-07-11 23:43:36,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 540 states have (on average 1.3407407407407408) internal successors, (724), 546 states have internal predecessors, (724), 78 states have call successors, (78), 26 states have call predecessors, (78), 32 states have return successors, (96), 78 states have call predecessors, (96), 73 states have call successors, (96) [2022-07-11 23:43:36,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 898 transitions. [2022-07-11 23:43:36,392 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 898 transitions. Word has length 45 [2022-07-11 23:43:36,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:36,393 INFO L495 AbstractCegarLoop]: Abstraction has 651 states and 898 transitions. [2022-07-11 23:43:36,393 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-11 23:43:36,393 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 898 transitions. [2022-07-11 23:43:36,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-11 23:43:36,394 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:36,394 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-11 23:43:36,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-11 23:43:36,395 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:36,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:36,395 INFO L85 PathProgramCache]: Analyzing trace with hash -469835736, now seen corresponding path program 1 times [2022-07-11 23:43:36,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:36,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712496525] [2022-07-11 23:43:36,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:36,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:36,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:36,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-11 23:43:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:36,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-11 23:43:36,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:36,445 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-11 23:43:36,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:36,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712496525] [2022-07-11 23:43:36,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712496525] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:36,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:36,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-11 23:43:36,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16232443] [2022-07-11 23:43:36,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:36,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-11 23:43:36,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:36,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-11 23:43:36,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-11 23:43:36,447 INFO L87 Difference]: Start difference. First operand 651 states and 898 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-11 23:43:36,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:36,809 INFO L93 Difference]: Finished difference Result 689 states and 966 transitions. [2022-07-11 23:43:36,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:43:36,809 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-11 23:43:36,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:36,811 INFO L225 Difference]: With dead ends: 689 [2022-07-11 23:43:36,811 INFO L226 Difference]: Without dead ends: 669 [2022-07-11 23:43:36,812 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-11 23:43:36,812 INFO L413 NwaCegarLoop]: 569 mSDtfsCounter, 245 mSDsluCounter, 2892 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 3461 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:36,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 3461 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:43:36,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-07-11 23:43:36,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 649. [2022-07-11 23:43:36,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 539 states have (on average 1.339517625231911) internal successors, (722), 545 states have internal predecessors, (722), 77 states have call successors, (77), 26 states have call predecessors, (77), 32 states have return successors, (95), 77 states have call predecessors, (95), 72 states have call successors, (95) [2022-07-11 23:43:36,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 894 transitions. [2022-07-11 23:43:36,838 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 894 transitions. Word has length 45 [2022-07-11 23:43:36,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:36,838 INFO L495 AbstractCegarLoop]: Abstraction has 649 states and 894 transitions. [2022-07-11 23:43:36,838 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-11 23:43:36,838 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 894 transitions. [2022-07-11 23:43:36,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-11 23:43:36,843 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:36,843 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-11 23:43:36,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-11 23:43:36,843 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:36,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:36,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1759820693, now seen corresponding path program 1 times [2022-07-11 23:43:36,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:36,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991138687] [2022-07-11 23:43:36,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:36,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:36,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:36,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-11 23:43:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:36,882 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-11 23:43:36,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:36,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991138687] [2022-07-11 23:43:36,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991138687] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:36,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:36,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-11 23:43:36,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611715603] [2022-07-11 23:43:36,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:36,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-11 23:43:36,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:36,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-11 23:43:36,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-11 23:43:36,884 INFO L87 Difference]: Start difference. First operand 649 states and 894 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-11 23:43:37,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:37,155 INFO L93 Difference]: Finished difference Result 696 states and 976 transitions. [2022-07-11 23:43:37,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-11 23:43:37,156 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-11 23:43:37,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:37,158 INFO L225 Difference]: With dead ends: 696 [2022-07-11 23:43:37,158 INFO L226 Difference]: Without dead ends: 661 [2022-07-11 23:43:37,159 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-11 23:43:37,159 INFO L413 NwaCegarLoop]: 569 mSDtfsCounter, 166 mSDsluCounter, 2999 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 3568 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:37,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 3568 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:43:37,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2022-07-11 23:43:37,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 641. [2022-07-11 23:43:37,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 533 states have (on average 1.3320825515947468) internal successors, (710), 539 states have internal predecessors, (710), 75 states have call successors, (75), 26 states have call predecessors, (75), 32 states have return successors, (93), 75 states have call predecessors, (93), 70 states have call successors, (93) [2022-07-11 23:43:37,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 878 transitions. [2022-07-11 23:43:37,184 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 878 transitions. Word has length 45 [2022-07-11 23:43:37,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:37,184 INFO L495 AbstractCegarLoop]: Abstraction has 641 states and 878 transitions. [2022-07-11 23:43:37,184 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-11 23:43:37,184 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 878 transitions. [2022-07-11 23:43:37,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-11 23:43:37,185 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:37,185 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-11 23:43:37,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-11 23:43:37,185 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:37,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:37,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1002239718, now seen corresponding path program 1 times [2022-07-11 23:43:37,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:37,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505667298] [2022-07-11 23:43:37,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:37,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:37,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:37,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-11 23:43:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:37,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:37,279 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-11 23:43:37,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:37,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505667298] [2022-07-11 23:43:37,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505667298] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:37,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:37,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-11 23:43:37,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584278602] [2022-07-11 23:43:37,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:37,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:43:37,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:37,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:43:37,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:43:37,281 INFO L87 Difference]: Start difference. First operand 641 states and 878 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-11 23:43:37,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:37,876 INFO L93 Difference]: Finished difference Result 676 states and 943 transitions. [2022-07-11 23:43:37,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-11 23:43:37,877 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-11 23:43:37,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:37,879 INFO L225 Difference]: With dead ends: 676 [2022-07-11 23:43:37,879 INFO L226 Difference]: Without dead ends: 658 [2022-07-11 23:43:37,880 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-11 23:43:37,880 INFO L413 NwaCegarLoop]: 545 mSDtfsCounter, 110 mSDsluCounter, 3784 mSDsCounter, 0 mSdLazyCounter, 1213 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 4329 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:37,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 4329 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1213 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-11 23:43:37,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2022-07-11 23:43:37,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 638. [2022-07-11 23:43:37,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 531 states have (on average 1.3314500941619585) internal successors, (707), 537 states have internal predecessors, (707), 74 states have call successors, (74), 26 states have call predecessors, (74), 32 states have return successors, (92), 74 states have call predecessors, (92), 69 states have call successors, (92) [2022-07-11 23:43:37,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 873 transitions. [2022-07-11 23:43:37,905 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 873 transitions. Word has length 46 [2022-07-11 23:43:37,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:37,906 INFO L495 AbstractCegarLoop]: Abstraction has 638 states and 873 transitions. [2022-07-11 23:43:37,906 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-11 23:43:37,906 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 873 transitions. [2022-07-11 23:43:37,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-11 23:43:37,907 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:37,907 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-11 23:43:37,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-11 23:43:37,908 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:37,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:37,908 INFO L85 PathProgramCache]: Analyzing trace with hash -113531146, now seen corresponding path program 1 times [2022-07-11 23:43:37,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:37,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227988141] [2022-07-11 23:43:37,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:37,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:37,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:37,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-11 23:43:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:37,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-11 23:43:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:37,951 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-11 23:43:37,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:37,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227988141] [2022-07-11 23:43:37,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227988141] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:37,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:37,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-11 23:43:37,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000403239] [2022-07-11 23:43:37,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:37,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-11 23:43:37,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:37,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-11 23:43:37,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:43:37,953 INFO L87 Difference]: Start difference. First operand 638 states and 873 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-11 23:43:38,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:38,223 INFO L93 Difference]: Finished difference Result 695 states and 980 transitions. [2022-07-11 23:43:38,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-11 23:43:38,224 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-11 23:43:38,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:38,226 INFO L225 Difference]: With dead ends: 695 [2022-07-11 23:43:38,226 INFO L226 Difference]: Without dead ends: 668 [2022-07-11 23:43:38,227 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-11 23:43:38,227 INFO L413 NwaCegarLoop]: 533 mSDtfsCounter, 187 mSDsluCounter, 1781 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 2314 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:38,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 2314 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:43:38,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2022-07-11 23:43:38,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 642. [2022-07-11 23:43:38,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 533 states have (on average 1.3302063789868668) internal successors, (709), 541 states have internal predecessors, (709), 74 states have call successors, (74), 26 states have call predecessors, (74), 34 states have return successors, (108), 74 states have call predecessors, (108), 69 states have call successors, (108) [2022-07-11 23:43:38,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 891 transitions. [2022-07-11 23:43:38,252 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 891 transitions. Word has length 46 [2022-07-11 23:43:38,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:38,252 INFO L495 AbstractCegarLoop]: Abstraction has 642 states and 891 transitions. [2022-07-11 23:43:38,252 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-11 23:43:38,253 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 891 transitions. [2022-07-11 23:43:38,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-11 23:43:38,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:38,254 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-11 23:43:38,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-11 23:43:38,254 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:38,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:38,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1400503670, now seen corresponding path program 1 times [2022-07-11 23:43:38,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:38,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971077152] [2022-07-11 23:43:38,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:38,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:38,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-11 23:43:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:38,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:38,347 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-11 23:43:38,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:38,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971077152] [2022-07-11 23:43:38,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971077152] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:38,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:38,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-11 23:43:38,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550931032] [2022-07-11 23:43:38,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:38,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-11 23:43:38,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:38,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-11 23:43:38,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-11 23:43:38,349 INFO L87 Difference]: Start difference. First operand 642 states and 891 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-11 23:43:39,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:39,075 INFO L93 Difference]: Finished difference Result 696 states and 976 transitions. [2022-07-11 23:43:39,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-11 23:43:39,075 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-11 23:43:39,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:39,077 INFO L225 Difference]: With dead ends: 696 [2022-07-11 23:43:39,077 INFO L226 Difference]: Without dead ends: 676 [2022-07-11 23:43:39,078 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-11 23:43:39,078 INFO L413 NwaCegarLoop]: 520 mSDtfsCounter, 170 mSDsluCounter, 4257 mSDsCounter, 0 mSdLazyCounter, 1656 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 4777 SdHoareTripleChecker+Invalid, 1728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:39,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 4777 Invalid, 1728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1656 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-11 23:43:39,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-07-11 23:43:39,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 640. [2022-07-11 23:43:39,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 532 states have (on average 1.3289473684210527) internal successors, (707), 540 states have internal predecessors, (707), 73 states have call successors, (73), 26 states have call predecessors, (73), 34 states have return successors, (107), 73 states have call predecessors, (107), 68 states have call successors, (107) [2022-07-11 23:43:39,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 887 transitions. [2022-07-11 23:43:39,103 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 887 transitions. Word has length 47 [2022-07-11 23:43:39,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:39,103 INFO L495 AbstractCegarLoop]: Abstraction has 640 states and 887 transitions. [2022-07-11 23:43:39,104 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-11 23:43:39,104 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 887 transitions. [2022-07-11 23:43:39,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-11 23:43:39,105 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:39,105 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:39,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-11 23:43:39,106 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:39,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:39,106 INFO L85 PathProgramCache]: Analyzing trace with hash -926060850, now seen corresponding path program 1 times [2022-07-11 23:43:39,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:39,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42691100] [2022-07-11 23:43:39,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:39,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:39,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-11 23:43:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:39,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:39,210 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-11 23:43:39,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:39,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42691100] [2022-07-11 23:43:39,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42691100] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:39,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:39,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-11 23:43:39,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574409854] [2022-07-11 23:43:39,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:39,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-11 23:43:39,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:39,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-11 23:43:39,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-11 23:43:39,212 INFO L87 Difference]: Start difference. First operand 640 states and 887 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-11 23:43:39,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:39,847 INFO L93 Difference]: Finished difference Result 675 states and 952 transitions. [2022-07-11 23:43:39,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-11 23:43:39,847 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-11 23:43:39,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:39,849 INFO L225 Difference]: With dead ends: 675 [2022-07-11 23:43:39,849 INFO L226 Difference]: Without dead ends: 651 [2022-07-11 23:43:39,849 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-11 23:43:39,850 INFO L413 NwaCegarLoop]: 539 mSDtfsCounter, 123 mSDsluCounter, 4143 mSDsCounter, 0 mSdLazyCounter, 1354 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 4682 SdHoareTripleChecker+Invalid, 1421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:39,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 4682 Invalid, 1421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1354 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-11 23:43:39,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2022-07-11 23:43:39,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 631. [2022-07-11 23:43:39,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 525 states have (on average 1.3295238095238096) internal successors, (698), 533 states have internal predecessors, (698), 71 states have call successors, (71), 26 states have call predecessors, (71), 34 states have return successors, (105), 71 states have call predecessors, (105), 66 states have call successors, (105) [2022-07-11 23:43:39,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 874 transitions. [2022-07-11 23:43:39,874 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 874 transitions. Word has length 54 [2022-07-11 23:43:39,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:39,874 INFO L495 AbstractCegarLoop]: Abstraction has 631 states and 874 transitions. [2022-07-11 23:43:39,874 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-11 23:43:39,875 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 874 transitions. [2022-07-11 23:43:39,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-11 23:43:39,876 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:39,876 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-11 23:43:39,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-11 23:43:39,876 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:39,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:39,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1310476923, now seen corresponding path program 1 times [2022-07-11 23:43:39,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:39,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702376964] [2022-07-11 23:43:39,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:39,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:39,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:43:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:39,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:39,979 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-11 23:43:39,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:39,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702376964] [2022-07-11 23:43:39,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702376964] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:39,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:39,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-11 23:43:39,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103238979] [2022-07-11 23:43:39,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:39,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-11 23:43:39,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:39,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-11 23:43:39,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-11 23:43:39,981 INFO L87 Difference]: Start difference. First operand 631 states and 874 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-11 23:43:40,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:40,654 INFO L93 Difference]: Finished difference Result 666 states and 938 transitions. [2022-07-11 23:43:40,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-11 23:43:40,655 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-11 23:43:40,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:40,657 INFO L225 Difference]: With dead ends: 666 [2022-07-11 23:43:40,657 INFO L226 Difference]: Without dead ends: 648 [2022-07-11 23:43:40,657 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-11 23:43:40,658 INFO L413 NwaCegarLoop]: 527 mSDtfsCounter, 123 mSDsluCounter, 4050 mSDsCounter, 0 mSdLazyCounter, 1329 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 4577 SdHoareTripleChecker+Invalid, 1394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:40,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 4577 Invalid, 1394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1329 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-11 23:43:40,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2022-07-11 23:43:40,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 628. [2022-07-11 23:43:40,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 523 states have (on average 1.3288718929254302) internal successors, (695), 531 states have internal predecessors, (695), 70 states have call successors, (70), 26 states have call predecessors, (70), 34 states have return successors, (104), 70 states have call predecessors, (104), 65 states have call successors, (104) [2022-07-11 23:43:40,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 869 transitions. [2022-07-11 23:43:40,682 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 869 transitions. Word has length 48 [2022-07-11 23:43:40,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:40,682 INFO L495 AbstractCegarLoop]: Abstraction has 628 states and 869 transitions. [2022-07-11 23:43:40,682 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-11 23:43:40,683 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 869 transitions. [2022-07-11 23:43:40,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-11 23:43:40,684 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:40,684 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-11 23:43:40,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-11 23:43:40,685 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:40,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:40,685 INFO L85 PathProgramCache]: Analyzing trace with hash -631995317, now seen corresponding path program 1 times [2022-07-11 23:43:40,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:40,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499150399] [2022-07-11 23:43:40,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:40,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:40,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-11 23:43:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:40,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:40,796 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-11 23:43:40,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:40,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499150399] [2022-07-11 23:43:40,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499150399] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:40,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:40,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-11 23:43:40,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039156157] [2022-07-11 23:43:40,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:40,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-11 23:43:40,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:40,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-11 23:43:40,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-11 23:43:40,798 INFO L87 Difference]: Start difference. First operand 628 states and 869 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-11 23:43:41,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:41,455 INFO L93 Difference]: Finished difference Result 663 states and 933 transitions. [2022-07-11 23:43:41,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-11 23:43:41,456 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-11 23:43:41,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:41,459 INFO L225 Difference]: With dead ends: 663 [2022-07-11 23:43:41,459 INFO L226 Difference]: Without dead ends: 645 [2022-07-11 23:43:41,459 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-11 23:43:41,459 INFO L413 NwaCegarLoop]: 519 mSDtfsCounter, 123 mSDsluCounter, 3998 mSDsCounter, 0 mSdLazyCounter, 1316 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 4517 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:41,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 4517 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1316 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-11 23:43:41,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2022-07-11 23:43:41,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 625. [2022-07-11 23:43:41,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 521 states have (on average 1.328214971209213) internal successors, (692), 529 states have internal predecessors, (692), 69 states have call successors, (69), 26 states have call predecessors, (69), 34 states have return successors, (103), 69 states have call predecessors, (103), 64 states have call successors, (103) [2022-07-11 23:43:41,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 864 transitions. [2022-07-11 23:43:41,484 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 864 transitions. Word has length 47 [2022-07-11 23:43:41,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:41,484 INFO L495 AbstractCegarLoop]: Abstraction has 625 states and 864 transitions. [2022-07-11 23:43:41,484 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-11 23:43:41,484 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 864 transitions. [2022-07-11 23:43:41,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-11 23:43:41,486 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:41,486 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-11 23:43:41,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-11 23:43:41,486 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:41,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:41,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1897196007, now seen corresponding path program 1 times [2022-07-11 23:43:41,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:41,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203417492] [2022-07-11 23:43:41,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:41,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:41,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-11 23:43:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:41,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:43:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:41,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-11 23:43:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:41,547 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-11 23:43:41,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:41,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203417492] [2022-07-11 23:43:41,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203417492] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:41,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:41,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:43:41,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567171598] [2022-07-11 23:43:41,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:41,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:43:41,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:41,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:43:41,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:43:41,549 INFO L87 Difference]: Start difference. First operand 625 states and 864 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:43:41,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:41,846 INFO L93 Difference]: Finished difference Result 886 states and 1230 transitions. [2022-07-11 23:43:41,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-11 23:43:41,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2022-07-11 23:43:41,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:41,849 INFO L225 Difference]: With dead ends: 886 [2022-07-11 23:43:41,849 INFO L226 Difference]: Without dead ends: 736 [2022-07-11 23:43:41,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:43:41,850 INFO L413 NwaCegarLoop]: 572 mSDtfsCounter, 315 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1311 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:41,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1311 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:43:41,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2022-07-11 23:43:41,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 689. [2022-07-11 23:43:41,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 575 states have (on average 1.3269565217391304) internal successors, (763), 583 states have internal predecessors, (763), 72 states have call successors, (72), 30 states have call predecessors, (72), 41 states have return successors, (112), 75 states have call predecessors, (112), 68 states have call successors, (112) [2022-07-11 23:43:41,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 947 transitions. [2022-07-11 23:43:41,876 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 947 transitions. Word has length 50 [2022-07-11 23:43:41,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:41,876 INFO L495 AbstractCegarLoop]: Abstraction has 689 states and 947 transitions. [2022-07-11 23:43:41,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:43:41,876 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 947 transitions. [2022-07-11 23:43:41,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-11 23:43:41,878 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:41,878 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-11 23:43:41,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-11 23:43:41,878 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:41,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:41,879 INFO L85 PathProgramCache]: Analyzing trace with hash -532277969, now seen corresponding path program 1 times [2022-07-11 23:43:41,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:41,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460049181] [2022-07-11 23:43:41,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:41,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:41,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-11 23:43:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:41,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-11 23:43:41,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:41,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:41,984 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-11 23:43:41,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:41,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460049181] [2022-07-11 23:43:41,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460049181] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:41,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:41,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-11 23:43:41,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266928477] [2022-07-11 23:43:41,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:41,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-11 23:43:41,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:41,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-11 23:43:41,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-11 23:43:41,985 INFO L87 Difference]: Start difference. First operand 689 states and 947 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-11 23:43:42,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:42,808 INFO L93 Difference]: Finished difference Result 753 states and 1042 transitions. [2022-07-11 23:43:42,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-11 23:43:42,809 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-11 23:43:42,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:42,811 INFO L225 Difference]: With dead ends: 753 [2022-07-11 23:43:42,811 INFO L226 Difference]: Without dead ends: 733 [2022-07-11 23:43:42,812 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-11 23:43:42,812 INFO L413 NwaCegarLoop]: 506 mSDtfsCounter, 245 mSDsluCounter, 4354 mSDsCounter, 0 mSdLazyCounter, 1734 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 4860 SdHoareTripleChecker+Invalid, 1863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:42,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 4860 Invalid, 1863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1734 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-11 23:43:42,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2022-07-11 23:43:42,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 687. [2022-07-11 23:43:42,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 574 states have (on average 1.3257839721254356) internal successors, (761), 582 states have internal predecessors, (761), 71 states have call successors, (71), 30 states have call predecessors, (71), 41 states have return successors, (111), 74 states have call predecessors, (111), 67 states have call successors, (111) [2022-07-11 23:43:42,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 943 transitions. [2022-07-11 23:43:42,845 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 943 transitions. Word has length 52 [2022-07-11 23:43:42,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:42,845 INFO L495 AbstractCegarLoop]: Abstraction has 687 states and 943 transitions. [2022-07-11 23:43:42,845 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-11 23:43:42,846 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 943 transitions. [2022-07-11 23:43:42,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-11 23:43:42,847 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:42,847 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-11 23:43:42,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-11 23:43:42,848 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:42,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:42,848 INFO L85 PathProgramCache]: Analyzing trace with hash 232958448, now seen corresponding path program 1 times [2022-07-11 23:43:42,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:42,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017878094] [2022-07-11 23:43:42,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:42,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:42,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-11 23:43:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:42,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-11 23:43:42,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:42,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:42,935 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-11 23:43:42,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:42,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017878094] [2022-07-11 23:43:42,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017878094] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:42,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:42,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-11 23:43:42,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908306934] [2022-07-11 23:43:42,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:42,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-11 23:43:42,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:42,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-11 23:43:42,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-11 23:43:42,937 INFO L87 Difference]: Start difference. First operand 687 states and 943 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-11 23:43:43,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:43,603 INFO L93 Difference]: Finished difference Result 751 states and 1038 transitions. [2022-07-11 23:43:43,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-11 23:43:43,603 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-11 23:43:43,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:43,605 INFO L225 Difference]: With dead ends: 751 [2022-07-11 23:43:43,605 INFO L226 Difference]: Without dead ends: 731 [2022-07-11 23:43:43,606 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-11 23:43:43,606 INFO L413 NwaCegarLoop]: 503 mSDtfsCounter, 264 mSDsluCounter, 3658 mSDsCounter, 0 mSdLazyCounter, 1443 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 4161 SdHoareTripleChecker+Invalid, 1572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:43,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 4161 Invalid, 1572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1443 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-11 23:43:43,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2022-07-11 23:43:43,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 685. [2022-07-11 23:43:43,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 573 states have (on average 1.324607329842932) internal successors, (759), 581 states have internal predecessors, (759), 70 states have call successors, (70), 30 states have call predecessors, (70), 41 states have return successors, (110), 73 states have call predecessors, (110), 66 states have call successors, (110) [2022-07-11 23:43:43,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 939 transitions. [2022-07-11 23:43:43,636 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 939 transitions. Word has length 51 [2022-07-11 23:43:43,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:43,636 INFO L495 AbstractCegarLoop]: Abstraction has 685 states and 939 transitions. [2022-07-11 23:43:43,637 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-11 23:43:43,637 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 939 transitions. [2022-07-11 23:43:43,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-11 23:43:43,638 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:43,638 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-11 23:43:43,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-11 23:43:43,638 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:43,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:43,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1506455403, now seen corresponding path program 1 times [2022-07-11 23:43:43,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:43,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416012434] [2022-07-11 23:43:43,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:43,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:43,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:43,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-11 23:43:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:43,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:43,713 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-11 23:43:43,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:43,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416012434] [2022-07-11 23:43:43,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416012434] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:43,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:43,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-11 23:43:43,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650287498] [2022-07-11 23:43:43,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:43,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-11 23:43:43,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:43,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-11 23:43:43,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-11 23:43:43,715 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-11 23:43:44,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:44,360 INFO L93 Difference]: Finished difference Result 733 states and 1017 transitions. [2022-07-11 23:43:44,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-11 23:43:44,361 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-11 23:43:44,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:44,363 INFO L225 Difference]: With dead ends: 733 [2022-07-11 23:43:44,363 INFO L226 Difference]: Without dead ends: 713 [2022-07-11 23:43:44,363 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-11 23:43:44,364 INFO L413 NwaCegarLoop]: 487 mSDtfsCounter, 149 mSDsluCounter, 3932 mSDsCounter, 0 mSdLazyCounter, 1545 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 4419 SdHoareTripleChecker+Invalid, 1606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:44,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 4419 Invalid, 1606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1545 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-11 23:43:44,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2022-07-11 23:43:44,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 683. [2022-07-11 23:43:44,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 572 states have (on average 1.3234265734265733) internal successors, (757), 580 states have internal predecessors, (757), 69 states have call successors, (69), 30 states have call predecessors, (69), 41 states have return successors, (109), 72 states have call predecessors, (109), 65 states have call successors, (109) [2022-07-11 23:43:44,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 935 transitions. [2022-07-11 23:43:44,389 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 935 transitions. Word has length 48 [2022-07-11 23:43:44,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:44,389 INFO L495 AbstractCegarLoop]: Abstraction has 683 states and 935 transitions. [2022-07-11 23:43:44,389 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-11 23:43:44,389 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 935 transitions. [2022-07-11 23:43:44,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-11 23:43:44,391 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:44,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] [2022-07-11 23:43:44,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-11 23:43:44,391 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:44,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:44,391 INFO L85 PathProgramCache]: Analyzing trace with hash -273874573, now seen corresponding path program 1 times [2022-07-11 23:43:44,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:44,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927873448] [2022-07-11 23:43:44,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:44,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:44,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-11 23:43:44,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:44,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-11 23:43:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:44,414 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-11 23:43:44,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:44,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927873448] [2022-07-11 23:43:44,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927873448] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:44,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:44,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:43:44,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92776290] [2022-07-11 23:43:44,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:44,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:43:44,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:44,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:43:44,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:43:44,417 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-11 23:43:44,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:44,609 INFO L93 Difference]: Finished difference Result 939 states and 1289 transitions. [2022-07-11 23:43:44,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:43:44,609 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-11 23:43:44,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:44,611 INFO L225 Difference]: With dead ends: 939 [2022-07-11 23:43:44,611 INFO L226 Difference]: Without dead ends: 639 [2022-07-11 23:43:44,612 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-11 23:43:44,613 INFO L413 NwaCegarLoop]: 478 mSDtfsCounter, 174 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:44,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1223 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:43:44,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2022-07-11 23:43:44,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 610. [2022-07-11 23:43:44,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 515 states have (on average 1.3184466019417476) internal successors, (679), 521 states have internal predecessors, (679), 60 states have call successors, (60), 27 states have call predecessors, (60), 34 states have return successors, (73), 61 states have call predecessors, (73), 56 states have call successors, (73) [2022-07-11 23:43:44,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 812 transitions. [2022-07-11 23:43:44,635 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 812 transitions. Word has length 48 [2022-07-11 23:43:44,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:44,636 INFO L495 AbstractCegarLoop]: Abstraction has 610 states and 812 transitions. [2022-07-11 23:43:44,636 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-11 23:43:44,636 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 812 transitions. [2022-07-11 23:43:44,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-11 23:43:44,637 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:44,637 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-11 23:43:44,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-07-11 23:43:44,637 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:44,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:44,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1171724014, now seen corresponding path program 1 times [2022-07-11 23:43:44,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:44,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497844665] [2022-07-11 23:43:44,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:44,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:44,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:44,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:43:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:44,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-11 23:43:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:44,671 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-11 23:43:44,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:44,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497844665] [2022-07-11 23:43:44,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497844665] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:44,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:44,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-11 23:43:44,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335484204] [2022-07-11 23:43:44,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:44,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-11 23:43:44,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:44,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-11 23:43:44,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:43:44,672 INFO L87 Difference]: Start difference. First operand 610 states and 812 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-11 23:43:44,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:44,929 INFO L93 Difference]: Finished difference Result 704 states and 925 transitions. [2022-07-11 23:43:44,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-11 23:43:44,929 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-11 23:43:44,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:44,936 INFO L225 Difference]: With dead ends: 704 [2022-07-11 23:43:44,937 INFO L226 Difference]: Without dead ends: 678 [2022-07-11 23:43:44,937 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-11 23:43:44,937 INFO L413 NwaCegarLoop]: 518 mSDtfsCounter, 337 mSDsluCounter, 1524 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 2042 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:44,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 2042 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:43:44,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2022-07-11 23:43:44,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 616. [2022-07-11 23:43:44,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 520 states have (on average 1.3173076923076923) internal successors, (685), 526 states have internal predecessors, (685), 61 states have call successors, (61), 27 states have call predecessors, (61), 34 states have return successors, (74), 62 states have call predecessors, (74), 57 states have call successors, (74) [2022-07-11 23:43:44,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 820 transitions. [2022-07-11 23:43:44,976 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 820 transitions. Word has length 50 [2022-07-11 23:43:44,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:44,976 INFO L495 AbstractCegarLoop]: Abstraction has 616 states and 820 transitions. [2022-07-11 23:43:44,977 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-11 23:43:44,977 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 820 transitions. [2022-07-11 23:43:44,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-11 23:43:44,978 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:44,978 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-11 23:43:44,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-07-11 23:43:44,979 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:44,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:44,979 INFO L85 PathProgramCache]: Analyzing trace with hash 850113778, now seen corresponding path program 1 times [2022-07-11 23:43:44,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:44,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965193927] [2022-07-11 23:43:44,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:44,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:45,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-11 23:43:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:45,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:43:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:45,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:43:45,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:45,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-11 23:43:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:45,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-11 23:43:45,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:45,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965193927] [2022-07-11 23:43:45,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965193927] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:45,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:45,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-11 23:43:45,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752072123] [2022-07-11 23:43:45,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:45,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:43:45,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:45,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:43:45,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:43:45,030 INFO L87 Difference]: Start difference. First operand 616 states and 820 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-11 23:43:45,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:45,316 INFO L93 Difference]: Finished difference Result 733 states and 980 transitions. [2022-07-11 23:43:45,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:43:45,316 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-11 23:43:45,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:45,318 INFO L225 Difference]: With dead ends: 733 [2022-07-11 23:43:45,318 INFO L226 Difference]: Without dead ends: 628 [2022-07-11 23:43:45,318 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-11 23:43:45,318 INFO L413 NwaCegarLoop]: 465 mSDtfsCounter, 191 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:45,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1149 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:43:45,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2022-07-11 23:43:45,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 616. [2022-07-11 23:43:45,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 520 states have (on average 1.3134615384615385) internal successors, (683), 526 states have internal predecessors, (683), 61 states have call successors, (61), 27 states have call predecessors, (61), 34 states have return successors, (74), 62 states have call predecessors, (74), 57 states have call successors, (74) [2022-07-11 23:43:45,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 818 transitions. [2022-07-11 23:43:45,340 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 818 transitions. Word has length 53 [2022-07-11 23:43:45,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:45,340 INFO L495 AbstractCegarLoop]: Abstraction has 616 states and 818 transitions. [2022-07-11 23:43:45,341 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-11 23:43:45,341 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 818 transitions. [2022-07-11 23:43:45,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-11 23:43:45,342 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:45,342 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-11 23:43:45,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-07-11 23:43:45,342 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:45,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:45,343 INFO L85 PathProgramCache]: Analyzing trace with hash -381678341, now seen corresponding path program 1 times [2022-07-11 23:43:45,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:45,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528240903] [2022-07-11 23:43:45,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:45,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:45,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-11 23:43:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:45,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-11 23:43:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:45,388 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-11 23:43:45,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:45,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528240903] [2022-07-11 23:43:45,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528240903] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:45,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:45,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-11 23:43:45,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002540355] [2022-07-11 23:43:45,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:45,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-11 23:43:45,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:45,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-11 23:43:45,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-11 23:43:45,391 INFO L87 Difference]: Start difference. First operand 616 states and 818 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-11 23:43:45,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:45,741 INFO L93 Difference]: Finished difference Result 662 states and 877 transitions. [2022-07-11 23:43:45,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:43:45,742 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-11 23:43:45,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:45,743 INFO L225 Difference]: With dead ends: 662 [2022-07-11 23:43:45,743 INFO L226 Difference]: Without dead ends: 608 [2022-07-11 23:43:45,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-07-11 23:43:45,744 INFO L413 NwaCegarLoop]: 475 mSDtfsCounter, 185 mSDsluCounter, 2604 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 3079 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:45,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 3079 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:43:45,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-07-11 23:43:45,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 589. [2022-07-11 23:43:45,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 498 states have (on average 1.2991967871485943) internal successors, (647), 504 states have internal predecessors, (647), 56 states have call successors, (56), 27 states have call predecessors, (56), 34 states have return successors, (68), 57 states have call predecessors, (68), 52 states have call successors, (68) [2022-07-11 23:43:45,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 771 transitions. [2022-07-11 23:43:45,765 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 771 transitions. Word has length 51 [2022-07-11 23:43:45,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:45,765 INFO L495 AbstractCegarLoop]: Abstraction has 589 states and 771 transitions. [2022-07-11 23:43:45,765 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-11 23:43:45,766 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 771 transitions. [2022-07-11 23:43:45,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-11 23:43:45,767 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:45,767 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-11 23:43:45,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-07-11 23:43:45,767 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:45,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:45,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1990060921, now seen corresponding path program 1 times [2022-07-11 23:43:45,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:45,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270085259] [2022-07-11 23:43:45,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:45,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:45,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-11 23:43:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:45,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-11 23:43:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:45,801 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-11 23:43:45,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:45,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270085259] [2022-07-11 23:43:45,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270085259] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:45,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:45,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-11 23:43:45,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485799978] [2022-07-11 23:43:45,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:45,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-11 23:43:45,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:45,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-11 23:43:45,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:43:45,802 INFO L87 Difference]: Start difference. First operand 589 states and 771 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-11 23:43:46,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:46,052 INFO L93 Difference]: Finished difference Result 642 states and 831 transitions. [2022-07-11 23:43:46,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-11 23:43:46,053 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-11 23:43:46,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:46,054 INFO L225 Difference]: With dead ends: 642 [2022-07-11 23:43:46,054 INFO L226 Difference]: Without dead ends: 595 [2022-07-11 23:43:46,054 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-11 23:43:46,054 INFO L413 NwaCegarLoop]: 418 mSDtfsCounter, 98 mSDsluCounter, 1582 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 2000 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:46,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 2000 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:43:46,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2022-07-11 23:43:46,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 579. [2022-07-11 23:43:46,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 490 states have (on average 1.2959183673469388) internal successors, (635), 496 states have internal predecessors, (635), 54 states have call successors, (54), 27 states have call predecessors, (54), 34 states have return successors, (66), 55 states have call predecessors, (66), 50 states have call successors, (66) [2022-07-11 23:43:46,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 755 transitions. [2022-07-11 23:43:46,086 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 755 transitions. Word has length 51 [2022-07-11 23:43:46,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:46,086 INFO L495 AbstractCegarLoop]: Abstraction has 579 states and 755 transitions. [2022-07-11 23:43:46,086 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-11 23:43:46,086 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 755 transitions. [2022-07-11 23:43:46,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-11 23:43:46,087 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:46,087 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-11 23:43:46,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-07-11 23:43:46,087 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:46,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:46,088 INFO L85 PathProgramCache]: Analyzing trace with hash 105801563, now seen corresponding path program 1 times [2022-07-11 23:43:46,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:46,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191125974] [2022-07-11 23:43:46,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:46,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:46,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-11 23:43:46,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:46,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-11 23:43:46,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:46,130 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-11 23:43:46,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:46,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191125974] [2022-07-11 23:43:46,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191125974] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:46,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:46,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-11 23:43:46,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594446872] [2022-07-11 23:43:46,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:46,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-11 23:43:46,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:46,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-11 23:43:46,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:43:46,132 INFO L87 Difference]: Start difference. First operand 579 states and 755 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-11 23:43:46,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:46,373 INFO L93 Difference]: Finished difference Result 618 states and 801 transitions. [2022-07-11 23:43:46,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-11 23:43:46,374 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-11 23:43:46,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:46,375 INFO L225 Difference]: With dead ends: 618 [2022-07-11 23:43:46,375 INFO L226 Difference]: Without dead ends: 586 [2022-07-11 23:43:46,375 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-11 23:43:46,375 INFO L413 NwaCegarLoop]: 418 mSDtfsCounter, 171 mSDsluCounter, 1335 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:46,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 1753 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:43:46,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2022-07-11 23:43:46,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 574. [2022-07-11 23:43:46,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 486 states have (on average 1.2962962962962963) internal successors, (630), 492 states have internal predecessors, (630), 53 states have call successors, (53), 27 states have call predecessors, (53), 34 states have return successors, (65), 54 states have call predecessors, (65), 49 states have call successors, (65) [2022-07-11 23:43:46,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 748 transitions. [2022-07-11 23:43:46,397 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 748 transitions. Word has length 52 [2022-07-11 23:43:46,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:46,398 INFO L495 AbstractCegarLoop]: Abstraction has 574 states and 748 transitions. [2022-07-11 23:43:46,398 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-11 23:43:46,398 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 748 transitions. [2022-07-11 23:43:46,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-11 23:43:46,399 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:46,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, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:46,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-07-11 23:43:46,399 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:46,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:46,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1444104729, now seen corresponding path program 1 times [2022-07-11 23:43:46,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:46,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645970304] [2022-07-11 23:43:46,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:46,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:46,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-11 23:43:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:46,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:46,429 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-11 23:43:46,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:46,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645970304] [2022-07-11 23:43:46,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645970304] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:46,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:46,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:43:46,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510439891] [2022-07-11 23:43:46,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:46,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:43:46,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:46,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:43:46,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:43:46,430 INFO L87 Difference]: Start difference. First operand 574 states and 748 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-11 23:43:46,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:46,735 INFO L93 Difference]: Finished difference Result 691 states and 900 transitions. [2022-07-11 23:43:46,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-11 23:43:46,735 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-11 23:43:46,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:46,736 INFO L225 Difference]: With dead ends: 691 [2022-07-11 23:43:46,737 INFO L226 Difference]: Without dead ends: 683 [2022-07-11 23:43:46,737 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-11 23:43:46,737 INFO L413 NwaCegarLoop]: 467 mSDtfsCounter, 217 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:46,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1329 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:43:46,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2022-07-11 23:43:46,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 602. [2022-07-11 23:43:46,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 512 states have (on average 1.291015625) internal successors, (661), 518 states have internal predecessors, (661), 53 states have call successors, (53), 27 states have call predecessors, (53), 36 states have return successors, (67), 56 states have call predecessors, (67), 49 states have call successors, (67) [2022-07-11 23:43:46,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 781 transitions. [2022-07-11 23:43:46,760 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 781 transitions. Word has length 52 [2022-07-11 23:43:46,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:46,761 INFO L495 AbstractCegarLoop]: Abstraction has 602 states and 781 transitions. [2022-07-11 23:43:46,761 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-11 23:43:46,761 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 781 transitions. [2022-07-11 23:43:46,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-11 23:43:46,762 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:46,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, 1] [2022-07-11 23:43:46,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-07-11 23:43:46,762 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:46,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:46,763 INFO L85 PathProgramCache]: Analyzing trace with hash -2032610889, now seen corresponding path program 1 times [2022-07-11 23:43:46,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:46,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540399138] [2022-07-11 23:43:46,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:46,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:46,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-11 23:43:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:46,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:46,811 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-11 23:43:46,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:46,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540399138] [2022-07-11 23:43:46,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540399138] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:46,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:46,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-11 23:43:46,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080702912] [2022-07-11 23:43:46,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:46,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-11 23:43:46,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:46,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-11 23:43:46,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:43:46,812 INFO L87 Difference]: Start difference. First operand 602 states and 781 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-11 23:43:47,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:47,229 INFO L93 Difference]: Finished difference Result 687 states and 894 transitions. [2022-07-11 23:43:47,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:43:47,230 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-11 23:43:47,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:47,231 INFO L225 Difference]: With dead ends: 687 [2022-07-11 23:43:47,231 INFO L226 Difference]: Without dead ends: 681 [2022-07-11 23:43:47,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-11 23:43:47,232 INFO L413 NwaCegarLoop]: 464 mSDtfsCounter, 716 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:47,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 1535 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:43:47,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2022-07-11 23:43:47,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 602. [2022-07-11 23:43:47,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 512 states have (on average 1.2890625) internal successors, (660), 518 states have internal predecessors, (660), 53 states have call successors, (53), 27 states have call predecessors, (53), 36 states have return successors, (67), 56 states have call predecessors, (67), 49 states have call successors, (67) [2022-07-11 23:43:47,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 780 transitions. [2022-07-11 23:43:47,259 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 780 transitions. Word has length 53 [2022-07-11 23:43:47,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:47,259 INFO L495 AbstractCegarLoop]: Abstraction has 602 states and 780 transitions. [2022-07-11 23:43:47,259 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-11 23:43:47,259 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 780 transitions. [2022-07-11 23:43:47,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-11 23:43:47,260 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:47,260 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-11 23:43:47,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-07-11 23:43:47,261 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:47,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:47,261 INFO L85 PathProgramCache]: Analyzing trace with hash 2028580847, now seen corresponding path program 1 times [2022-07-11 23:43:47,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:47,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832678056] [2022-07-11 23:43:47,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:47,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:47,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-11 23:43:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:47,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-11 23:43:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:47,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:47,378 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-11 23:43:47,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:47,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832678056] [2022-07-11 23:43:47,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832678056] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:47,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:47,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-11 23:43:47,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904835845] [2022-07-11 23:43:47,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:47,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-11 23:43:47,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:47,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-11 23:43:47,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-07-11 23:43:47,379 INFO L87 Difference]: Start difference. First operand 602 states and 780 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-11 23:43:48,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:48,110 INFO L93 Difference]: Finished difference Result 634 states and 819 transitions. [2022-07-11 23:43:48,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-11 23:43:48,111 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-11 23:43:48,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:48,112 INFO L225 Difference]: With dead ends: 634 [2022-07-11 23:43:48,112 INFO L226 Difference]: Without dead ends: 610 [2022-07-11 23:43:48,112 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-11 23:43:48,112 INFO L413 NwaCegarLoop]: 414 mSDtfsCounter, 252 mSDsluCounter, 3530 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 3944 SdHoareTripleChecker+Invalid, 1701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:48,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 3944 Invalid, 1701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1600 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-11 23:43:48,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-07-11 23:43:48,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 598. [2022-07-11 23:43:48,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 509 states have (on average 1.2888015717092338) internal successors, (656), 515 states have internal predecessors, (656), 52 states have call successors, (52), 27 states have call predecessors, (52), 36 states have return successors, (66), 55 states have call predecessors, (66), 48 states have call successors, (66) [2022-07-11 23:43:48,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 774 transitions. [2022-07-11 23:43:48,137 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 774 transitions. Word has length 55 [2022-07-11 23:43:48,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:48,137 INFO L495 AbstractCegarLoop]: Abstraction has 598 states and 774 transitions. [2022-07-11 23:43:48,137 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-11 23:43:48,137 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 774 transitions. [2022-07-11 23:43:48,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-11 23:43:48,138 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:48,138 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-11 23:43:48,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-07-11 23:43:48,139 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:48,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:48,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1717160597, now seen corresponding path program 1 times [2022-07-11 23:43:48,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:48,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638943803] [2022-07-11 23:43:48,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:48,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:48,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-11 23:43:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:48,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-11 23:43:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:48,171 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-11 23:43:48,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:48,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638943803] [2022-07-11 23:43:48,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638943803] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:48,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:48,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-11 23:43:48,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107918543] [2022-07-11 23:43:48,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:48,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-11 23:43:48,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:48,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-11 23:43:48,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:43:48,172 INFO L87 Difference]: Start difference. First operand 598 states and 774 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-11 23:43:48,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:48,382 INFO L93 Difference]: Finished difference Result 637 states and 820 transitions. [2022-07-11 23:43:48,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-11 23:43:48,382 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-11 23:43:48,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:48,384 INFO L225 Difference]: With dead ends: 637 [2022-07-11 23:43:48,384 INFO L226 Difference]: Without dead ends: 605 [2022-07-11 23:43:48,384 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-11 23:43:48,384 INFO L413 NwaCegarLoop]: 405 mSDtfsCounter, 171 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 1696 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:48,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 1696 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:43:48,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2022-07-11 23:43:48,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 593. [2022-07-11 23:43:48,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 505 states have (on average 1.2891089108910891) internal successors, (651), 511 states have internal predecessors, (651), 51 states have call successors, (51), 27 states have call predecessors, (51), 36 states have return successors, (65), 54 states have call predecessors, (65), 47 states have call successors, (65) [2022-07-11 23:43:48,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 767 transitions. [2022-07-11 23:43:48,409 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 767 transitions. Word has length 54 [2022-07-11 23:43:48,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:48,409 INFO L495 AbstractCegarLoop]: Abstraction has 593 states and 767 transitions. [2022-07-11 23:43:48,409 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-11 23:43:48,409 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 767 transitions. [2022-07-11 23:43:48,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-11 23:43:48,410 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:48,410 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-11 23:43:48,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-07-11 23:43:48,410 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:48,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:48,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1513646241, now seen corresponding path program 1 times [2022-07-11 23:43:48,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:48,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013593508] [2022-07-11 23:43:48,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:48,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:48,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-11 23:43:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:48,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-11 23:43:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:48,466 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-11 23:43:48,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:48,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013593508] [2022-07-11 23:43:48,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013593508] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:48,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:48,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-11 23:43:48,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881631614] [2022-07-11 23:43:48,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:48,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:43:48,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:48,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:43:48,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:43:48,467 INFO L87 Difference]: Start difference. First operand 593 states and 767 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-11 23:43:48,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:48,819 INFO L93 Difference]: Finished difference Result 628 states and 810 transitions. [2022-07-11 23:43:48,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-11 23:43:48,819 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-11 23:43:48,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:48,821 INFO L225 Difference]: With dead ends: 628 [2022-07-11 23:43:48,821 INFO L226 Difference]: Without dead ends: 602 [2022-07-11 23:43:48,821 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-11 23:43:48,821 INFO L413 NwaCegarLoop]: 414 mSDtfsCounter, 232 mSDsluCounter, 2698 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 3112 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:48,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 3112 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:43:48,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2022-07-11 23:43:48,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 590. [2022-07-11 23:43:48,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 503 states have (on average 1.2882703777335984) internal successors, (648), 509 states have internal predecessors, (648), 50 states have call successors, (50), 27 states have call predecessors, (50), 36 states have return successors, (64), 53 states have call predecessors, (64), 46 states have call successors, (64) [2022-07-11 23:43:48,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 762 transitions. [2022-07-11 23:43:48,846 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 762 transitions. Word has length 54 [2022-07-11 23:43:48,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:48,846 INFO L495 AbstractCegarLoop]: Abstraction has 590 states and 762 transitions. [2022-07-11 23:43:48,846 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-11 23:43:48,846 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 762 transitions. [2022-07-11 23:43:48,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-11 23:43:48,847 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:48,847 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-11 23:43:48,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-07-11 23:43:48,847 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:48,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:48,847 INFO L85 PathProgramCache]: Analyzing trace with hash 773886590, now seen corresponding path program 1 times [2022-07-11 23:43:48,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:48,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924661729] [2022-07-11 23:43:48,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:48,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:48,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-11 23:43:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:48,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:48,888 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-11 23:43:48,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:48,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924661729] [2022-07-11 23:43:48,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924661729] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:48,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:48,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-11 23:43:48,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763351253] [2022-07-11 23:43:48,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:48,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-11 23:43:48,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:48,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-11 23:43:48,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:43:48,890 INFO L87 Difference]: Start difference. First operand 590 states and 762 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-11 23:43:49,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:49,299 INFO L93 Difference]: Finished difference Result 673 states and 872 transitions. [2022-07-11 23:43:49,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-11 23:43:49,299 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-11 23:43:49,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:49,301 INFO L225 Difference]: With dead ends: 673 [2022-07-11 23:43:49,301 INFO L226 Difference]: Without dead ends: 669 [2022-07-11 23:43:49,301 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-11 23:43:49,301 INFO L413 NwaCegarLoop]: 443 mSDtfsCounter, 696 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:49,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 1461 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:43:49,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-07-11 23:43:49,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 588. [2022-07-11 23:43:49,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 501 states have (on average 1.2874251497005988) internal successors, (645), 507 states have internal predecessors, (645), 50 states have call successors, (50), 27 states have call predecessors, (50), 36 states have return successors, (64), 53 states have call predecessors, (64), 46 states have call successors, (64) [2022-07-11 23:43:49,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 759 transitions. [2022-07-11 23:43:49,328 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 759 transitions. Word has length 54 [2022-07-11 23:43:49,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:49,328 INFO L495 AbstractCegarLoop]: Abstraction has 588 states and 759 transitions. [2022-07-11 23:43:49,328 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-11 23:43:49,328 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 759 transitions. [2022-07-11 23:43:49,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-11 23:43:49,329 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:49,329 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-11 23:43:49,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-07-11 23:43:49,331 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:49,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:49,331 INFO L85 PathProgramCache]: Analyzing trace with hash 774163420, now seen corresponding path program 1 times [2022-07-11 23:43:49,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:49,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780319781] [2022-07-11 23:43:49,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:49,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:49,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-11 23:43:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:49,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:49,426 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-11 23:43:49,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:49,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780319781] [2022-07-11 23:43:49,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780319781] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:49,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:49,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-11 23:43:49,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745386641] [2022-07-11 23:43:49,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:49,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:43:49,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:49,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:43:49,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:43:49,427 INFO L87 Difference]: Start difference. First operand 588 states and 759 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-11 23:43:49,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:49,981 INFO L93 Difference]: Finished difference Result 610 states and 786 transitions. [2022-07-11 23:43:49,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-11 23:43:49,981 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-11 23:43:49,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:49,983 INFO L225 Difference]: With dead ends: 610 [2022-07-11 23:43:49,983 INFO L226 Difference]: Without dead ends: 562 [2022-07-11 23:43:49,983 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-11 23:43:49,983 INFO L413 NwaCegarLoop]: 383 mSDtfsCounter, 211 mSDsluCounter, 2380 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 2763 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:49,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 2763 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-11 23:43:49,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2022-07-11 23:43:50,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 546. [2022-07-11 23:43:50,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 461 states have (on average 1.2776572668112798) internal successors, (589), 467 states have internal predecessors, (589), 50 states have call successors, (50), 27 states have call predecessors, (50), 34 states have return successors, (62), 51 states have call predecessors, (62), 46 states have call successors, (62) [2022-07-11 23:43:50,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 701 transitions. [2022-07-11 23:43:50,007 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 701 transitions. Word has length 54 [2022-07-11 23:43:50,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:50,007 INFO L495 AbstractCegarLoop]: Abstraction has 546 states and 701 transitions. [2022-07-11 23:43:50,007 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-11 23:43:50,008 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 701 transitions. [2022-07-11 23:43:50,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-11 23:43:50,008 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:50,008 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-11 23:43:50,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-07-11 23:43:50,009 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:50,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:50,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1350619309, now seen corresponding path program 1 times [2022-07-11 23:43:50,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:50,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851582983] [2022-07-11 23:43:50,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:50,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:50,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:50,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-11 23:43:50,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:50,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-11 23:43:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:50,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:50,058 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-11 23:43:50,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:50,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851582983] [2022-07-11 23:43:50,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851582983] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:50,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:50,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-11 23:43:50,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448683846] [2022-07-11 23:43:50,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:50,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-11 23:43:50,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:50,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-11 23:43:50,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-11 23:43:50,060 INFO L87 Difference]: Start difference. First operand 546 states and 701 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-11 23:43:50,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:50,372 INFO L93 Difference]: Finished difference Result 607 states and 771 transitions. [2022-07-11 23:43:50,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-11 23:43:50,372 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-11 23:43:50,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:50,373 INFO L225 Difference]: With dead ends: 607 [2022-07-11 23:43:50,373 INFO L226 Difference]: Without dead ends: 576 [2022-07-11 23:43:50,373 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-11 23:43:50,374 INFO L413 NwaCegarLoop]: 405 mSDtfsCounter, 187 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1767 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:50,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 1767 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:43:50,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2022-07-11 23:43:50,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 546. [2022-07-11 23:43:50,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 461 states have (on average 1.2754880694143167) internal successors, (588), 467 states have internal predecessors, (588), 50 states have call successors, (50), 27 states have call predecessors, (50), 34 states have return successors, (62), 51 states have call predecessors, (62), 46 states have call successors, (62) [2022-07-11 23:43:50,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 700 transitions. [2022-07-11 23:43:50,408 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 700 transitions. Word has length 56 [2022-07-11 23:43:50,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:50,408 INFO L495 AbstractCegarLoop]: Abstraction has 546 states and 700 transitions. [2022-07-11 23:43:50,408 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-11 23:43:50,408 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 700 transitions. [2022-07-11 23:43:50,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-11 23:43:50,411 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:50,412 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-11 23:43:50,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-07-11 23:43:50,412 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:50,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:50,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1373251563, now seen corresponding path program 1 times [2022-07-11 23:43:50,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:50,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016612298] [2022-07-11 23:43:50,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:50,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:50,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-11 23:43:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:50,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-11 23:43:50,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:50,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:50,513 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-11 23:43:50,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:50,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016612298] [2022-07-11 23:43:50,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016612298] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:50,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:50,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-11 23:43:50,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952082005] [2022-07-11 23:43:50,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:50,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-11 23:43:50,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:50,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-11 23:43:50,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-11 23:43:50,514 INFO L87 Difference]: Start difference. First operand 546 states and 700 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-11 23:43:51,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:51,100 INFO L93 Difference]: Finished difference Result 601 states and 767 transitions. [2022-07-11 23:43:51,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-11 23:43:51,100 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-11 23:43:51,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:51,102 INFO L225 Difference]: With dead ends: 601 [2022-07-11 23:43:51,102 INFO L226 Difference]: Without dead ends: 571 [2022-07-11 23:43:51,102 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-11 23:43:51,103 INFO L413 NwaCegarLoop]: 399 mSDtfsCounter, 276 mSDsluCounter, 2836 mSDsCounter, 0 mSdLazyCounter, 1310 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 3235 SdHoareTripleChecker+Invalid, 1412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:51,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 3235 Invalid, 1412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1310 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-11 23:43:51,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-07-11 23:43:51,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 541. [2022-07-11 23:43:51,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 457 states have (on average 1.2713347921225382) internal successors, (581), 463 states have internal predecessors, (581), 49 states have call successors, (49), 27 states have call predecessors, (49), 34 states have return successors, (60), 50 states have call predecessors, (60), 45 states have call successors, (60) [2022-07-11 23:43:51,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 690 transitions. [2022-07-11 23:43:51,129 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 690 transitions. Word has length 56 [2022-07-11 23:43:51,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:51,129 INFO L495 AbstractCegarLoop]: Abstraction has 541 states and 690 transitions. [2022-07-11 23:43:51,129 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-11 23:43:51,130 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 690 transitions. [2022-07-11 23:43:51,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-11 23:43:51,130 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:51,131 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-11 23:43:51,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-07-11 23:43:51,131 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:51,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:51,131 INFO L85 PathProgramCache]: Analyzing trace with hash -801787505, now seen corresponding path program 1 times [2022-07-11 23:43:51,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:51,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7370465] [2022-07-11 23:43:51,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:51,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:51,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-11 23:43:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:51,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-11 23:43:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:51,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:51,171 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-11 23:43:51,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:51,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7370465] [2022-07-11 23:43:51,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7370465] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:51,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:51,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-11 23:43:51,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677208606] [2022-07-11 23:43:51,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:51,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-11 23:43:51,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:51,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-11 23:43:51,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-11 23:43:51,173 INFO L87 Difference]: Start difference. First operand 541 states and 690 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-11 23:43:51,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:51,459 INFO L93 Difference]: Finished difference Result 584 states and 740 transitions. [2022-07-11 23:43:51,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-11 23:43:51,460 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-11 23:43:51,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:51,461 INFO L225 Difference]: With dead ends: 584 [2022-07-11 23:43:51,461 INFO L226 Difference]: Without dead ends: 547 [2022-07-11 23:43:51,461 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-11 23:43:51,461 INFO L413 NwaCegarLoop]: 377 mSDtfsCounter, 261 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 1436 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:51,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 1436 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:43:51,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2022-07-11 23:43:51,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 535. [2022-07-11 23:43:51,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 452 states have (on average 1.2721238938053097) internal successors, (575), 458 states have internal predecessors, (575), 48 states have call successors, (48), 27 states have call predecessors, (48), 34 states have return successors, (59), 49 states have call predecessors, (59), 44 states have call successors, (59) [2022-07-11 23:43:51,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 682 transitions. [2022-07-11 23:43:51,485 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 682 transitions. Word has length 56 [2022-07-11 23:43:51,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:51,485 INFO L495 AbstractCegarLoop]: Abstraction has 535 states and 682 transitions. [2022-07-11 23:43:51,485 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-11 23:43:51,485 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 682 transitions. [2022-07-11 23:43:51,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-11 23:43:51,486 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:51,486 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-11 23:43:51,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-07-11 23:43:51,486 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:51,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:51,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1511727278, now seen corresponding path program 1 times [2022-07-11 23:43:51,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:51,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088296959] [2022-07-11 23:43:51,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:51,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:51,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-11 23:43:51,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:51,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-11 23:43:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:51,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:51,524 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-11 23:43:51,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:51,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088296959] [2022-07-11 23:43:51,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088296959] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:51,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:51,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-11 23:43:51,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765726216] [2022-07-11 23:43:51,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:51,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-11 23:43:51,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:51,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-11 23:43:51,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-11 23:43:51,525 INFO L87 Difference]: Start difference. First operand 535 states and 682 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-11 23:43:51,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:51,831 INFO L93 Difference]: Finished difference Result 578 states and 732 transitions. [2022-07-11 23:43:51,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-11 23:43:51,832 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-11 23:43:51,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:51,833 INFO L225 Difference]: With dead ends: 578 [2022-07-11 23:43:51,833 INFO L226 Difference]: Without dead ends: 535 [2022-07-11 23:43:51,833 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-11 23:43:51,833 INFO L413 NwaCegarLoop]: 367 mSDtfsCounter, 168 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1805 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:51,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1805 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:43:51,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2022-07-11 23:43:51,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 523. [2022-07-11 23:43:51,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 441 states have (on average 1.2675736961451247) internal successors, (559), 447 states have internal predecessors, (559), 47 states have call successors, (47), 27 states have call predecessors, (47), 34 states have return successors, (58), 48 states have call predecessors, (58), 43 states have call successors, (58) [2022-07-11 23:43:51,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 664 transitions. [2022-07-11 23:43:51,857 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 664 transitions. Word has length 58 [2022-07-11 23:43:51,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:51,857 INFO L495 AbstractCegarLoop]: Abstraction has 523 states and 664 transitions. [2022-07-11 23:43:51,857 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-11 23:43:51,857 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 664 transitions. [2022-07-11 23:43:51,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-11 23:43:51,858 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:51,858 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-11 23:43:51,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-07-11 23:43:51,858 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:51,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:51,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1341431007, now seen corresponding path program 1 times [2022-07-11 23:43:51,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:51,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934242706] [2022-07-11 23:43:51,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:51,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:51,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-11 23:43:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:51,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-11 23:43:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:51,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-11 23:43:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:51,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:51,942 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-11 23:43:51,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:51,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934242706] [2022-07-11 23:43:51,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934242706] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:51,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:51,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-11 23:43:51,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112111366] [2022-07-11 23:43:51,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:51,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-11 23:43:51,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:51,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-11 23:43:51,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-11 23:43:51,944 INFO L87 Difference]: Start difference. First operand 523 states and 664 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-11 23:43:52,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:52,571 INFO L93 Difference]: Finished difference Result 571 states and 720 transitions. [2022-07-11 23:43:52,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-11 23:43:52,571 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-11 23:43:52,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:52,572 INFO L225 Difference]: With dead ends: 571 [2022-07-11 23:43:52,572 INFO L226 Difference]: Without dead ends: 551 [2022-07-11 23:43:52,572 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-11 23:43:52,573 INFO L413 NwaCegarLoop]: 356 mSDtfsCounter, 249 mSDsluCounter, 2903 mSDsCounter, 0 mSdLazyCounter, 1488 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 3259 SdHoareTripleChecker+Invalid, 1575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:52,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 3259 Invalid, 1575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1488 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-11 23:43:52,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2022-07-11 23:43:52,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 521. [2022-07-11 23:43:52,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 440 states have (on average 1.2659090909090909) internal successors, (557), 446 states have internal predecessors, (557), 46 states have call successors, (46), 27 states have call predecessors, (46), 34 states have return successors, (57), 47 states have call predecessors, (57), 42 states have call successors, (57) [2022-07-11 23:43:52,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 660 transitions. [2022-07-11 23:43:52,596 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 660 transitions. Word has length 59 [2022-07-11 23:43:52,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:52,596 INFO L495 AbstractCegarLoop]: Abstraction has 521 states and 660 transitions. [2022-07-11 23:43:52,596 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-11 23:43:52,597 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 660 transitions. [2022-07-11 23:43:52,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-11 23:43:52,597 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:52,597 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-11 23:43:52,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-07-11 23:43:52,598 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:52,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:52,598 INFO L85 PathProgramCache]: Analyzing trace with hash 477751716, now seen corresponding path program 1 times [2022-07-11 23:43:52,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:52,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975485853] [2022-07-11 23:43:52,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:52,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:52,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-11 23:43:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:52,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:52,707 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-11 23:43:52,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:52,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975485853] [2022-07-11 23:43:52,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975485853] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:52,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:52,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-11 23:43:52,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528873162] [2022-07-11 23:43:52,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:52,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-11 23:43:52,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:52,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-11 23:43:52,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-11 23:43:52,709 INFO L87 Difference]: Start difference. First operand 521 states and 660 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-11 23:43:53,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:53,230 INFO L93 Difference]: Finished difference Result 549 states and 694 transitions. [2022-07-11 23:43:53,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-11 23:43:53,230 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-11 23:43:53,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:53,232 INFO L225 Difference]: With dead ends: 549 [2022-07-11 23:43:53,232 INFO L226 Difference]: Without dead ends: 531 [2022-07-11 23:43:53,232 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-11 23:43:53,233 INFO L413 NwaCegarLoop]: 349 mSDtfsCounter, 115 mSDsluCounter, 2538 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 2887 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:53,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 2887 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-11 23:43:53,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2022-07-11 23:43:53,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 519. [2022-07-11 23:43:53,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 439 states have (on average 1.2642369020501139) internal successors, (555), 445 states have internal predecessors, (555), 45 states have call successors, (45), 27 states have call predecessors, (45), 34 states have return successors, (56), 46 states have call predecessors, (56), 41 states have call successors, (56) [2022-07-11 23:43:53,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 656 transitions. [2022-07-11 23:43:53,257 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 656 transitions. Word has length 57 [2022-07-11 23:43:53,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:53,258 INFO L495 AbstractCegarLoop]: Abstraction has 519 states and 656 transitions. [2022-07-11 23:43:53,258 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-11 23:43:53,258 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 656 transitions. [2022-07-11 23:43:53,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-11 23:43:53,259 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:53,260 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-11 23:43:53,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-07-11 23:43:53,260 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:53,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:53,260 INFO L85 PathProgramCache]: Analyzing trace with hash 999008539, now seen corresponding path program 1 times [2022-07-11 23:43:53,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:53,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675792490] [2022-07-11 23:43:53,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:53,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:53,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-11 23:43:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:53,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:53,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-11 23:43:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:53,376 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-11 23:43:53,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:53,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675792490] [2022-07-11 23:43:53,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675792490] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:53,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:53,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-11 23:43:53,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414188015] [2022-07-11 23:43:53,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:53,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:43:53,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:53,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:43:53,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:43:53,377 INFO L87 Difference]: Start difference. First operand 519 states and 656 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-11 23:43:54,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:54,473 INFO L93 Difference]: Finished difference Result 1057 states and 1338 transitions. [2022-07-11 23:43:54,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-11 23:43:54,474 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-11 23:43:54,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:54,476 INFO L225 Difference]: With dead ends: 1057 [2022-07-11 23:43:54,476 INFO L226 Difference]: Without dead ends: 940 [2022-07-11 23:43:54,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=1153, Unknown=0, NotChecked=0, Total=1406 [2022-07-11 23:43:54,476 INFO L413 NwaCegarLoop]: 404 mSDtfsCounter, 943 mSDsluCounter, 1927 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 2331 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:54,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [964 Valid, 2331 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-11 23:43:54,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2022-07-11 23:43:54,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 716. [2022-07-11 23:43:54,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 601 states have (on average 1.276206322795341) internal successors, (767), 614 states have internal predecessors, (767), 63 states have call successors, (63), 40 states have call predecessors, (63), 51 states have return successors, (82), 61 states have call predecessors, (82), 59 states have call successors, (82) [2022-07-11 23:43:54,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 912 transitions. [2022-07-11 23:43:54,515 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 912 transitions. Word has length 58 [2022-07-11 23:43:54,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:54,515 INFO L495 AbstractCegarLoop]: Abstraction has 716 states and 912 transitions. [2022-07-11 23:43:54,515 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-11 23:43:54,515 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 912 transitions. [2022-07-11 23:43:54,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-11 23:43:54,516 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:54,516 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-11 23:43:54,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-07-11 23:43:54,516 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:54,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:54,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1875027545, now seen corresponding path program 1 times [2022-07-11 23:43:54,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:54,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836231248] [2022-07-11 23:43:54,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:54,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:54,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-11 23:43:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:54,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:54,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-11 23:43:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:54,549 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-11 23:43:54,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:54,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836231248] [2022-07-11 23:43:54,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836231248] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:54,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:54,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-11 23:43:54,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298790078] [2022-07-11 23:43:54,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:54,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-11 23:43:54,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:54,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-11 23:43:54,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:43:54,551 INFO L87 Difference]: Start difference. First operand 716 states and 912 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-11 23:43:55,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:55,019 INFO L93 Difference]: Finished difference Result 1041 states and 1317 transitions. [2022-07-11 23:43:55,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-11 23:43:55,019 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-11 23:43:55,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:55,021 INFO L225 Difference]: With dead ends: 1041 [2022-07-11 23:43:55,021 INFO L226 Difference]: Without dead ends: 957 [2022-07-11 23:43:55,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-07-11 23:43:55,022 INFO L413 NwaCegarLoop]: 652 mSDtfsCounter, 1092 mSDsluCounter, 1186 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1133 SdHoareTripleChecker+Valid, 1838 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:55,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1133 Valid, 1838 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-11 23:43:55,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2022-07-11 23:43:55,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 532. [2022-07-11 23:43:55,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 451 states have (on average 1.2594235033259424) internal successors, (568), 456 states have internal predecessors, (568), 45 states have call successors, (45), 29 states have call predecessors, (45), 35 states have return successors, (56), 46 states have call predecessors, (56), 41 states have call successors, (56) [2022-07-11 23:43:55,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 669 transitions. [2022-07-11 23:43:55,062 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 669 transitions. Word has length 58 [2022-07-11 23:43:55,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:55,062 INFO L495 AbstractCegarLoop]: Abstraction has 532 states and 669 transitions. [2022-07-11 23:43:55,062 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-11 23:43:55,062 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 669 transitions. [2022-07-11 23:43:55,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-11 23:43:55,063 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:55,063 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-11 23:43:55,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-07-11 23:43:55,063 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:55,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:55,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1125550286, now seen corresponding path program 1 times [2022-07-11 23:43:55,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:55,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199720418] [2022-07-11 23:43:55,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:55,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:55,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-11 23:43:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:55,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-11 23:43:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:55,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-11 23:43:55,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:55,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:55,149 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-11 23:43:55,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:55,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199720418] [2022-07-11 23:43:55,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199720418] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:55,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:55,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-11 23:43:55,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796520082] [2022-07-11 23:43:55,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:55,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-11 23:43:55,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:55,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-11 23:43:55,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-11 23:43:55,150 INFO L87 Difference]: Start difference. First operand 532 states and 669 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-11 23:43:55,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:55,752 INFO L93 Difference]: Finished difference Result 567 states and 713 transitions. [2022-07-11 23:43:55,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-11 23:43:55,752 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-11 23:43:55,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:55,753 INFO L225 Difference]: With dead ends: 567 [2022-07-11 23:43:55,753 INFO L226 Difference]: Without dead ends: 535 [2022-07-11 23:43:55,753 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-11 23:43:55,754 INFO L413 NwaCegarLoop]: 361 mSDtfsCounter, 303 mSDsluCounter, 2407 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 2768 SdHoareTripleChecker+Invalid, 1499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:55,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 2768 Invalid, 1499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1378 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-11 23:43:55,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2022-07-11 23:43:55,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 523. [2022-07-11 23:43:55,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 444 states have (on average 1.2567567567567568) internal successors, (558), 449 states have internal predecessors, (558), 43 states have call successors, (43), 29 states have call predecessors, (43), 35 states have return successors, (53), 44 states have call predecessors, (53), 39 states have call successors, (53) [2022-07-11 23:43:55,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 654 transitions. [2022-07-11 23:43:55,785 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 654 transitions. Word has length 60 [2022-07-11 23:43:55,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:55,785 INFO L495 AbstractCegarLoop]: Abstraction has 523 states and 654 transitions. [2022-07-11 23:43:55,785 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-11 23:43:55,785 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 654 transitions. [2022-07-11 23:43:55,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-11 23:43:55,786 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:55,786 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-11 23:43:55,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-07-11 23:43:55,786 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:55,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:55,786 INFO L85 PathProgramCache]: Analyzing trace with hash 2088220112, now seen corresponding path program 1 times [2022-07-11 23:43:55,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:55,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400017072] [2022-07-11 23:43:55,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:55,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:55,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-11 23:43:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:55,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-11 23:43:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:55,817 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-11 23:43:55,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:55,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400017072] [2022-07-11 23:43:55,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400017072] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:55,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:55,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-11 23:43:55,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982040188] [2022-07-11 23:43:55,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:55,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-11 23:43:55,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:55,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-11 23:43:55,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:43:55,818 INFO L87 Difference]: Start difference. First operand 523 states and 654 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-11 23:43:56,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:56,048 INFO L93 Difference]: Finished difference Result 562 states and 699 transitions. [2022-07-11 23:43:56,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-11 23:43:56,048 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-11 23:43:56,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:56,050 INFO L225 Difference]: With dead ends: 562 [2022-07-11 23:43:56,050 INFO L226 Difference]: Without dead ends: 527 [2022-07-11 23:43:56,050 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-11 23:43:56,051 INFO L413 NwaCegarLoop]: 341 mSDtfsCounter, 92 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:56,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 1579 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:43:56,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2022-07-11 23:43:56,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 515. [2022-07-11 23:43:56,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 437 states have (on average 1.2562929061784898) internal successors, (549), 442 states have internal predecessors, (549), 42 states have call successors, (42), 29 states have call predecessors, (42), 35 states have return successors, (51), 43 states have call predecessors, (51), 38 states have call successors, (51) [2022-07-11 23:43:56,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 642 transitions. [2022-07-11 23:43:56,084 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 642 transitions. Word has length 58 [2022-07-11 23:43:56,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:56,084 INFO L495 AbstractCegarLoop]: Abstraction has 515 states and 642 transitions. [2022-07-11 23:43:56,084 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-11 23:43:56,084 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 642 transitions. [2022-07-11 23:43:56,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-11 23:43:56,085 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:56,085 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:56,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-07-11 23:43:56,085 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:56,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:56,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1074633973, now seen corresponding path program 1 times [2022-07-11 23:43:56,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:56,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134980684] [2022-07-11 23:43:56,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:56,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:56,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:43:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:56,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-11 23:43:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:56,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-11 23:43:56,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:56,128 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-11 23:43:56,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:56,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134980684] [2022-07-11 23:43:56,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134980684] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:56,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:56,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-11 23:43:56,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214486375] [2022-07-11 23:43:56,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:56,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-11 23:43:56,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:56,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-11 23:43:56,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:43:56,129 INFO L87 Difference]: Start difference. First operand 515 states and 642 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-11 23:43:56,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:56,315 INFO L93 Difference]: Finished difference Result 554 states and 687 transitions. [2022-07-11 23:43:56,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-11 23:43:56,315 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), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2022-07-11 23:43:56,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:56,332 INFO L225 Difference]: With dead ends: 554 [2022-07-11 23:43:56,332 INFO L226 Difference]: Without dead ends: 517 [2022-07-11 23:43:56,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 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-11 23:43:56,332 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 156 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:56,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 1361 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:43:56,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2022-07-11 23:43:56,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 505. [2022-07-11 23:43:56,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 429 states have (on average 1.2564102564102564) internal successors, (539), 434 states have internal predecessors, (539), 40 states have call successors, (40), 29 states have call predecessors, (40), 35 states have return successors, (49), 41 states have call predecessors, (49), 36 states have call successors, (49) [2022-07-11 23:43:56,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 628 transitions. [2022-07-11 23:43:56,363 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 628 transitions. Word has length 60 [2022-07-11 23:43:56,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:56,363 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 628 transitions. [2022-07-11 23:43:56,363 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), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-11 23:43:56,363 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 628 transitions. [2022-07-11 23:43:56,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-11 23:43:56,364 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:56,364 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-11 23:43:56,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-07-11 23:43:56,364 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:56,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:56,364 INFO L85 PathProgramCache]: Analyzing trace with hash 175179390, now seen corresponding path program 1 times [2022-07-11 23:43:56,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:56,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803893328] [2022-07-11 23:43:56,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:56,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:56,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-11 23:43:56,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:56,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:56,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-11 23:43:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:56,451 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-11 23:43:56,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:56,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803893328] [2022-07-11 23:43:56,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803893328] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:56,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:56,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-11 23:43:56,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497744449] [2022-07-11 23:43:56,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:56,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-11 23:43:56,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:56,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-11 23:43:56,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-11 23:43:56,452 INFO L87 Difference]: Start difference. First operand 505 states and 628 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 8 states have internal predecessors, (53), 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-11 23:43:57,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:57,187 INFO L93 Difference]: Finished difference Result 892 states and 1122 transitions. [2022-07-11 23:43:57,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-11 23:43:57,187 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 8 states have internal predecessors, (53), 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 60 [2022-07-11 23:43:57,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:57,189 INFO L225 Difference]: With dead ends: 892 [2022-07-11 23:43:57,189 INFO L226 Difference]: Without dead ends: 787 [2022-07-11 23:43:57,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2022-07-11 23:43:57,190 INFO L413 NwaCegarLoop]: 560 mSDtfsCounter, 545 mSDsluCounter, 2700 mSDsCounter, 0 mSdLazyCounter, 1483 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 3260 SdHoareTripleChecker+Invalid, 1637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:57,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 3260 Invalid, 1637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1483 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-11 23:43:57,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2022-07-11 23:43:57,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 399. [2022-07-11 23:43:57,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 335 states have (on average 1.2686567164179106) internal successors, (425), 339 states have internal predecessors, (425), 35 states have call successors, (35), 25 states have call predecessors, (35), 28 states have return successors, (42), 34 states have call predecessors, (42), 32 states have call successors, (42) [2022-07-11 23:43:57,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 502 transitions. [2022-07-11 23:43:57,217 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 502 transitions. Word has length 60 [2022-07-11 23:43:57,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:57,217 INFO L495 AbstractCegarLoop]: Abstraction has 399 states and 502 transitions. [2022-07-11 23:43:57,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 8 states have internal predecessors, (53), 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-11 23:43:57,217 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 502 transitions. [2022-07-11 23:43:57,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-11 23:43:57,218 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:57,218 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-11 23:43:57,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-07-11 23:43:57,218 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:57,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:57,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1562268864, now seen corresponding path program 1 times [2022-07-11 23:43:57,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:57,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996570686] [2022-07-11 23:43:57,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:57,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:57,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-11 23:43:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:57,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-11 23:43:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:57,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-11 23:43:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:57,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:57,302 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-11 23:43:57,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:57,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996570686] [2022-07-11 23:43:57,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996570686] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:57,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:57,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-11 23:43:57,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32430781] [2022-07-11 23:43:57,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:57,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-11 23:43:57,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:57,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-11 23:43:57,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-11 23:43:57,304 INFO L87 Difference]: Start difference. First operand 399 states and 502 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-11 23:43:57,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:57,826 INFO L93 Difference]: Finished difference Result 431 states and 540 transitions. [2022-07-11 23:43:57,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-11 23:43:57,827 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-11 23:43:57,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:57,827 INFO L225 Difference]: With dead ends: 431 [2022-07-11 23:43:57,828 INFO L226 Difference]: Without dead ends: 409 [2022-07-11 23:43:57,828 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-11 23:43:57,828 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 194 mSDsluCounter, 1992 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 2280 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:57,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 2280 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-11 23:43:57,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-07-11 23:43:57,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 397. [2022-07-11 23:43:57,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 333 states have (on average 1.2672672672672673) internal successors, (422), 337 states have internal predecessors, (422), 35 states have call successors, (35), 25 states have call predecessors, (35), 28 states have return successors, (42), 34 states have call predecessors, (42), 32 states have call successors, (42) [2022-07-11 23:43:57,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 499 transitions. [2022-07-11 23:43:57,853 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 499 transitions. Word has length 62 [2022-07-11 23:43:57,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:57,854 INFO L495 AbstractCegarLoop]: Abstraction has 397 states and 499 transitions. [2022-07-11 23:43:57,854 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-11 23:43:57,854 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 499 transitions. [2022-07-11 23:43:57,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-11 23:43:57,854 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:57,854 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-11 23:43:57,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-07-11 23:43:57,855 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:57,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:57,855 INFO L85 PathProgramCache]: Analyzing trace with hash 224602701, now seen corresponding path program 1 times [2022-07-11 23:43:57,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:57,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584177814] [2022-07-11 23:43:57,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:57,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:57,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:57,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-11 23:43:57,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:57,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:43:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:57,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:43:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:57,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-11 23:43:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:57,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-11 23:43:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:57,951 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-11 23:43:57,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:57,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584177814] [2022-07-11 23:43:57,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584177814] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:57,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:57,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-11 23:43:57,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038700926] [2022-07-11 23:43:57,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:57,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-11 23:43:57,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:57,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-11 23:43:57,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-11 23:43:57,953 INFO L87 Difference]: Start difference. First operand 397 states and 499 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-11 23:43:58,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:58,303 INFO L93 Difference]: Finished difference Result 594 states and 758 transitions. [2022-07-11 23:43:58,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:43:58,307 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 64 [2022-07-11 23:43:58,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:58,308 INFO L225 Difference]: With dead ends: 594 [2022-07-11 23:43:58,308 INFO L226 Difference]: Without dead ends: 402 [2022-07-11 23:43:58,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-11 23:43:58,309 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 236 mSDsluCounter, 1263 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 1542 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:58,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 1542 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:43:58,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-07-11 23:43:58,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 390. [2022-07-11 23:43:58,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 326 states have (on average 1.2607361963190185) internal successors, (411), 330 states have internal predecessors, (411), 35 states have call successors, (35), 25 states have call predecessors, (35), 28 states have return successors, (42), 34 states have call predecessors, (42), 32 states have call successors, (42) [2022-07-11 23:43:58,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 488 transitions. [2022-07-11 23:43:58,346 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 488 transitions. Word has length 64 [2022-07-11 23:43:58,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:58,346 INFO L495 AbstractCegarLoop]: Abstraction has 390 states and 488 transitions. [2022-07-11 23:43:58,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-11 23:43:58,346 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 488 transitions. [2022-07-11 23:43:58,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-11 23:43:58,347 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:58,347 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, 1, 1] [2022-07-11 23:43:58,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-07-11 23:43:58,347 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:58,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:58,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1555287307, now seen corresponding path program 1 times [2022-07-11 23:43:58,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:58,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269118362] [2022-07-11 23:43:58,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:58,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:58,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-11 23:43:58,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:58,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-11 23:43:58,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:58,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-11 23:43:58,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:58,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:58,389 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-11 23:43:58,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:58,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269118362] [2022-07-11 23:43:58,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269118362] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:58,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:58,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-11 23:43:58,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751765230] [2022-07-11 23:43:58,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:58,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-11 23:43:58,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:58,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-11 23:43:58,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-11 23:43:58,390 INFO L87 Difference]: Start difference. First operand 390 states and 488 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 4 states have internal predecessors, (57), 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-11 23:43:58,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:58,628 INFO L93 Difference]: Finished difference Result 423 states and 525 transitions. [2022-07-11 23:43:58,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-11 23:43:58,628 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 4 states have internal predecessors, (57), 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 66 [2022-07-11 23:43:58,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:58,629 INFO L225 Difference]: With dead ends: 423 [2022-07-11 23:43:58,629 INFO L226 Difference]: Without dead ends: 373 [2022-07-11 23:43:58,630 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-11 23:43:58,630 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 121 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:58,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1087 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:43:58,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2022-07-11 23:43:58,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 361. [2022-07-11 23:43:58,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 303 states have (on average 1.2640264026402641) internal successors, (383), 307 states have internal predecessors, (383), 30 states have call successors, (30), 24 states have call predecessors, (30), 27 states have return successors, (36), 29 states have call predecessors, (36), 27 states have call successors, (36) [2022-07-11 23:43:58,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 449 transitions. [2022-07-11 23:43:58,654 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 449 transitions. Word has length 66 [2022-07-11 23:43:58,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:58,654 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 449 transitions. [2022-07-11 23:43:58,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 4 states have internal predecessors, (57), 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-11 23:43:58,655 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 449 transitions. [2022-07-11 23:43:58,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-11 23:43:58,655 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:58,655 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:58,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-07-11 23:43:58,656 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:58,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:58,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1823600415, now seen corresponding path program 1 times [2022-07-11 23:43:58,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:58,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796528026] [2022-07-11 23:43:58,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:58,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:58,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-11 23:43:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:58,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-11 23:43:58,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:58,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-11 23:43:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:58,690 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-11 23:43:58,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:58,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796528026] [2022-07-11 23:43:58,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796528026] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:43:58,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059316627] [2022-07-11 23:43:58,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:58,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:43:58,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:43:58,695 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-11 23:43:58,696 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-11 23:43:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:58,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-11 23:43:58,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:43:58,876 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:58,876 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:43:58,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059316627] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:58,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:43:58,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-11 23:43:58,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119274610] [2022-07-11 23:43:58,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:58,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:43:58,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:58,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:43:58,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:43:58,877 INFO L87 Difference]: Start difference. First operand 361 states and 449 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-11 23:43:58,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:58,917 INFO L93 Difference]: Finished difference Result 384 states and 471 transitions. [2022-07-11 23:43:58,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:43:58,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 62 [2022-07-11 23:43:58,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:58,918 INFO L225 Difference]: With dead ends: 384 [2022-07-11 23:43:58,918 INFO L226 Difference]: Without dead ends: 332 [2022-07-11 23:43:58,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:43:58,920 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 0 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:58,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 917 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:43:58,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-07-11 23:43:58,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2022-07-11 23:43:58,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 280 states have (on average 1.275) internal successors, (357), 283 states have internal predecessors, (357), 27 states have call successors, (27), 22 states have call predecessors, (27), 24 states have return successors, (32), 26 states have call predecessors, (32), 24 states have call successors, (32) [2022-07-11 23:43:58,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 416 transitions. [2022-07-11 23:43:58,960 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 416 transitions. Word has length 62 [2022-07-11 23:43:58,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:58,960 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 416 transitions. [2022-07-11 23:43:58,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-11 23:43:58,960 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 416 transitions. [2022-07-11 23:43:58,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-11 23:43:58,961 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:58,961 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-11 23:43:58,996 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-11 23:43:59,172 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,SelfDestructingSolverStorable65 [2022-07-11 23:43:59,172 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:59,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:59,172 INFO L85 PathProgramCache]: Analyzing trace with hash 2069212948, now seen corresponding path program 1 times [2022-07-11 23:43:59,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:59,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707013511] [2022-07-11 23:43:59,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:59,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:59,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-11 23:43:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:59,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-11 23:43:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:59,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:59,320 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-11 23:43:59,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:59,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707013511] [2022-07-11 23:43:59,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707013511] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:59,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:59,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-11 23:43:59,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795203694] [2022-07-11 23:43:59,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:59,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-11 23:43:59,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:59,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-11 23:43:59,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-07-11 23:43:59,322 INFO L87 Difference]: Start difference. First operand 332 states and 416 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-11 23:43:59,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:59,754 INFO L93 Difference]: Finished difference Result 346 states and 433 transitions. [2022-07-11 23:43:59,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-11 23:43:59,754 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-11 23:43:59,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:59,755 INFO L225 Difference]: With dead ends: 346 [2022-07-11 23:43:59,755 INFO L226 Difference]: Without dead ends: 270 [2022-07-11 23:43:59,756 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-11 23:43:59,756 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 154 mSDsluCounter, 1488 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:59,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 1699 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:43:59,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-07-11 23:43:59,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 264. [2022-07-11 23:43:59,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 220 states have (on average 1.3) internal successors, (286), 222 states have internal predecessors, (286), 22 states have call successors, (22), 19 states have call predecessors, (22), 21 states have return successors, (28), 22 states have call predecessors, (28), 20 states have call successors, (28) [2022-07-11 23:43:59,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 336 transitions. [2022-07-11 23:43:59,774 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 336 transitions. Word has length 64 [2022-07-11 23:43:59,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:59,774 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 336 transitions. [2022-07-11 23:43:59,774 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-11 23:43:59,774 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 336 transitions. [2022-07-11 23:43:59,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-11 23:43:59,775 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:59,775 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, 1, 1, 1, 1] [2022-07-11 23:43:59,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-07-11 23:43:59,775 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:59,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:59,775 INFO L85 PathProgramCache]: Analyzing trace with hash 585691284, now seen corresponding path program 1 times [2022-07-11 23:43:59,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:59,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654593992] [2022-07-11 23:43:59,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:59,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:59,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-11 23:43:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:59,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:43:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:59,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:43:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:59,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-11 23:43:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:59,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:43:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:59,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-11 23:43:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:59,852 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-11 23:43:59,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:59,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654593992] [2022-07-11 23:43:59,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654593992] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:59,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:59,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-11 23:43:59,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58695247] [2022-07-11 23:43:59,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:59,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:43:59,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:59,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:43:59,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:43:59,853 INFO L87 Difference]: Start difference. First operand 264 states and 336 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 6 states have internal predecessors, (54), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-11 23:44:00,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:44:00,067 INFO L93 Difference]: Finished difference Result 455 states and 585 transitions. [2022-07-11 23:44:00,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-11 23:44:00,067 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 6 states have internal predecessors, (54), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 68 [2022-07-11 23:44:00,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:44:00,068 INFO L225 Difference]: With dead ends: 455 [2022-07-11 23:44:00,068 INFO L226 Difference]: Without dead ends: 270 [2022-07-11 23:44:00,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-07-11 23:44:00,069 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 218 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:44:00,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 730 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:44:00,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-07-11 23:44:00,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 264. [2022-07-11 23:44:00,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 220 states have (on average 1.2954545454545454) internal successors, (285), 222 states have internal predecessors, (285), 22 states have call successors, (22), 19 states have call predecessors, (22), 21 states have return successors, (28), 22 states have call predecessors, (28), 20 states have call successors, (28) [2022-07-11 23:44:00,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 335 transitions. [2022-07-11 23:44:00,099 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 335 transitions. Word has length 68 [2022-07-11 23:44:00,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:44:00,100 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 335 transitions. [2022-07-11 23:44:00,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 6 states have internal predecessors, (54), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-11 23:44:00,100 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 335 transitions. [2022-07-11 23:44:00,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-11 23:44:00,101 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:44:00,101 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, 1, 1, 1, 1, 1, 1] [2022-07-11 23:44:00,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-07-11 23:44:00,101 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:44:00,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:44:00,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1800918031, now seen corresponding path program 1 times [2022-07-11 23:44:00,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:44:00,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7837412] [2022-07-11 23:44:00,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:44:00,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:44:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:00,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-11 23:44:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:00,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:44:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:00,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:44:00,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:00,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-11 23:44:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:00,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:44:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:00,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-11 23:44:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:00,167 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-11 23:44:00,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:44:00,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7837412] [2022-07-11 23:44:00,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7837412] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:44:00,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:44:00,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-11 23:44:00,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807234971] [2022-07-11 23:44:00,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:44:00,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-11 23:44:00,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:44:00,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-11 23:44:00,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-11 23:44:00,169 INFO L87 Difference]: Start difference. First operand 264 states and 335 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-11 23:44:00,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:44:00,368 INFO L93 Difference]: Finished difference Result 343 states and 431 transitions. [2022-07-11 23:44:00,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-11 23:44:00,369 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 70 [2022-07-11 23:44:00,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:44:00,369 INFO L225 Difference]: With dead ends: 343 [2022-07-11 23:44:00,370 INFO L226 Difference]: Without dead ends: 216 [2022-07-11 23:44:00,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-07-11 23:44:00,370 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 97 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:44:00,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 748 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:44:00,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-11 23:44:00,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 175. [2022-07-11 23:44:00,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 145 states have (on average 1.2344827586206897) internal successors, (179), 146 states have internal predecessors, (179), 15 states have call successors, (15), 13 states have call predecessors, (15), 14 states have return successors, (17), 15 states have call predecessors, (17), 14 states have call successors, (17) [2022-07-11 23:44:00,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 211 transitions. [2022-07-11 23:44:00,384 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 211 transitions. Word has length 70 [2022-07-11 23:44:00,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:44:00,385 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 211 transitions. [2022-07-11 23:44:00,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-11 23:44:00,385 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 211 transitions. [2022-07-11 23:44:00,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-11 23:44:00,385 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:44:00,385 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:44:00,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-07-11 23:44:00,385 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:44:00,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:44:00,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1069664757, now seen corresponding path program 1 times [2022-07-11 23:44:00,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:44:00,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886933319] [2022-07-11 23:44:00,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:44:00,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:44:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:00,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-11 23:44:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:00,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:44:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:00,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:44:00,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:00,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-11 23:44:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:00,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:44:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:00,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-11 23:44:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:00,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-11 23:44:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:00,459 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-11 23:44:00,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:44:00,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886933319] [2022-07-11 23:44:00,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886933319] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:44:00,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:44:00,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-11 23:44:00,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141860975] [2022-07-11 23:44:00,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:44:00,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:44:00,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:44:00,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:44:00,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:44:00,461 INFO L87 Difference]: Start difference. First operand 175 states and 211 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-11 23:44:00,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:44:00,659 INFO L93 Difference]: Finished difference Result 224 states and 267 transitions. [2022-07-11 23:44:00,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-11 23:44:00,659 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 84 [2022-07-11 23:44:00,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:44:00,660 INFO L225 Difference]: With dead ends: 224 [2022-07-11 23:44:00,660 INFO L226 Difference]: Without dead ends: 185 [2022-07-11 23:44:00,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-07-11 23:44:00,660 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 219 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:44:00,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 814 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:44:00,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-11 23:44:00,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 173. [2022-07-11 23:44:00,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 143 states have (on average 1.2027972027972027) internal successors, (172), 144 states have internal predecessors, (172), 15 states have call successors, (15), 13 states have call predecessors, (15), 14 states have return successors, (17), 15 states have call predecessors, (17), 14 states have call successors, (17) [2022-07-11 23:44:00,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 204 transitions. [2022-07-11 23:44:00,674 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 204 transitions. Word has length 84 [2022-07-11 23:44:00,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:44:00,674 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 204 transitions. [2022-07-11 23:44:00,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-11 23:44:00,674 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 204 transitions. [2022-07-11 23:44:00,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-11 23:44:00,675 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:44:00,675 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:44:00,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-07-11 23:44:00,675 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:44:00,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:44:00,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1463540250, now seen corresponding path program 1 times [2022-07-11 23:44:00,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:44:00,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552186517] [2022-07-11 23:44:00,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:44:00,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:44:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:00,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-11 23:44:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:00,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:44:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:00,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:44:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:00,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-11 23:44:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:00,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:44:00,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:00,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-11 23:44:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:00,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-11 23:44:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:00,741 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-11 23:44:00,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:44:00,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552186517] [2022-07-11 23:44:00,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552186517] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:44:00,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:44:00,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-11 23:44:00,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892995437] [2022-07-11 23:44:00,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:44:00,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:44:00,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:44:00,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:44:00,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:44:00,743 INFO L87 Difference]: Start difference. First operand 173 states and 204 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-11 23:44:00,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:44:00,946 INFO L93 Difference]: Finished difference Result 201 states and 234 transitions. [2022-07-11 23:44:00,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-11 23:44:00,947 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 86 [2022-07-11 23:44:00,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:44:00,947 INFO L225 Difference]: With dead ends: 201 [2022-07-11 23:44:00,947 INFO L226 Difference]: Without dead ends: 153 [2022-07-11 23:44:00,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-07-11 23:44:00,948 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 136 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:44:00,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 952 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:44:00,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-11 23:44:00,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 141. [2022-07-11 23:44:00,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 116 states have (on average 1.1637931034482758) internal successors, (135), 117 states have internal predecessors, (135), 12 states have call successors, (12), 11 states have call predecessors, (12), 12 states have return successors, (13), 12 states have call predecessors, (13), 11 states have call successors, (13) [2022-07-11 23:44:00,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 160 transitions. [2022-07-11 23:44:00,972 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 160 transitions. Word has length 86 [2022-07-11 23:44:00,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:44:00,972 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 160 transitions. [2022-07-11 23:44:00,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-11 23:44:00,972 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 160 transitions. [2022-07-11 23:44:00,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-11 23:44:00,973 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:44:00,973 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:44:00,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-07-11 23:44:00,973 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:44:00,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:44:00,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1416419599, now seen corresponding path program 1 times [2022-07-11 23:44:00,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:44:00,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861944893] [2022-07-11 23:44:00,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:44:00,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:44:00,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:00,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-11 23:44:01,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:01,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-11 23:44:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:01,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:44:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:01,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:44:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:01,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-11 23:44:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:01,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:44:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:01,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-11 23:44:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:01,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-11 23:44:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:01,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-11 23:44:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:01,049 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:44:01,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:44:01,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861944893] [2022-07-11 23:44:01,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861944893] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:44:01,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051957927] [2022-07-11 23:44:01,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:44:01,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:44:01,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:44:01,050 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:44:01,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-11 23:44:01,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:01,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-11 23:44:01,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:44:01,199 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-11 23:44:01,199 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:44:01,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051957927] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:44:01,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:44:01,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-11 23:44:01,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281455499] [2022-07-11 23:44:01,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:44:01,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:44:01,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:44:01,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:44:01,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:44:01,200 INFO L87 Difference]: Start difference. First operand 141 states and 160 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-11 23:44:01,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:44:01,218 INFO L93 Difference]: Finished difference Result 205 states and 238 transitions. [2022-07-11 23:44:01,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:44:01,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 103 [2022-07-11 23:44:01,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:44:01,219 INFO L225 Difference]: With dead ends: 205 [2022-07-11 23:44:01,219 INFO L226 Difference]: Without dead ends: 170 [2022-07-11 23:44:01,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:44:01,220 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 16 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:44:01,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 236 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:44:01,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-07-11 23:44:01,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 151. [2022-07-11 23:44:01,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 125 states have (on average 1.152) internal successors, (144), 125 states have internal predecessors, (144), 13 states have call successors, (13), 11 states have call predecessors, (13), 12 states have return successors, (15), 14 states have call predecessors, (15), 12 states have call successors, (15) [2022-07-11 23:44:01,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 172 transitions. [2022-07-11 23:44:01,232 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 172 transitions. Word has length 103 [2022-07-11 23:44:01,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:44:01,232 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 172 transitions. [2022-07-11 23:44:01,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-11 23:44:01,232 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 172 transitions. [2022-07-11 23:44:01,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-11 23:44:01,233 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:44:01,233 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:44:01,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-11 23:44:01,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable71 [2022-07-11 23:44:01,447 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:44:01,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:44:01,448 INFO L85 PathProgramCache]: Analyzing trace with hash -479392400, now seen corresponding path program 1 times [2022-07-11 23:44:01,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:44:01,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593690554] [2022-07-11 23:44:01,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:44:01,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:44:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:01,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-11 23:44:01,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:01,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-11 23:44:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:01,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:44:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:01,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:44:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:01,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-11 23:44:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:01,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:44:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:01,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-11 23:44:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:01,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-11 23:44:01,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:01,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-11 23:44:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:01,507 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:44:01,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:44:01,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593690554] [2022-07-11 23:44:01,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593690554] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:44:01,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094593586] [2022-07-11 23:44:01,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:44:01,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:44:01,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:44:01,509 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:44:01,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-11 23:44:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:01,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-11 23:44:01,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:44:01,658 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-11 23:44:01,659 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:44:01,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094593586] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:44:01,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:44:01,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-11 23:44:01,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506445640] [2022-07-11 23:44:01,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:44:01,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:44:01,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:44:01,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:44:01,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:44:01,660 INFO L87 Difference]: Start difference. First operand 151 states and 172 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-11 23:44:01,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:44:01,681 INFO L93 Difference]: Finished difference Result 203 states and 228 transitions. [2022-07-11 23:44:01,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:44:01,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 103 [2022-07-11 23:44:01,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:44:01,682 INFO L225 Difference]: With dead ends: 203 [2022-07-11 23:44:01,682 INFO L226 Difference]: Without dead ends: 170 [2022-07-11 23:44:01,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:44:01,683 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 21 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:44:01,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 255 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:44:01,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-07-11 23:44:01,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 151. [2022-07-11 23:44:01,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 125 states have (on average 1.12) internal successors, (140), 125 states have internal predecessors, (140), 13 states have call successors, (13), 11 states have call predecessors, (13), 12 states have return successors, (15), 14 states have call predecessors, (15), 12 states have call successors, (15) [2022-07-11 23:44:01,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 168 transitions. [2022-07-11 23:44:01,696 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 168 transitions. Word has length 103 [2022-07-11 23:44:01,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:44:01,697 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 168 transitions. [2022-07-11 23:44:01,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-11 23:44:01,697 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 168 transitions. [2022-07-11 23:44:01,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-11 23:44:01,697 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:44:01,698 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:44:01,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-11 23:44:01,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:44:01,911 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:44:01,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:44:01,911 INFO L85 PathProgramCache]: Analyzing trace with hash 506808435, now seen corresponding path program 1 times [2022-07-11 23:44:01,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:44:01,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562961734] [2022-07-11 23:44:01,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:44:01,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:44:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:01,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-11 23:44:01,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:01,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-11 23:44:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:01,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:44:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:01,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:44:01,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:01,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-11 23:44:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:01,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:44:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:01,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-11 23:44:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:01,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-11 23:44:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:01,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-11 23:44:01,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:01,981 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:44:01,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:44:01,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562961734] [2022-07-11 23:44:01,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562961734] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:44:01,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922976913] [2022-07-11 23:44:01,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:44:01,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:44:01,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:44:01,983 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:44:01,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-11 23:44:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:02,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-11 23:44:02,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:44:02,153 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-11 23:44:02,154 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:44:02,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922976913] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:44:02,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:44:02,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2022-07-11 23:44:02,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106152324] [2022-07-11 23:44:02,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:44:02,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:44:02,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:44:02,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:44:02,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-07-11 23:44:02,155 INFO L87 Difference]: Start difference. First operand 151 states and 168 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-11 23:44:02,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:44:02,227 INFO L93 Difference]: Finished difference Result 283 states and 318 transitions. [2022-07-11 23:44:02,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:44:02,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 103 [2022-07-11 23:44:02,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:44:02,228 INFO L225 Difference]: With dead ends: 283 [2022-07-11 23:44:02,228 INFO L226 Difference]: Without dead ends: 151 [2022-07-11 23:44:02,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-07-11 23:44:02,229 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 144 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:44:02,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 214 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:44:02,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-11 23:44:02,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-07-11 23:44:02,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 125 states have (on average 1.104) internal successors, (138), 125 states have internal predecessors, (138), 13 states have call successors, (13), 11 states have call predecessors, (13), 12 states have return successors, (15), 14 states have call predecessors, (15), 12 states have call successors, (15) [2022-07-11 23:44:02,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 166 transitions. [2022-07-11 23:44:02,258 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 166 transitions. Word has length 103 [2022-07-11 23:44:02,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:44:02,258 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 166 transitions. [2022-07-11 23:44:02,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-11 23:44:02,258 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 166 transitions. [2022-07-11 23:44:02,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-11 23:44:02,259 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:44:02,259 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:44:02,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-11 23:44:02,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:44:02,476 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:44:02,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:44:02,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1772033550, now seen corresponding path program 1 times [2022-07-11 23:44:02,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:44:02,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880491026] [2022-07-11 23:44:02,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:44:02,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:44:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:02,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-11 23:44:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:02,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-11 23:44:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:02,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:44:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:02,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:44:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:02,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-11 23:44:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:02,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:44:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:02,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-11 23:44:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:02,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-11 23:44:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:02,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-11 23:44:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:02,558 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-11 23:44:02,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:44:02,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880491026] [2022-07-11 23:44:02,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880491026] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:44:02,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:44:02,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-11 23:44:02,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765457933] [2022-07-11 23:44:02,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:44:02,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-11 23:44:02,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:44:02,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-11 23:44:02,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-11 23:44:02,560 INFO L87 Difference]: Start difference. First operand 151 states and 166 transitions. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-11 23:44:02,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:44:02,810 INFO L93 Difference]: Finished difference Result 300 states and 328 transitions. [2022-07-11 23:44:02,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-11 23:44:02,811 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 104 [2022-07-11 23:44:02,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:44:02,811 INFO L225 Difference]: With dead ends: 300 [2022-07-11 23:44:02,811 INFO L226 Difference]: Without dead ends: 151 [2022-07-11 23:44:02,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2022-07-11 23:44:02,812 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 167 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:44:02,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 639 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:44:02,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-11 23:44:02,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-07-11 23:44:02,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 125 states have (on average 1.096) internal successors, (137), 125 states have internal predecessors, (137), 13 states have call successors, (13), 11 states have call predecessors, (13), 12 states have return successors, (15), 14 states have call predecessors, (15), 12 states have call successors, (15) [2022-07-11 23:44:02,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 165 transitions. [2022-07-11 23:44:02,825 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 165 transitions. Word has length 104 [2022-07-11 23:44:02,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:44:02,825 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 165 transitions. [2022-07-11 23:44:02,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-11 23:44:02,825 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 165 transitions. [2022-07-11 23:44:02,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-11 23:44:02,825 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:44:02,826 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:44:02,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-07-11 23:44:02,826 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:44:02,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:44:02,826 INFO L85 PathProgramCache]: Analyzing trace with hash 125463216, now seen corresponding path program 1 times [2022-07-11 23:44:02,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:44:02,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310819113] [2022-07-11 23:44:02,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:44:02,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:44:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:02,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-11 23:44:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:02,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-11 23:44:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:02,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:44:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:02,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:44:02,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:02,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-11 23:44:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:02,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:44:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:02,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-11 23:44:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:02,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-11 23:44:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:02,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-11 23:44:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:44:02,920 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-11 23:44:02,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:44:02,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310819113] [2022-07-11 23:44:02,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310819113] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:44:02,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:44:02,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-11 23:44:02,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902028930] [2022-07-11 23:44:02,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:44:02,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-11 23:44:02,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:44:02,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-11 23:44:02,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-07-11 23:44:02,922 INFO L87 Difference]: Start difference. First operand 151 states and 165 transitions. Second operand has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-11 23:44:03,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:44:03,151 INFO L93 Difference]: Finished difference Result 151 states and 165 transitions. [2022-07-11 23:44:03,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-11 23:44:03,151 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 104 [2022-07-11 23:44:03,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:44:03,152 INFO L225 Difference]: With dead ends: 151 [2022-07-11 23:44:03,152 INFO L226 Difference]: Without dead ends: 0 [2022-07-11 23:44:03,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2022-07-11 23:44:03,160 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 190 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:44:03,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 548 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:44:03,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-11 23:44:03,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-11 23:44:03,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:44:03,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-11 23:44:03,161 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 104 [2022-07-11 23:44:03,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:44:03,161 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-11 23:44:03,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-11 23:44:03,161 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-11 23:44:03,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-11 23:44:03,163 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-11 23:44:03,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-07-11 23:44:03,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.