./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b 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/diskperf_simpl1.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 48b194ce99c1fa112b5c4d4ed6cc0216b9fbb33f6f6efd57d62e9c27b1f7eb5c --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 11:43:09,185 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 11:43:09,194 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 11:43:09,245 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 11:43:09,246 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 11:43:09,247 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 11:43:09,248 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 11:43:09,251 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 11:43:09,253 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 11:43:09,254 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 11:43:09,255 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 11:43:09,256 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 11:43:09,257 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 11:43:09,259 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 11:43:09,261 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 11:43:09,263 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 11:43:09,265 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 11:43:09,269 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 11:43:09,270 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 11:43:09,273 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 11:43:09,276 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 11:43:09,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 11:43:09,277 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 11:43:09,279 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 11:43:09,281 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 11:43:09,283 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 11:43:09,284 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 11:43:09,284 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 11:43:09,285 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 11:43:09,286 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 11:43:09,286 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 11:43:09,287 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 11:43:09,288 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 11:43:09,289 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 11:43:09,290 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 11:43:09,290 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 11:43:09,291 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 11:43:09,292 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 11:43:09,292 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 11:43:09,292 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 11:43:09,293 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 11:43:09,294 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-14 11:43:09,317 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 11:43:09,317 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 11:43:09,318 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 11:43:09,318 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 11:43:09,319 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 11:43:09,319 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 11:43:09,320 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 11:43:09,320 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 11:43:09,320 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 11:43:09,320 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 11:43:09,321 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 11:43:09,321 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 11:43:09,321 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 11:43:09,321 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 11:43:09,322 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 11:43:09,322 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 11:43:09,322 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 11:43:09,322 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 11:43:09,322 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 11:43:09,322 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 11:43:09,323 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 11:43:09,323 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 11:43:09,323 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 11:43:09,323 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 11:43:09,323 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 11:43:09,323 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 11:43:09,324 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 11:43:09,325 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 11:43:09,325 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 11:43:09,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 11:43:09,325 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 11:43:09,325 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 11:43:09,326 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 11:43:09,326 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 11:43:09,326 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 -> 48b194ce99c1fa112b5c4d4ed6cc0216b9fbb33f6f6efd57d62e9c27b1f7eb5c [2021-12-14 11:43:09,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 11:43:09,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 11:43:09,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 11:43:09,629 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 11:43:09,629 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 11:43:09,630 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c [2021-12-14 11:43:09,690 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d31610836/f934a359cd04497c9aaf510888fa1c12/FLAG1c2275527 [2021-12-14 11:43:10,187 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 11:43:10,187 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c [2021-12-14 11:43:10,197 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d31610836/f934a359cd04497c9aaf510888fa1c12/FLAG1c2275527 [2021-12-14 11:43:10,525 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d31610836/f934a359cd04497c9aaf510888fa1c12 [2021-12-14 11:43:10,527 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 11:43:10,528 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 11:43:10,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 11:43:10,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 11:43:10,532 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 11:43:10,533 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:43:10" (1/1) ... [2021-12-14 11:43:10,533 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1db560c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:10, skipping insertion in model container [2021-12-14 11:43:10,533 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:43:10" (1/1) ... [2021-12-14 11:43:10,539 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 11:43:10,580 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 11:43:10,740 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/diskperf_simpl1.cil.c[2072,2085] [2021-12-14 11:43:10,835 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 11:43:10,843 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 11:43:10,856 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/diskperf_simpl1.cil.c[2072,2085] [2021-12-14 11:43:10,904 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 11:43:10,917 INFO L208 MainTranslator]: Completed translation [2021-12-14 11:43:10,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:10 WrapperNode [2021-12-14 11:43:10,923 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 11:43:10,924 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 11:43:10,924 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 11:43:10,924 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 11:43:10,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:10" (1/1) ... [2021-12-14 11:43:10,951 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:10" (1/1) ... [2021-12-14 11:43:10,999 INFO L137 Inliner]: procedures = 38, calls = 66, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 755 [2021-12-14 11:43:10,999 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 11:43:11,000 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 11:43:11,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 11:43:11,000 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 11:43:11,006 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:10" (1/1) ... [2021-12-14 11:43:11,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:10" (1/1) ... [2021-12-14 11:43:11,010 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:10" (1/1) ... [2021-12-14 11:43:11,011 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:10" (1/1) ... [2021-12-14 11:43:11,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:10" (1/1) ... [2021-12-14 11:43:11,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:10" (1/1) ... [2021-12-14 11:43:11,038 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:10" (1/1) ... [2021-12-14 11:43:11,044 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 11:43:11,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 11:43:11,055 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 11:43:11,055 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 11:43:11,056 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:10" (1/1) ... [2021-12-14 11:43:11,063 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 11:43:11,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:43:11,104 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-14 11:43:11,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-14 11:43:11,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 11:43:11,151 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2021-12-14 11:43:11,151 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2021-12-14 11:43:11,152 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2021-12-14 11:43:11,152 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2021-12-14 11:43:11,152 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2021-12-14 11:43:11,152 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2021-12-14 11:43:11,153 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2021-12-14 11:43:11,154 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2021-12-14 11:43:11,154 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2021-12-14 11:43:11,154 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2021-12-14 11:43:11,154 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2021-12-14 11:43:11,154 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2021-12-14 11:43:11,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 11:43:11,155 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2021-12-14 11:43:11,155 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2021-12-14 11:43:11,155 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2021-12-14 11:43:11,155 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2021-12-14 11:43:11,155 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2021-12-14 11:43:11,155 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2021-12-14 11:43:11,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 11:43:11,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 11:43:11,389 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 11:43:11,391 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 11:43:11,396 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-14 11:43:11,489 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-12-14 11:43:11,489 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-12-14 11:43:11,494 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-14 11:43:11,525 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2021-12-14 11:43:11,527 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2021-12-14 11:43:11,574 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-14 11:43:11,580 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-14 11:43:11,589 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-14 11:43:11,954 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##39: assume !false; [2021-12-14 11:43:11,955 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume false; [2021-12-14 11:43:11,955 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2021-12-14 11:43:11,955 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2021-12-14 11:43:11,955 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !false; [2021-12-14 11:43:11,955 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume false; [2021-12-14 11:43:11,958 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-14 11:43:11,980 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2021-12-14 11:43:11,981 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2021-12-14 11:43:12,028 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 11:43:12,040 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 11:43:12,041 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-14 11:43:12,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:43:12 BoogieIcfgContainer [2021-12-14 11:43:12,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 11:43:12,045 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 11:43:12,045 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 11:43:12,049 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 11:43:12,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 11:43:10" (1/3) ... [2021-12-14 11:43:12,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32fa1cd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:43:12, skipping insertion in model container [2021-12-14 11:43:12,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:10" (2/3) ... [2021-12-14 11:43:12,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32fa1cd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:43:12, skipping insertion in model container [2021-12-14 11:43:12,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:43:12" (3/3) ... [2021-12-14 11:43:12,053 INFO L111 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1.cil.c [2021-12-14 11:43:12,058 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 11:43:12,059 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 11:43:12,103 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 11:43:12,108 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 11:43:12,109 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 11:43:12,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 243 states, 188 states have (on average 1.4680851063829787) internal successors, (276), 205 states have internal predecessors, (276), 44 states have call successors, (44), 9 states have call predecessors, (44), 9 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) [2021-12-14 11:43:12,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-14 11:43:12,131 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:12,131 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:12,132 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:12,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:12,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1911400740, now seen corresponding path program 1 times [2021-12-14 11:43:12,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:12,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799121256] [2021-12-14 11:43:12,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:12,144 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:12,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:12,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:12,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799121256] [2021-12-14 11:43:12,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799121256] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:12,275 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:12,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:43:12,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867255832] [2021-12-14 11:43:12,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:12,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:43:12,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:12,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:43:12,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:43:12,310 INFO L87 Difference]: Start difference. First operand has 243 states, 188 states have (on average 1.4680851063829787) internal successors, (276), 205 states have internal predecessors, (276), 44 states have call successors, (44), 9 states have call predecessors, (44), 9 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:43:12,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:12,420 INFO L93 Difference]: Finished difference Result 449 states and 690 transitions. [2021-12-14 11:43:12,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:43:12,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-14 11:43:12,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:12,441 INFO L225 Difference]: With dead ends: 449 [2021-12-14 11:43:12,444 INFO L226 Difference]: Without dead ends: 236 [2021-12-14 11:43:12,453 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:43:12,457 INFO L933 BasicCegarLoop]: 341 mSDtfsCounter, 8 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:12,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 635 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:43:12,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-12-14 11:43:12,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2021-12-14 11:43:12,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 183 states have (on average 1.4098360655737705) internal successors, (258), 198 states have internal predecessors, (258), 44 states have call successors, (44), 9 states have call predecessors, (44), 8 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2021-12-14 11:43:12,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 332 transitions. [2021-12-14 11:43:12,547 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 332 transitions. Word has length 13 [2021-12-14 11:43:12,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:12,547 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 332 transitions. [2021-12-14 11:43:12,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:43:12,549 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 332 transitions. [2021-12-14 11:43:12,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-14 11:43:12,550 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:12,550 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:12,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 11:43:12,551 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:12,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:12,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1078790828, now seen corresponding path program 1 times [2021-12-14 11:43:12,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:12,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20069008] [2021-12-14 11:43:12,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:12,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:12,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:12,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:12,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20069008] [2021-12-14 11:43:12,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20069008] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:12,643 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:12,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:43:12,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953550909] [2021-12-14 11:43:12,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:12,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:43:12,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:12,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:43:12,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:43:12,646 INFO L87 Difference]: Start difference. First operand 236 states and 332 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:43:12,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:12,778 INFO L93 Difference]: Finished difference Result 536 states and 777 transitions. [2021-12-14 11:43:12,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:43:12,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 15 [2021-12-14 11:43:12,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:12,786 INFO L225 Difference]: With dead ends: 536 [2021-12-14 11:43:12,786 INFO L226 Difference]: Without dead ends: 377 [2021-12-14 11:43:12,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:43:12,792 INFO L933 BasicCegarLoop]: 455 mSDtfsCounter, 250 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:12,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 680 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:43:12,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-12-14 11:43:12,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 357. [2021-12-14 11:43:12,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 283 states have (on average 1.3851590106007068) internal successors, (392), 291 states have internal predecessors, (392), 59 states have call successors, (59), 16 states have call predecessors, (59), 14 states have return successors, (67), 51 states have call predecessors, (67), 48 states have call successors, (67) [2021-12-14 11:43:12,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 518 transitions. [2021-12-14 11:43:12,844 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 518 transitions. Word has length 15 [2021-12-14 11:43:12,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:12,845 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 518 transitions. [2021-12-14 11:43:12,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:43:12,846 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 518 transitions. [2021-12-14 11:43:12,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-14 11:43:12,847 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:12,851 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:12,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 11:43:12,852 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:12,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:12,853 INFO L85 PathProgramCache]: Analyzing trace with hash -320586800, now seen corresponding path program 1 times [2021-12-14 11:43:12,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:12,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592091045] [2021-12-14 11:43:12,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:12,854 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:12,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:12,953 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:12,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592091045] [2021-12-14 11:43:12,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592091045] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:12,954 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:12,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:43:12,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474745689] [2021-12-14 11:43:12,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:12,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:43:12,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:12,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:43:12,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:43:12,956 INFO L87 Difference]: Start difference. First operand 357 states and 518 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:43:12,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:12,987 INFO L93 Difference]: Finished difference Result 823 states and 1229 transitions. [2021-12-14 11:43:12,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:43:12,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 20 [2021-12-14 11:43:12,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:12,992 INFO L225 Difference]: With dead ends: 823 [2021-12-14 11:43:12,992 INFO L226 Difference]: Without dead ends: 550 [2021-12-14 11:43:12,994 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:43:12,995 INFO L933 BasicCegarLoop]: 365 mSDtfsCounter, 255 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:12,995 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [255 Valid, 578 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:43:12,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2021-12-14 11:43:13,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 519. [2021-12-14 11:43:13,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 411 states have (on average 1.389294403892944) internal successors, (571), 418 states have internal predecessors, (571), 84 states have call successors, (84), 24 states have call predecessors, (84), 23 states have return successors, (117), 77 states have call predecessors, (117), 74 states have call successors, (117) [2021-12-14 11:43:13,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 772 transitions. [2021-12-14 11:43:13,031 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 772 transitions. Word has length 20 [2021-12-14 11:43:13,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:13,032 INFO L470 AbstractCegarLoop]: Abstraction has 519 states and 772 transitions. [2021-12-14 11:43:13,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:43:13,032 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 772 transitions. [2021-12-14 11:43:13,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-14 11:43:13,034 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:13,034 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:13,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 11:43:13,034 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:13,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:13,035 INFO L85 PathProgramCache]: Analyzing trace with hash -175921138, now seen corresponding path program 1 times [2021-12-14 11:43:13,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:13,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423095718] [2021-12-14 11:43:13,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:13,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:13,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:13,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:13,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423095718] [2021-12-14 11:43:13,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423095718] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:13,069 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:13,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:43:13,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994581500] [2021-12-14 11:43:13,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:13,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:43:13,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:13,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:43:13,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:43:13,071 INFO L87 Difference]: Start difference. First operand 519 states and 772 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:43:13,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:13,127 INFO L93 Difference]: Finished difference Result 534 states and 792 transitions. [2021-12-14 11:43:13,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:43:13,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 24 [2021-12-14 11:43:13,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:13,131 INFO L225 Difference]: With dead ends: 534 [2021-12-14 11:43:13,131 INFO L226 Difference]: Without dead ends: 530 [2021-12-14 11:43:13,131 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:43:13,132 INFO L933 BasicCegarLoop]: 307 mSDtfsCounter, 21 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:13,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 557 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:43:13,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-12-14 11:43:13,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 529. [2021-12-14 11:43:13,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 422 states have (on average 1.386255924170616) internal successors, (585), 427 states have internal predecessors, (585), 83 states have call successors, (83), 25 states have call predecessors, (83), 23 states have return successors, (117), 77 states have call predecessors, (117), 74 states have call successors, (117) [2021-12-14 11:43:13,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 785 transitions. [2021-12-14 11:43:13,155 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 785 transitions. Word has length 24 [2021-12-14 11:43:13,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:13,155 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 785 transitions. [2021-12-14 11:43:13,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:43:13,156 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 785 transitions. [2021-12-14 11:43:13,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-14 11:43:13,157 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:13,157 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:13,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 11:43:13,158 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:13,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:13,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1035800982, now seen corresponding path program 1 times [2021-12-14 11:43:13,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:13,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480487467] [2021-12-14 11:43:13,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:13,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:13,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 11:43:13,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:13,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:13,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:13,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480487467] [2021-12-14 11:43:13,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480487467] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:13,242 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:13,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 11:43:13,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868096521] [2021-12-14 11:43:13,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:13,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 11:43:13,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:13,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 11:43:13,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 11:43:13,244 INFO L87 Difference]: Start difference. First operand 529 states and 785 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:13,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:13,602 INFO L93 Difference]: Finished difference Result 582 states and 861 transitions. [2021-12-14 11:43:13,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 11:43:13,603 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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 27 [2021-12-14 11:43:13,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:13,606 INFO L225 Difference]: With dead ends: 582 [2021-12-14 11:43:13,607 INFO L226 Difference]: Without dead ends: 571 [2021-12-14 11:43:13,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-14 11:43:13,609 INFO L933 BasicCegarLoop]: 290 mSDtfsCounter, 410 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:13,609 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [419 Valid, 798 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 11:43:13,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2021-12-14 11:43:13,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 556. [2021-12-14 11:43:13,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 447 states have (on average 1.3803131991051454) internal successors, (617), 454 states have internal predecessors, (617), 83 states have call successors, (83), 25 states have call predecessors, (83), 25 states have return successors, (126), 77 states have call predecessors, (126), 74 states have call successors, (126) [2021-12-14 11:43:13,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 826 transitions. [2021-12-14 11:43:13,639 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 826 transitions. Word has length 27 [2021-12-14 11:43:13,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:13,639 INFO L470 AbstractCegarLoop]: Abstraction has 556 states and 826 transitions. [2021-12-14 11:43:13,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:13,640 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 826 transitions. [2021-12-14 11:43:13,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-14 11:43:13,641 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:13,641 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:13,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 11:43:13,641 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:13,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:13,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1813713707, now seen corresponding path program 1 times [2021-12-14 11:43:13,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:13,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595989446] [2021-12-14 11:43:13,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:13,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:13,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 11:43:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:13,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:13,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:13,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595989446] [2021-12-14 11:43:13,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595989446] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:13,716 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:13,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 11:43:13,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193331425] [2021-12-14 11:43:13,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:13,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 11:43:13,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:13,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 11:43:13,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 11:43:13,719 INFO L87 Difference]: Start difference. First operand 556 states and 826 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:14,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:14,036 INFO L93 Difference]: Finished difference Result 579 states and 854 transitions. [2021-12-14 11:43:14,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 11:43:14,036 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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 28 [2021-12-14 11:43:14,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:14,039 INFO L225 Difference]: With dead ends: 579 [2021-12-14 11:43:14,040 INFO L226 Difference]: Without dead ends: 571 [2021-12-14 11:43:14,040 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-14 11:43:14,042 INFO L933 BasicCegarLoop]: 291 mSDtfsCounter, 408 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:14,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [417 Valid, 799 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 11:43:14,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2021-12-14 11:43:14,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 556. [2021-12-14 11:43:14,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 447 states have (on average 1.378076062639821) internal successors, (616), 454 states have internal predecessors, (616), 83 states have call successors, (83), 25 states have call predecessors, (83), 25 states have return successors, (126), 77 states have call predecessors, (126), 74 states have call successors, (126) [2021-12-14 11:43:14,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 825 transitions. [2021-12-14 11:43:14,097 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 825 transitions. Word has length 28 [2021-12-14 11:43:14,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:14,098 INFO L470 AbstractCegarLoop]: Abstraction has 556 states and 825 transitions. [2021-12-14 11:43:14,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:14,098 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 825 transitions. [2021-12-14 11:43:14,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-14 11:43:14,099 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:14,099 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:14,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 11:43:14,100 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:14,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:14,100 INFO L85 PathProgramCache]: Analyzing trace with hash 123360193, now seen corresponding path program 1 times [2021-12-14 11:43:14,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:14,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873162167] [2021-12-14 11:43:14,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:14,101 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:14,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 11:43:14,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:14,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:14,148 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:14,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873162167] [2021-12-14 11:43:14,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873162167] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:14,148 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:14,148 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 11:43:14,148 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616449326] [2021-12-14 11:43:14,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:14,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 11:43:14,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:14,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 11:43:14,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 11:43:14,150 INFO L87 Difference]: Start difference. First operand 556 states and 825 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:14,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:14,350 INFO L93 Difference]: Finished difference Result 1018 states and 1542 transitions. [2021-12-14 11:43:14,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 11:43:14,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-12-14 11:43:14,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:14,357 INFO L225 Difference]: With dead ends: 1018 [2021-12-14 11:43:14,357 INFO L226 Difference]: Without dead ends: 989 [2021-12-14 11:43:14,358 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 11:43:14,359 INFO L933 BasicCegarLoop]: 372 mSDtfsCounter, 417 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:14,360 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [423 Valid, 777 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:14,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2021-12-14 11:43:14,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 949. [2021-12-14 11:43:14,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 759 states have (on average 1.391304347826087) internal successors, (1056), 766 states have internal predecessors, (1056), 141 states have call successors, (141), 47 states have call predecessors, (141), 48 states have return successors, (249), 137 states have call predecessors, (249), 132 states have call successors, (249) [2021-12-14 11:43:14,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1446 transitions. [2021-12-14 11:43:14,414 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1446 transitions. Word has length 29 [2021-12-14 11:43:14,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:14,414 INFO L470 AbstractCegarLoop]: Abstraction has 949 states and 1446 transitions. [2021-12-14 11:43:14,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:14,415 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1446 transitions. [2021-12-14 11:43:14,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 11:43:14,416 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:14,416 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:14,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 11:43:14,416 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:14,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:14,417 INFO L85 PathProgramCache]: Analyzing trace with hash -462412845, now seen corresponding path program 1 times [2021-12-14 11:43:14,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:14,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573014806] [2021-12-14 11:43:14,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:14,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:14,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 11:43:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:14,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:14,459 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:14,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573014806] [2021-12-14 11:43:14,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573014806] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:14,460 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:14,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 11:43:14,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576392468] [2021-12-14 11:43:14,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:14,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 11:43:14,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:14,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 11:43:14,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 11:43:14,462 INFO L87 Difference]: Start difference. First operand 949 states and 1446 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:14,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:14,665 INFO L93 Difference]: Finished difference Result 985 states and 1494 transitions. [2021-12-14 11:43:14,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 11:43:14,666 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2021-12-14 11:43:14,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:14,671 INFO L225 Difference]: With dead ends: 985 [2021-12-14 11:43:14,671 INFO L226 Difference]: Without dead ends: 966 [2021-12-14 11:43:14,672 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 11:43:14,673 INFO L933 BasicCegarLoop]: 300 mSDtfsCounter, 84 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:14,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 1008 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:14,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2021-12-14 11:43:14,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 945. [2021-12-14 11:43:14,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 756 states have (on average 1.3915343915343916) internal successors, (1052), 763 states have internal predecessors, (1052), 140 states have call successors, (140), 47 states have call predecessors, (140), 48 states have return successors, (248), 136 states have call predecessors, (248), 131 states have call successors, (248) [2021-12-14 11:43:14,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1440 transitions. [2021-12-14 11:43:14,716 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1440 transitions. Word has length 30 [2021-12-14 11:43:14,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:14,717 INFO L470 AbstractCegarLoop]: Abstraction has 945 states and 1440 transitions. [2021-12-14 11:43:14,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:14,717 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1440 transitions. [2021-12-14 11:43:14,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-14 11:43:14,718 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:14,718 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:14,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 11:43:14,719 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:14,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:14,719 INFO L85 PathProgramCache]: Analyzing trace with hash 415913558, now seen corresponding path program 1 times [2021-12-14 11:43:14,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:14,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868748154] [2021-12-14 11:43:14,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:14,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:14,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:14,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:14,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868748154] [2021-12-14 11:43:14,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868748154] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:14,748 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:14,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:43:14,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324849467] [2021-12-14 11:43:14,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:14,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:43:14,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:14,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:43:14,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:43:14,750 INFO L87 Difference]: Start difference. First operand 945 states and 1440 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2021-12-14 11:43:14,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:14,782 INFO L93 Difference]: Finished difference Result 1334 states and 2062 transitions. [2021-12-14 11:43:14,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:43:14,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 34 [2021-12-14 11:43:14,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:14,786 INFO L225 Difference]: With dead ends: 1334 [2021-12-14 11:43:14,786 INFO L226 Difference]: Without dead ends: 510 [2021-12-14 11:43:14,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:43:14,790 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 264 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:14,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 270 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:43:14,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2021-12-14 11:43:14,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2021-12-14 11:43:14,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 408 states have (on average 1.3553921568627452) internal successors, (553), 414 states have internal predecessors, (553), 78 states have call successors, (78), 23 states have call predecessors, (78), 23 states have return successors, (123), 73 states have call predecessors, (123), 71 states have call successors, (123) [2021-12-14 11:43:14,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 754 transitions. [2021-12-14 11:43:14,835 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 754 transitions. Word has length 34 [2021-12-14 11:43:14,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:14,836 INFO L470 AbstractCegarLoop]: Abstraction has 510 states and 754 transitions. [2021-12-14 11:43:14,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2021-12-14 11:43:14,836 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 754 transitions. [2021-12-14 11:43:14,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-14 11:43:14,838 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:14,838 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:14,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 11:43:14,839 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:14,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:14,839 INFO L85 PathProgramCache]: Analyzing trace with hash -2105808494, now seen corresponding path program 1 times [2021-12-14 11:43:14,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:14,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813491503] [2021-12-14 11:43:14,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:14,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:14,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-14 11:43:14,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:14,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:14,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:14,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813491503] [2021-12-14 11:43:14,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813491503] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:14,901 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:14,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 11:43:14,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441380394] [2021-12-14 11:43:14,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:14,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 11:43:14,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:14,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 11:43:14,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 11:43:14,903 INFO L87 Difference]: Start difference. First operand 510 states and 754 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:15,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:15,094 INFO L93 Difference]: Finished difference Result 553 states and 805 transitions. [2021-12-14 11:43:15,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 11:43:15,094 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 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 34 [2021-12-14 11:43:15,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:15,097 INFO L225 Difference]: With dead ends: 553 [2021-12-14 11:43:15,097 INFO L226 Difference]: Without dead ends: 519 [2021-12-14 11:43:15,098 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-14 11:43:15,098 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 94 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:15,099 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 1179 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:43:15,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2021-12-14 11:43:15,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 508. [2021-12-14 11:43:15,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 407 states have (on average 1.3513513513513513) internal successors, (550), 413 states have internal predecessors, (550), 77 states have call successors, (77), 23 states have call predecessors, (77), 23 states have return successors, (122), 72 states have call predecessors, (122), 70 states have call successors, (122) [2021-12-14 11:43:15,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 749 transitions. [2021-12-14 11:43:15,124 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 749 transitions. Word has length 34 [2021-12-14 11:43:15,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:15,125 INFO L470 AbstractCegarLoop]: Abstraction has 508 states and 749 transitions. [2021-12-14 11:43:15,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:15,125 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 749 transitions. [2021-12-14 11:43:15,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-14 11:43:15,126 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:15,126 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:15,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-14 11:43:15,126 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:15,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:15,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1486754927, now seen corresponding path program 1 times [2021-12-14 11:43:15,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:15,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403320536] [2021-12-14 11:43:15,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:15,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:15,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 11:43:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:15,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:15,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:15,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403320536] [2021-12-14 11:43:15,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403320536] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:15,171 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:15,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 11:43:15,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798587536] [2021-12-14 11:43:15,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:15,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 11:43:15,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:15,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 11:43:15,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 11:43:15,174 INFO L87 Difference]: Start difference. First operand 508 states and 749 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:15,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:15,445 INFO L93 Difference]: Finished difference Result 720 states and 1102 transitions. [2021-12-14 11:43:15,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 11:43:15,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (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 34 [2021-12-14 11:43:15,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:15,449 INFO L225 Difference]: With dead ends: 720 [2021-12-14 11:43:15,449 INFO L226 Difference]: Without dead ends: 712 [2021-12-14 11:43:15,450 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 11:43:15,450 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 232 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:15,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 668 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:15,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2021-12-14 11:43:15,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 566. [2021-12-14 11:43:15,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 455 states have (on average 1.3516483516483517) internal successors, (615), 461 states have internal predecessors, (615), 84 states have call successors, (84), 25 states have call predecessors, (84), 26 states have return successors, (142), 80 states have call predecessors, (142), 77 states have call successors, (142) [2021-12-14 11:43:15,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 841 transitions. [2021-12-14 11:43:15,483 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 841 transitions. Word has length 34 [2021-12-14 11:43:15,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:15,483 INFO L470 AbstractCegarLoop]: Abstraction has 566 states and 841 transitions. [2021-12-14 11:43:15,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:15,484 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 841 transitions. [2021-12-14 11:43:15,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-14 11:43:15,485 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:15,485 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:15,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 11:43:15,485 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:15,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:15,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1608594996, now seen corresponding path program 1 times [2021-12-14 11:43:15,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:15,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704059537] [2021-12-14 11:43:15,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:15,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:15,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:15,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 11:43:15,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:15,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:15,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:15,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704059537] [2021-12-14 11:43:15,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704059537] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:15,547 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:15,547 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 11:43:15,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718896605] [2021-12-14 11:43:15,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:15,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 11:43:15,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:15,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 11:43:15,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 11:43:15,549 INFO L87 Difference]: Start difference. First operand 566 states and 841 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:15,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:15,834 INFO L93 Difference]: Finished difference Result 583 states and 860 transitions. [2021-12-14 11:43:15,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 11:43:15,834 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 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 35 [2021-12-14 11:43:15,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:15,837 INFO L225 Difference]: With dead ends: 583 [2021-12-14 11:43:15,837 INFO L226 Difference]: Without dead ends: 579 [2021-12-14 11:43:15,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-14 11:43:15,838 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 66 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1471 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:15,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 1471 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:15,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2021-12-14 11:43:15,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 574. [2021-12-14 11:43:15,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 463 states have (on average 1.349892008639309) internal successors, (625), 469 states have internal predecessors, (625), 84 states have call successors, (84), 25 states have call predecessors, (84), 26 states have return successors, (142), 80 states have call predecessors, (142), 77 states have call successors, (142) [2021-12-14 11:43:15,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 851 transitions. [2021-12-14 11:43:15,868 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 851 transitions. Word has length 35 [2021-12-14 11:43:15,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:15,869 INFO L470 AbstractCegarLoop]: Abstraction has 574 states and 851 transitions. [2021-12-14 11:43:15,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:15,869 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 851 transitions. [2021-12-14 11:43:15,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-14 11:43:15,870 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:15,870 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:15,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-14 11:43:15,870 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:15,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:15,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1608318166, now seen corresponding path program 1 times [2021-12-14 11:43:15,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:15,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751491783] [2021-12-14 11:43:15,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:15,872 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:15,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 11:43:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:15,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:15,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:15,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751491783] [2021-12-14 11:43:15,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751491783] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:15,940 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:15,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 11:43:15,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632171937] [2021-12-14 11:43:15,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:15,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 11:43:15,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:15,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 11:43:15,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 11:43:15,941 INFO L87 Difference]: Start difference. First operand 574 states and 851 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:16,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:16,196 INFO L93 Difference]: Finished difference Result 1065 states and 1652 transitions. [2021-12-14 11:43:16,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 11:43:16,196 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 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 35 [2021-12-14 11:43:16,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:16,200 INFO L225 Difference]: With dead ends: 1065 [2021-12-14 11:43:16,200 INFO L226 Difference]: Without dead ends: 605 [2021-12-14 11:43:16,202 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-14 11:43:16,203 INFO L933 BasicCegarLoop]: 269 mSDtfsCounter, 75 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1640 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:16,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 1640 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:16,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2021-12-14 11:43:16,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 586. [2021-12-14 11:43:16,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 474 states have (on average 1.3544303797468353) internal successors, (642), 481 states have internal predecessors, (642), 84 states have call successors, (84), 25 states have call predecessors, (84), 27 states have return successors, (161), 80 states have call predecessors, (161), 77 states have call successors, (161) [2021-12-14 11:43:16,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 887 transitions. [2021-12-14 11:43:16,239 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 887 transitions. Word has length 35 [2021-12-14 11:43:16,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:16,239 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 887 transitions. [2021-12-14 11:43:16,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:16,239 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 887 transitions. [2021-12-14 11:43:16,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-14 11:43:16,240 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:16,240 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:16,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-14 11:43:16,241 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:16,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:16,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1299938960, now seen corresponding path program 1 times [2021-12-14 11:43:16,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:16,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321880689] [2021-12-14 11:43:16,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:16,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:16,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:16,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:16,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321880689] [2021-12-14 11:43:16,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321880689] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:16,267 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:16,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 11:43:16,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566277735] [2021-12-14 11:43:16,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:16,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 11:43:16,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:16,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 11:43:16,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 11:43:16,268 INFO L87 Difference]: Start difference. First operand 586 states and 887 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) [2021-12-14 11:43:16,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:16,386 INFO L93 Difference]: Finished difference Result 610 states and 910 transitions. [2021-12-14 11:43:16,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 11:43:16,387 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 [2021-12-14 11:43:16,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:16,390 INFO L225 Difference]: With dead ends: 610 [2021-12-14 11:43:16,390 INFO L226 Difference]: Without dead ends: 582 [2021-12-14 11:43:16,391 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:43:16,391 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 270 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:16,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [270 Valid, 410 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:43:16,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2021-12-14 11:43:16,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 580. [2021-12-14 11:43:16,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 468 states have (on average 1.3525641025641026) internal successors, (633), 476 states have internal predecessors, (633), 84 states have call successors, (84), 25 states have call predecessors, (84), 27 states have return successors, (159), 79 states have call predecessors, (159), 77 states have call successors, (159) [2021-12-14 11:43:16,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 876 transitions. [2021-12-14 11:43:16,423 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 876 transitions. Word has length 34 [2021-12-14 11:43:16,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:16,424 INFO L470 AbstractCegarLoop]: Abstraction has 580 states and 876 transitions. [2021-12-14 11:43:16,424 INFO L471 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) [2021-12-14 11:43:16,424 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 876 transitions. [2021-12-14 11:43:16,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-14 11:43:16,425 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:16,425 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:16,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-14 11:43:16,425 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:16,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:16,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1171529217, now seen corresponding path program 1 times [2021-12-14 11:43:16,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:16,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087184046] [2021-12-14 11:43:16,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:16,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:16,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 11:43:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:16,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:16,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:16,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087184046] [2021-12-14 11:43:16,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087184046] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:16,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:16,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 11:43:16,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924618288] [2021-12-14 11:43:16,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:16,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 11:43:16,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:16,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 11:43:16,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 11:43:16,495 INFO L87 Difference]: Start difference. First operand 580 states and 876 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:17,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:17,001 INFO L93 Difference]: Finished difference Result 738 states and 1149 transitions. [2021-12-14 11:43:17,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 11:43:17,002 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 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 36 [2021-12-14 11:43:17,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:17,007 INFO L225 Difference]: With dead ends: 738 [2021-12-14 11:43:17,007 INFO L226 Difference]: Without dead ends: 721 [2021-12-14 11:43:17,007 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-14 11:43:17,008 INFO L933 BasicCegarLoop]: 293 mSDtfsCounter, 662 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:17,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [676 Valid, 768 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 11:43:17,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2021-12-14 11:43:17,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 567. [2021-12-14 11:43:17,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 457 states have (on average 1.3544857768052516) internal successors, (619), 464 states have internal predecessors, (619), 83 states have call successors, (83), 25 states have call predecessors, (83), 26 states have return successors, (140), 78 states have call predecessors, (140), 76 states have call successors, (140) [2021-12-14 11:43:17,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 842 transitions. [2021-12-14 11:43:17,086 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 842 transitions. Word has length 36 [2021-12-14 11:43:17,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:17,087 INFO L470 AbstractCegarLoop]: Abstraction has 567 states and 842 transitions. [2021-12-14 11:43:17,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:17,087 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 842 transitions. [2021-12-14 11:43:17,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-14 11:43:17,088 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:17,088 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:17,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-14 11:43:17,088 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:17,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:17,089 INFO L85 PathProgramCache]: Analyzing trace with hash -2056934280, now seen corresponding path program 1 times [2021-12-14 11:43:17,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:17,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312529262] [2021-12-14 11:43:17,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:17,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:17,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:17,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 11:43:17,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:17,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:17,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:17,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312529262] [2021-12-14 11:43:17,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312529262] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:17,133 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:17,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 11:43:17,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250559774] [2021-12-14 11:43:17,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:17,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 11:43:17,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:17,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 11:43:17,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 11:43:17,134 INFO L87 Difference]: Start difference. First operand 567 states and 842 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:17,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:17,372 INFO L93 Difference]: Finished difference Result 630 states and 904 transitions. [2021-12-14 11:43:17,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 11:43:17,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2021-12-14 11:43:17,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:17,377 INFO L225 Difference]: With dead ends: 630 [2021-12-14 11:43:17,378 INFO L226 Difference]: Without dead ends: 377 [2021-12-14 11:43:17,379 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-14 11:43:17,380 INFO L933 BasicCegarLoop]: 286 mSDtfsCounter, 315 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:17,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 650 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:17,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-12-14 11:43:17,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 359. [2021-12-14 11:43:17,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 295 states have (on average 1.3016949152542372) internal successors, (384), 302 states have internal predecessors, (384), 47 states have call successors, (47), 17 states have call predecessors, (47), 16 states have return successors, (61), 40 states have call predecessors, (61), 40 states have call successors, (61) [2021-12-14 11:43:17,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 492 transitions. [2021-12-14 11:43:17,403 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 492 transitions. Word has length 39 [2021-12-14 11:43:17,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:17,403 INFO L470 AbstractCegarLoop]: Abstraction has 359 states and 492 transitions. [2021-12-14 11:43:17,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:17,404 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 492 transitions. [2021-12-14 11:43:17,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-14 11:43:17,404 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:17,404 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:17,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-14 11:43:17,405 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:17,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:17,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1922765712, now seen corresponding path program 1 times [2021-12-14 11:43:17,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:17,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818891330] [2021-12-14 11:43:17,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:17,406 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:17,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:17,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:17,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818891330] [2021-12-14 11:43:17,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818891330] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:17,433 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:17,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:43:17,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590750307] [2021-12-14 11:43:17,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:17,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:43:17,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:17,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:43:17,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:43:17,435 INFO L87 Difference]: Start difference. First operand 359 states and 492 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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) [2021-12-14 11:43:17,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:17,524 INFO L93 Difference]: Finished difference Result 504 states and 710 transitions. [2021-12-14 11:43:17,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:43:17,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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 [2021-12-14 11:43:17,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:17,527 INFO L225 Difference]: With dead ends: 504 [2021-12-14 11:43:17,528 INFO L226 Difference]: Without dead ends: 491 [2021-12-14 11:43:17,528 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:43:17,529 INFO L933 BasicCegarLoop]: 420 mSDtfsCounter, 161 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:17,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 641 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:43:17,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2021-12-14 11:43:17,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 375. [2021-12-14 11:43:17,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 310 states have (on average 1.2903225806451613) internal successors, (400), 317 states have internal predecessors, (400), 47 states have call successors, (47), 17 states have call predecessors, (47), 17 states have return successors, (62), 41 states have call predecessors, (62), 40 states have call successors, (62) [2021-12-14 11:43:17,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 509 transitions. [2021-12-14 11:43:17,553 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 509 transitions. Word has length 35 [2021-12-14 11:43:17,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:17,553 INFO L470 AbstractCegarLoop]: Abstraction has 375 states and 509 transitions. [2021-12-14 11:43:17,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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) [2021-12-14 11:43:17,554 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 509 transitions. [2021-12-14 11:43:17,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-14 11:43:17,554 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:17,555 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:17,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-14 11:43:17,555 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:17,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:17,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1798212464, now seen corresponding path program 1 times [2021-12-14 11:43:17,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:17,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77855185] [2021-12-14 11:43:17,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:17,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:17,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:17,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:17,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77855185] [2021-12-14 11:43:17,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77855185] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:17,601 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:17,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 11:43:17,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305494193] [2021-12-14 11:43:17,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:17,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 11:43:17,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:17,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 11:43:17,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 11:43:17,602 INFO L87 Difference]: Start difference. First operand 375 states and 509 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) [2021-12-14 11:43:17,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:17,719 INFO L93 Difference]: Finished difference Result 387 states and 521 transitions. [2021-12-14 11:43:17,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 11:43:17,721 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 [2021-12-14 11:43:17,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:17,723 INFO L225 Difference]: With dead ends: 387 [2021-12-14 11:43:17,723 INFO L226 Difference]: Without dead ends: 353 [2021-12-14 11:43:17,724 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:43:17,724 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 262 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:17,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [262 Valid, 411 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:43:17,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-12-14 11:43:17,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 351. [2021-12-14 11:43:17,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 288 states have (on average 1.28125) internal successors, (369), 294 states have internal predecessors, (369), 46 states have call successors, (46), 17 states have call predecessors, (46), 16 states have return successors, (61), 40 states have call predecessors, (61), 40 states have call successors, (61) [2021-12-14 11:43:17,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 476 transitions. [2021-12-14 11:43:17,762 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 476 transitions. Word has length 35 [2021-12-14 11:43:17,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:17,762 INFO L470 AbstractCegarLoop]: Abstraction has 351 states and 476 transitions. [2021-12-14 11:43:17,762 INFO L471 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) [2021-12-14 11:43:17,763 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 476 transitions. [2021-12-14 11:43:17,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-14 11:43:17,763 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:17,763 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:17,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-14 11:43:17,764 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:17,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:17,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1722219638, now seen corresponding path program 1 times [2021-12-14 11:43:17,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:17,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055995795] [2021-12-14 11:43:17,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:17,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:17,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-14 11:43:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:17,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:17,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:17,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055995795] [2021-12-14 11:43:17,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055995795] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:17,820 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:17,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 11:43:17,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390621212] [2021-12-14 11:43:17,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:17,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 11:43:17,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:17,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 11:43:17,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 11:43:17,821 INFO L87 Difference]: Start difference. First operand 351 states and 476 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 6 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) [2021-12-14 11:43:18,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:18,082 INFO L93 Difference]: Finished difference Result 355 states and 479 transitions. [2021-12-14 11:43:18,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 11:43:18,082 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 6 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 [2021-12-14 11:43:18,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:18,084 INFO L225 Difference]: With dead ends: 355 [2021-12-14 11:43:18,084 INFO L226 Difference]: Without dead ends: 324 [2021-12-14 11:43:18,085 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-14 11:43:18,085 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 60 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:18,086 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 1424 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:18,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-12-14 11:43:18,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2021-12-14 11:43:18,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 263 states have (on average 1.2889733840304183) internal successors, (339), 269 states have internal predecessors, (339), 45 states have call successors, (45), 16 states have call predecessors, (45), 15 states have return successors, (60), 39 states have call predecessors, (60), 39 states have call successors, (60) [2021-12-14 11:43:18,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 444 transitions. [2021-12-14 11:43:18,107 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 444 transitions. Word has length 37 [2021-12-14 11:43:18,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:18,107 INFO L470 AbstractCegarLoop]: Abstraction has 324 states and 444 transitions. [2021-12-14 11:43:18,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 6 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) [2021-12-14 11:43:18,108 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 444 transitions. [2021-12-14 11:43:18,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-14 11:43:18,108 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:18,108 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:18,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-14 11:43:18,109 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:18,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:18,109 INFO L85 PathProgramCache]: Analyzing trace with hash -70447595, now seen corresponding path program 1 times [2021-12-14 11:43:18,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:18,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906007901] [2021-12-14 11:43:18,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:18,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:18,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:18,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:18,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906007901] [2021-12-14 11:43:18,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906007901] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:18,189 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:18,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 11:43:18,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918569036] [2021-12-14 11:43:18,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:18,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 11:43:18,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:18,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 11:43:18,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 11:43:18,191 INFO L87 Difference]: Start difference. First operand 324 states and 444 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:43:18,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:18,277 INFO L93 Difference]: Finished difference Result 345 states and 466 transitions. [2021-12-14 11:43:18,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 11:43:18,278 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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 36 [2021-12-14 11:43:18,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:18,280 INFO L225 Difference]: With dead ends: 345 [2021-12-14 11:43:18,280 INFO L226 Difference]: Without dead ends: 323 [2021-12-14 11:43:18,280 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-14 11:43:18,281 INFO L933 BasicCegarLoop]: 250 mSDtfsCounter, 43 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:18,281 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 1424 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:43:18,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2021-12-14 11:43:18,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2021-12-14 11:43:18,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 262 states have (on average 1.286259541984733) internal successors, (337), 268 states have internal predecessors, (337), 45 states have call successors, (45), 16 states have call predecessors, (45), 15 states have return successors, (60), 39 states have call predecessors, (60), 39 states have call successors, (60) [2021-12-14 11:43:18,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 442 transitions. [2021-12-14 11:43:18,316 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 442 transitions. Word has length 36 [2021-12-14 11:43:18,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:18,316 INFO L470 AbstractCegarLoop]: Abstraction has 323 states and 442 transitions. [2021-12-14 11:43:18,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:43:18,317 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 442 transitions. [2021-12-14 11:43:18,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-14 11:43:18,317 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:18,318 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:18,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-14 11:43:18,318 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:18,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:18,319 INFO L85 PathProgramCache]: Analyzing trace with hash 2018897985, now seen corresponding path program 1 times [2021-12-14 11:43:18,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:18,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479240532] [2021-12-14 11:43:18,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:18,319 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:18,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-14 11:43:18,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:18,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:18,354 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:18,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479240532] [2021-12-14 11:43:18,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479240532] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:18,354 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:18,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 11:43:18,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271481616] [2021-12-14 11:43:18,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:18,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 11:43:18,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:18,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 11:43:18,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 11:43:18,356 INFO L87 Difference]: Start difference. First operand 323 states and 442 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:18,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:18,499 INFO L93 Difference]: Finished difference Result 352 states and 479 transitions. [2021-12-14 11:43:18,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 11:43:18,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2021-12-14 11:43:18,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:18,502 INFO L225 Difference]: With dead ends: 352 [2021-12-14 11:43:18,502 INFO L226 Difference]: Without dead ends: 322 [2021-12-14 11:43:18,502 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-14 11:43:18,503 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 79 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:18,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 1079 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:43:18,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2021-12-14 11:43:18,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 308. [2021-12-14 11:43:18,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 249 states have (on average 1.2931726907630523) internal successors, (322), 255 states have internal predecessors, (322), 44 states have call successors, (44), 15 states have call predecessors, (44), 14 states have return successors, (59), 38 states have call predecessors, (59), 38 states have call successors, (59) [2021-12-14 11:43:18,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 425 transitions. [2021-12-14 11:43:18,524 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 425 transitions. Word has length 38 [2021-12-14 11:43:18,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:18,524 INFO L470 AbstractCegarLoop]: Abstraction has 308 states and 425 transitions. [2021-12-14 11:43:18,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:18,525 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 425 transitions. [2021-12-14 11:43:18,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-14 11:43:18,525 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:18,525 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:18,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-14 11:43:18,526 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:18,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:18,526 INFO L85 PathProgramCache]: Analyzing trace with hash 233678808, now seen corresponding path program 1 times [2021-12-14 11:43:18,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:18,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391426535] [2021-12-14 11:43:18,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:18,527 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:18,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:18,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:18,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:18,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391426535] [2021-12-14 11:43:18,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391426535] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:18,577 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:18,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 11:43:18,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478888841] [2021-12-14 11:43:18,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:18,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 11:43:18,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:18,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 11:43:18,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 11:43:18,579 INFO L87 Difference]: Start difference. First operand 308 states and 425 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:43:18,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:18,663 INFO L93 Difference]: Finished difference Result 323 states and 441 transitions. [2021-12-14 11:43:18,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 11:43:18,664 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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 37 [2021-12-14 11:43:18,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:18,666 INFO L225 Difference]: With dead ends: 323 [2021-12-14 11:43:18,666 INFO L226 Difference]: Without dead ends: 319 [2021-12-14 11:43:18,667 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:43:18,667 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 46 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:18,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 1090 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:43:18,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2021-12-14 11:43:18,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 315. [2021-12-14 11:43:18,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 256 states have (on average 1.2890625) internal successors, (330), 262 states have internal predecessors, (330), 44 states have call successors, (44), 15 states have call predecessors, (44), 14 states have return successors, (59), 38 states have call predecessors, (59), 38 states have call successors, (59) [2021-12-14 11:43:18,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 433 transitions. [2021-12-14 11:43:18,686 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 433 transitions. Word has length 37 [2021-12-14 11:43:18,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:18,687 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 433 transitions. [2021-12-14 11:43:18,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:43:18,687 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 433 transitions. [2021-12-14 11:43:18,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-14 11:43:18,688 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:18,688 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:18,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-14 11:43:18,688 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:18,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:18,689 INFO L85 PathProgramCache]: Analyzing trace with hash 233401978, now seen corresponding path program 1 times [2021-12-14 11:43:18,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:18,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644144946] [2021-12-14 11:43:18,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:18,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:18,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:18,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:18,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644144946] [2021-12-14 11:43:18,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644144946] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:18,723 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:18,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 11:43:18,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076250897] [2021-12-14 11:43:18,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:18,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 11:43:18,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:18,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 11:43:18,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 11:43:18,725 INFO L87 Difference]: Start difference. First operand 315 states and 433 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:43:18,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:18,912 INFO L93 Difference]: Finished difference Result 431 states and 618 transitions. [2021-12-14 11:43:18,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 11:43:18,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 37 [2021-12-14 11:43:18,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:18,915 INFO L225 Difference]: With dead ends: 431 [2021-12-14 11:43:18,916 INFO L226 Difference]: Without dead ends: 402 [2021-12-14 11:43:18,916 INFO L932 BasicCegarLoop]: 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 [2021-12-14 11:43:18,917 INFO L933 BasicCegarLoop]: 359 mSDtfsCounter, 345 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:18,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [347 Valid, 501 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:18,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2021-12-14 11:43:18,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 292. [2021-12-14 11:43:18,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 233 states have (on average 1.3004291845493563) internal successors, (303), 239 states have internal predecessors, (303), 44 states have call successors, (44), 15 states have call predecessors, (44), 14 states have return successors, (59), 38 states have call predecessors, (59), 38 states have call successors, (59) [2021-12-14 11:43:18,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 406 transitions. [2021-12-14 11:43:18,951 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 406 transitions. Word has length 37 [2021-12-14 11:43:18,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:18,951 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 406 transitions. [2021-12-14 11:43:18,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:43:18,952 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 406 transitions. [2021-12-14 11:43:18,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-14 11:43:18,952 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:18,952 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:18,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-14 11:43:18,953 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:18,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:18,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1150124824, now seen corresponding path program 1 times [2021-12-14 11:43:18,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:18,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998786222] [2021-12-14 11:43:18,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:18,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:18,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:18,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 11:43:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:18,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-14 11:43:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:18,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:18,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:18,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998786222] [2021-12-14 11:43:18,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998786222] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:18,988 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:18,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 11:43:18,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937686414] [2021-12-14 11:43:18,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:18,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 11:43:18,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:18,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 11:43:18,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 11:43:18,990 INFO L87 Difference]: Start difference. First operand 292 states and 406 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 11:43:19,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:19,135 INFO L93 Difference]: Finished difference Result 544 states and 787 transitions. [2021-12-14 11:43:19,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 11:43:19,136 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2021-12-14 11:43:19,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:19,138 INFO L225 Difference]: With dead ends: 544 [2021-12-14 11:43:19,138 INFO L226 Difference]: Without dead ends: 310 [2021-12-14 11:43:19,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-14 11:43:19,139 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 112 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:19,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 639 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:43:19,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-12-14 11:43:19,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 302. [2021-12-14 11:43:19,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 243 states have (on average 1.3045267489711934) internal successors, (317), 248 states have internal predecessors, (317), 44 states have call successors, (44), 15 states have call predecessors, (44), 14 states have return successors, (59), 38 states have call predecessors, (59), 38 states have call successors, (59) [2021-12-14 11:43:19,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 420 transitions. [2021-12-14 11:43:19,160 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 420 transitions. Word has length 43 [2021-12-14 11:43:19,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:19,160 INFO L470 AbstractCegarLoop]: Abstraction has 302 states and 420 transitions. [2021-12-14 11:43:19,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 11:43:19,161 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 420 transitions. [2021-12-14 11:43:19,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-14 11:43:19,161 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:19,162 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:19,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-14 11:43:19,162 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:19,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:19,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1967801604, now seen corresponding path program 1 times [2021-12-14 11:43:19,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:19,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923823097] [2021-12-14 11:43:19,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:19,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:19,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 11:43:19,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:19,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:19,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:19,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923823097] [2021-12-14 11:43:19,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923823097] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:19,286 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:19,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 11:43:19,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109329837] [2021-12-14 11:43:19,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:19,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 11:43:19,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:19,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 11:43:19,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-14 11:43:19,287 INFO L87 Difference]: Start difference. First operand 302 states and 420 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:19,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:19,643 INFO L93 Difference]: Finished difference Result 333 states and 468 transitions. [2021-12-14 11:43:19,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 11:43:19,644 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2021-12-14 11:43:19,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:19,645 INFO L225 Difference]: With dead ends: 333 [2021-12-14 11:43:19,645 INFO L226 Difference]: Without dead ends: 310 [2021-12-14 11:43:19,646 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-12-14 11:43:19,646 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 77 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:19,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 1287 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 11:43:19,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-12-14 11:43:19,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 301. [2021-12-14 11:43:19,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 242 states have (on average 1.3016528925619835) internal successors, (315), 247 states have internal predecessors, (315), 44 states have call successors, (44), 15 states have call predecessors, (44), 14 states have return successors, (59), 38 states have call predecessors, (59), 38 states have call successors, (59) [2021-12-14 11:43:19,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 418 transitions. [2021-12-14 11:43:19,682 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 418 transitions. Word has length 43 [2021-12-14 11:43:19,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:19,682 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 418 transitions. [2021-12-14 11:43:19,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:19,683 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 418 transitions. [2021-12-14 11:43:19,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-14 11:43:19,685 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:19,685 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:19,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-14 11:43:19,685 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:19,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:19,686 INFO L85 PathProgramCache]: Analyzing trace with hash -896869873, now seen corresponding path program 1 times [2021-12-14 11:43:19,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:19,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826807985] [2021-12-14 11:43:19,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:19,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:19,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 11:43:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:19,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 11:43:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:19,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:19,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:19,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826807985] [2021-12-14 11:43:19,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826807985] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:19,745 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:19,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 11:43:19,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171613799] [2021-12-14 11:43:19,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:19,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 11:43:19,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:19,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 11:43:19,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-14 11:43:19,747 INFO L87 Difference]: Start difference. First operand 301 states and 418 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 11:43:19,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:19,934 INFO L93 Difference]: Finished difference Result 569 states and 825 transitions. [2021-12-14 11:43:19,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 11:43:19,934 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2021-12-14 11:43:19,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:19,937 INFO L225 Difference]: With dead ends: 569 [2021-12-14 11:43:19,937 INFO L226 Difference]: Without dead ends: 326 [2021-12-14 11:43:19,938 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-14 11:43:19,938 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 61 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:19,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 1194 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:19,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2021-12-14 11:43:19,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 313. [2021-12-14 11:43:19,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 252 states have (on average 1.2936507936507937) internal successors, (326), 257 states have internal predecessors, (326), 44 states have call successors, (44), 15 states have call predecessors, (44), 16 states have return successors, (77), 40 states have call predecessors, (77), 38 states have call successors, (77) [2021-12-14 11:43:19,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 447 transitions. [2021-12-14 11:43:19,960 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 447 transitions. Word has length 48 [2021-12-14 11:43:19,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:19,961 INFO L470 AbstractCegarLoop]: Abstraction has 313 states and 447 transitions. [2021-12-14 11:43:19,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 11:43:19,961 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 447 transitions. [2021-12-14 11:43:19,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-14 11:43:19,962 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:19,962 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:19,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-14 11:43:19,962 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:19,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:19,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1018197871, now seen corresponding path program 1 times [2021-12-14 11:43:19,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:19,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774912329] [2021-12-14 11:43:19,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:19,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:19,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:20,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 11:43:20,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:20,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:20,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:20,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774912329] [2021-12-14 11:43:20,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774912329] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:20,053 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:20,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 11:43:20,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995783697] [2021-12-14 11:43:20,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:20,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 11:43:20,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:20,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 11:43:20,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-14 11:43:20,055 INFO L87 Difference]: Start difference. First operand 313 states and 447 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:20,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:20,373 INFO L93 Difference]: Finished difference Result 315 states and 448 transitions. [2021-12-14 11:43:20,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 11:43:20,374 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2021-12-14 11:43:20,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:20,376 INFO L225 Difference]: With dead ends: 315 [2021-12-14 11:43:20,376 INFO L226 Difference]: Without dead ends: 282 [2021-12-14 11:43:20,376 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-14 11:43:20,377 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 66 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:20,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 1244 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 11:43:20,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-12-14 11:43:20,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2021-12-14 11:43:20,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 224 states have (on average 1.3169642857142858) internal successors, (295), 228 states have internal predecessors, (295), 42 states have call successors, (42), 14 states have call predecessors, (42), 15 states have return successors, (76), 39 states have call predecessors, (76), 37 states have call successors, (76) [2021-12-14 11:43:20,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 413 transitions. [2021-12-14 11:43:20,398 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 413 transitions. Word has length 44 [2021-12-14 11:43:20,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:20,398 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 413 transitions. [2021-12-14 11:43:20,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:20,399 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 413 transitions. [2021-12-14 11:43:20,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-14 11:43:20,403 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:20,404 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:20,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-14 11:43:20,405 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:20,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:20,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1224484534, now seen corresponding path program 1 times [2021-12-14 11:43:20,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:20,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806180672] [2021-12-14 11:43:20,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:20,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:20,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 11:43:20,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:20,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 11:43:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:20,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:20,464 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:20,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806180672] [2021-12-14 11:43:20,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806180672] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:20,464 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:20,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 11:43:20,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090184982] [2021-12-14 11:43:20,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:20,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 11:43:20,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:20,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 11:43:20,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 11:43:20,467 INFO L87 Difference]: Start difference. First operand 282 states and 413 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 11:43:20,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:20,680 INFO L93 Difference]: Finished difference Result 441 states and 673 transitions. [2021-12-14 11:43:20,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 11:43:20,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2021-12-14 11:43:20,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:20,684 INFO L225 Difference]: With dead ends: 441 [2021-12-14 11:43:20,684 INFO L226 Difference]: Without dead ends: 438 [2021-12-14 11:43:20,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-14 11:43:20,685 INFO L933 BasicCegarLoop]: 295 mSDtfsCounter, 140 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:20,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 796 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:20,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-12-14 11:43:20,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 286. [2021-12-14 11:43:20,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 228 states have (on average 1.3201754385964912) internal successors, (301), 232 states have internal predecessors, (301), 42 states have call successors, (42), 14 states have call predecessors, (42), 15 states have return successors, (76), 39 states have call predecessors, (76), 37 states have call successors, (76) [2021-12-14 11:43:20,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 419 transitions. [2021-12-14 11:43:20,707 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 419 transitions. Word has length 49 [2021-12-14 11:43:20,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:20,708 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 419 transitions. [2021-12-14 11:43:20,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 11:43:20,708 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 419 transitions. [2021-12-14 11:43:20,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-14 11:43:20,709 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:20,709 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:20,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-14 11:43:20,709 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:20,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:20,710 INFO L85 PathProgramCache]: Analyzing trace with hash -2015471348, now seen corresponding path program 1 times [2021-12-14 11:43:20,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:20,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000623734] [2021-12-14 11:43:20,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:20,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:20,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-14 11:43:20,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:20,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 11:43:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:20,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:20,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:20,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000623734] [2021-12-14 11:43:20,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000623734] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:20,772 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:20,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 11:43:20,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002106500] [2021-12-14 11:43:20,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:20,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 11:43:20,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:20,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 11:43:20,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 11:43:20,775 INFO L87 Difference]: Start difference. First operand 286 states and 419 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 11:43:20,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:20,993 INFO L93 Difference]: Finished difference Result 658 states and 979 transitions. [2021-12-14 11:43:20,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 11:43:20,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2021-12-14 11:43:20,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:20,996 INFO L225 Difference]: With dead ends: 658 [2021-12-14 11:43:20,996 INFO L226 Difference]: Without dead ends: 405 [2021-12-14 11:43:20,997 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-14 11:43:20,998 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 214 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:20,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 543 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:20,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2021-12-14 11:43:21,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 373. [2021-12-14 11:43:21,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 297 states have (on average 1.2996632996632997) internal successors, (386), 302 states have internal predecessors, (386), 53 states have call successors, (53), 18 states have call predecessors, (53), 22 states have return successors, (96), 52 states have call predecessors, (96), 49 states have call successors, (96) [2021-12-14 11:43:21,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 535 transitions. [2021-12-14 11:43:21,024 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 535 transitions. Word has length 49 [2021-12-14 11:43:21,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:21,025 INFO L470 AbstractCegarLoop]: Abstraction has 373 states and 535 transitions. [2021-12-14 11:43:21,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 11:43:21,025 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 535 transitions. [2021-12-14 11:43:21,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-14 11:43:21,026 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:21,026 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:21,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-14 11:43:21,026 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:21,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:21,027 INFO L85 PathProgramCache]: Analyzing trace with hash -726473774, now seen corresponding path program 1 times [2021-12-14 11:43:21,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:21,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922062157] [2021-12-14 11:43:21,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:21,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:21,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 11:43:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:21,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 11:43:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:21,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 11:43:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:21,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:21,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:21,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922062157] [2021-12-14 11:43:21,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922062157] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:21,176 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:21,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 11:43:21,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911805446] [2021-12-14 11:43:21,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:21,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 11:43:21,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:21,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 11:43:21,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-14 11:43:21,178 INFO L87 Difference]: Start difference. First operand 373 states and 535 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-14 11:43:21,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:21,390 INFO L93 Difference]: Finished difference Result 691 states and 1016 transitions. [2021-12-14 11:43:21,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 11:43:21,391 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2021-12-14 11:43:21,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:21,393 INFO L225 Difference]: With dead ends: 691 [2021-12-14 11:43:21,393 INFO L226 Difference]: Without dead ends: 346 [2021-12-14 11:43:21,395 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-14 11:43:21,395 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 88 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:21,396 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 1044 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:21,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2021-12-14 11:43:21,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2021-12-14 11:43:21,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 271 states have (on average 1.2767527675276753) internal successors, (346), 275 states have internal predecessors, (346), 52 states have call successors, (52), 18 states have call predecessors, (52), 22 states have return successors, (96), 52 states have call predecessors, (96), 49 states have call successors, (96) [2021-12-14 11:43:21,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 494 transitions. [2021-12-14 11:43:21,421 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 494 transitions. Word has length 50 [2021-12-14 11:43:21,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:21,422 INFO L470 AbstractCegarLoop]: Abstraction has 346 states and 494 transitions. [2021-12-14 11:43:21,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-14 11:43:21,422 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 494 transitions. [2021-12-14 11:43:21,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-12-14 11:43:21,423 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:21,423 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:21,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-14 11:43:21,423 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:21,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:21,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1339562411, now seen corresponding path program 1 times [2021-12-14 11:43:21,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:21,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874392349] [2021-12-14 11:43:21,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:21,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:21,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 11:43:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:21,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 11:43:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:21,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 11:43:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:21,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 11:43:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:21,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:21,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:21,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874392349] [2021-12-14 11:43:21,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874392349] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:21,522 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:21,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 11:43:21,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390252320] [2021-12-14 11:43:21,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:21,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 11:43:21,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:21,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 11:43:21,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-14 11:43:21,523 INFO L87 Difference]: Start difference. First operand 346 states and 494 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 11:43:21,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:21,847 INFO L93 Difference]: Finished difference Result 659 states and 959 transitions. [2021-12-14 11:43:21,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 11:43:21,848 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2021-12-14 11:43:21,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:21,850 INFO L225 Difference]: With dead ends: 659 [2021-12-14 11:43:21,850 INFO L226 Difference]: Without dead ends: 341 [2021-12-14 11:43:21,852 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2021-12-14 11:43:21,852 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 232 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:21,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 841 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:21,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-12-14 11:43:21,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2021-12-14 11:43:21,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 267 states have (on average 1.2659176029962547) internal successors, (338), 271 states have internal predecessors, (338), 52 states have call successors, (52), 18 states have call predecessors, (52), 21 states have return successors, (91), 51 states have call predecessors, (91), 49 states have call successors, (91) [2021-12-14 11:43:21,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 481 transitions. [2021-12-14 11:43:21,885 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 481 transitions. Word has length 54 [2021-12-14 11:43:21,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:21,885 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 481 transitions. [2021-12-14 11:43:21,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 11:43:21,886 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 481 transitions. [2021-12-14 11:43:21,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-14 11:43:21,887 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:21,887 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:21,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-12-14 11:43:21,888 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:21,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:21,888 INFO L85 PathProgramCache]: Analyzing trace with hash 330640549, now seen corresponding path program 1 times [2021-12-14 11:43:21,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:21,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789756880] [2021-12-14 11:43:21,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:21,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:21,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 11:43:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:21,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 11:43:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:21,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 11:43:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:21,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 11:43:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:21,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:21,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:21,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789756880] [2021-12-14 11:43:21,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789756880] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:21,960 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:21,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 11:43:21,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613922568] [2021-12-14 11:43:21,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:21,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 11:43:21,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:21,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 11:43:21,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-12-14 11:43:21,961 INFO L87 Difference]: Start difference. First operand 341 states and 481 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-14 11:43:22,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:22,166 INFO L93 Difference]: Finished difference Result 666 states and 963 transitions. [2021-12-14 11:43:22,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 11:43:22,166 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 5 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 57 [2021-12-14 11:43:22,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:22,169 INFO L225 Difference]: With dead ends: 666 [2021-12-14 11:43:22,169 INFO L226 Difference]: Without dead ends: 353 [2021-12-14 11:43:22,170 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-12-14 11:43:22,171 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 51 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:22,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 703 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:22,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-12-14 11:43:22,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 344. [2021-12-14 11:43:22,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 270 states have (on average 1.262962962962963) internal successors, (341), 274 states have internal predecessors, (341), 52 states have call successors, (52), 18 states have call predecessors, (52), 21 states have return successors, (91), 51 states have call predecessors, (91), 49 states have call successors, (91) [2021-12-14 11:43:22,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 484 transitions. [2021-12-14 11:43:22,195 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 484 transitions. Word has length 57 [2021-12-14 11:43:22,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:22,195 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 484 transitions. [2021-12-14 11:43:22,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-14 11:43:22,196 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 484 transitions. [2021-12-14 11:43:22,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-14 11:43:22,196 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:22,197 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:22,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-12-14 11:43:22,197 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:22,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:22,197 INFO L85 PathProgramCache]: Analyzing trace with hash 942519397, now seen corresponding path program 1 times [2021-12-14 11:43:22,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:22,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849513510] [2021-12-14 11:43:22,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:22,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:22,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 11:43:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:22,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 11:43:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:22,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 11:43:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:22,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 11:43:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:22,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:22,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:22,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849513510] [2021-12-14 11:43:22,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849513510] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:22,317 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:22,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 11:43:22,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963276579] [2021-12-14 11:43:22,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:22,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 11:43:22,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:22,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 11:43:22,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-14 11:43:22,319 INFO L87 Difference]: Start difference. First operand 344 states and 484 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-14 11:43:22,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:22,630 INFO L93 Difference]: Finished difference Result 662 states and 947 transitions. [2021-12-14 11:43:22,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 11:43:22,631 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2021-12-14 11:43:22,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:22,633 INFO L225 Difference]: With dead ends: 662 [2021-12-14 11:43:22,633 INFO L226 Difference]: Without dead ends: 347 [2021-12-14 11:43:22,635 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-12-14 11:43:22,635 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 46 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 1353 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:22,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 1353 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 11:43:22,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2021-12-14 11:43:22,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 344. [2021-12-14 11:43:22,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 270 states have (on average 1.2518518518518518) internal successors, (338), 274 states have internal predecessors, (338), 52 states have call successors, (52), 18 states have call predecessors, (52), 21 states have return successors, (91), 51 states have call predecessors, (91), 49 states have call successors, (91) [2021-12-14 11:43:22,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 481 transitions. [2021-12-14 11:43:22,678 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 481 transitions. Word has length 57 [2021-12-14 11:43:22,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:22,679 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 481 transitions. [2021-12-14 11:43:22,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-14 11:43:22,680 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 481 transitions. [2021-12-14 11:43:22,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-14 11:43:22,681 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:22,681 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:22,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-12-14 11:43:22,681 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:22,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:22,682 INFO L85 PathProgramCache]: Analyzing trace with hash -146309345, now seen corresponding path program 1 times [2021-12-14 11:43:22,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:22,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125391534] [2021-12-14 11:43:22,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:22,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:22,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:22,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 11:43:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:22,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 11:43:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:22,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 11:43:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:22,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 11:43:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:22,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 11:43:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:22,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:22,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:22,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125391534] [2021-12-14 11:43:22,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125391534] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:22,796 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:22,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 11:43:22,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733712417] [2021-12-14 11:43:22,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:22,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 11:43:22,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:22,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 11:43:22,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-12-14 11:43:22,798 INFO L87 Difference]: Start difference. First operand 344 states and 481 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, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 11:43:23,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:23,197 INFO L93 Difference]: Finished difference Result 623 states and 870 transitions. [2021-12-14 11:43:23,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 11:43:23,198 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, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2021-12-14 11:43:23,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:23,200 INFO L225 Difference]: With dead ends: 623 [2021-12-14 11:43:23,200 INFO L226 Difference]: Without dead ends: 322 [2021-12-14 11:43:23,201 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2021-12-14 11:43:23,202 INFO L933 BasicCegarLoop]: 278 mSDtfsCounter, 165 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:23,202 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 1240 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 11:43:23,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2021-12-14 11:43:23,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 314. [2021-12-14 11:43:23,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 246 states have (on average 1.2560975609756098) internal successors, (309), 252 states have internal predecessors, (309), 49 states have call successors, (49), 18 states have call predecessors, (49), 18 states have return successors, (70), 43 states have call predecessors, (70), 46 states have call successors, (70) [2021-12-14 11:43:23,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 428 transitions. [2021-12-14 11:43:23,222 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 428 transitions. Word has length 68 [2021-12-14 11:43:23,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:23,223 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 428 transitions. [2021-12-14 11:43:23,223 INFO L471 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, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 11:43:23,223 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 428 transitions. [2021-12-14 11:43:23,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-14 11:43:23,224 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:23,224 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:23,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-12-14 11:43:23,224 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:23,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:23,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1989043251, now seen corresponding path program 1 times [2021-12-14 11:43:23,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:23,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900400399] [2021-12-14 11:43:23,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:23,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:23,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 11:43:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:23,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 11:43:23,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:23,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 11:43:23,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:23,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 11:43:23,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:23,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-14 11:43:23,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:23,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:23,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:23,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900400399] [2021-12-14 11:43:23,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900400399] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:23,399 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:23,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-12-14 11:43:23,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104416970] [2021-12-14 11:43:23,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:23,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-14 11:43:23,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:23,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-14 11:43:23,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2021-12-14 11:43:23,402 INFO L87 Difference]: Start difference. First operand 314 states and 428 transitions. Second operand has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 11 states have internal predecessors, (62), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 11:43:23,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:23,801 INFO L93 Difference]: Finished difference Result 350 states and 477 transitions. [2021-12-14 11:43:23,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 11:43:23,802 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 11 states have internal predecessors, (62), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 73 [2021-12-14 11:43:23,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:23,804 INFO L225 Difference]: With dead ends: 350 [2021-12-14 11:43:23,804 INFO L226 Difference]: Without dead ends: 329 [2021-12-14 11:43:23,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2021-12-14 11:43:23,805 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 126 mSDsluCounter, 2057 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 2250 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:23,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 2250 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 11:43:23,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2021-12-14 11:43:23,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 317. [2021-12-14 11:43:23,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 248 states have (on average 1.2540322580645162) internal successors, (311), 255 states have internal predecessors, (311), 49 states have call successors, (49), 18 states have call predecessors, (49), 19 states have return successors, (71), 43 states have call predecessors, (71), 46 states have call successors, (71) [2021-12-14 11:43:23,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 431 transitions. [2021-12-14 11:43:23,828 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 431 transitions. Word has length 73 [2021-12-14 11:43:23,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:23,828 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 431 transitions. [2021-12-14 11:43:23,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 11 states have internal predecessors, (62), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 11:43:23,828 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 431 transitions. [2021-12-14 11:43:23,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-14 11:43:23,830 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:23,830 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:23,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-12-14 11:43:23,830 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:23,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:23,831 INFO L85 PathProgramCache]: Analyzing trace with hash -182846632, now seen corresponding path program 1 times [2021-12-14 11:43:23,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:23,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465160761] [2021-12-14 11:43:23,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:23,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:23,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:23,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 11:43:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:23,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 11:43:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:24,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 11:43:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:24,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 11:43:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:24,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-14 11:43:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:24,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:24,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:24,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465160761] [2021-12-14 11:43:24,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465160761] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:24,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:24,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-12-14 11:43:24,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619084161] [2021-12-14 11:43:24,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:24,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-14 11:43:24,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:24,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-14 11:43:24,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2021-12-14 11:43:24,030 INFO L87 Difference]: Start difference. First operand 317 states and 431 transitions. Second operand has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 11:43:24,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:24,461 INFO L93 Difference]: Finished difference Result 354 states and 481 transitions. [2021-12-14 11:43:24,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 11:43:24,462 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 74 [2021-12-14 11:43:24,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:24,464 INFO L225 Difference]: With dead ends: 354 [2021-12-14 11:43:24,464 INFO L226 Difference]: Without dead ends: 333 [2021-12-14 11:43:24,465 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2021-12-14 11:43:24,465 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 126 mSDsluCounter, 2354 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 2563 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:24,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 2563 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 11:43:24,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2021-12-14 11:43:24,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 317. [2021-12-14 11:43:24,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 248 states have (on average 1.2540322580645162) internal successors, (311), 255 states have internal predecessors, (311), 49 states have call successors, (49), 18 states have call predecessors, (49), 19 states have return successors, (71), 43 states have call predecessors, (71), 46 states have call successors, (71) [2021-12-14 11:43:24,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 431 transitions. [2021-12-14 11:43:24,485 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 431 transitions. Word has length 74 [2021-12-14 11:43:24,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:24,486 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 431 transitions. [2021-12-14 11:43:24,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-14 11:43:24,486 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 431 transitions. [2021-12-14 11:43:24,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-12-14 11:43:24,487 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:24,487 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:24,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-12-14 11:43:24,488 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:24,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:24,488 INFO L85 PathProgramCache]: Analyzing trace with hash -673237615, now seen corresponding path program 1 times [2021-12-14 11:43:24,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:24,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010327670] [2021-12-14 11:43:24,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:24,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:24,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-14 11:43:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:24,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 11:43:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:24,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 11:43:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:24,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 11:43:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:24,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-14 11:43:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:24,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 11:43:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:24,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:24,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:24,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010327670] [2021-12-14 11:43:24,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010327670] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:24,681 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:24,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-12-14 11:43:24,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061661304] [2021-12-14 11:43:24,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:24,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-14 11:43:24,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:24,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-14 11:43:24,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2021-12-14 11:43:24,683 INFO L87 Difference]: Start difference. First operand 317 states and 431 transitions. Second operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-14 11:43:25,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:25,405 INFO L93 Difference]: Finished difference Result 468 states and 698 transitions. [2021-12-14 11:43:25,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-14 11:43:25,406 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 82 [2021-12-14 11:43:25,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:25,409 INFO L225 Difference]: With dead ends: 468 [2021-12-14 11:43:25,409 INFO L226 Difference]: Without dead ends: 429 [2021-12-14 11:43:25,411 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2021-12-14 11:43:25,412 INFO L933 BasicCegarLoop]: 243 mSDtfsCounter, 194 mSDsluCounter, 2809 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 3052 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:25,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 3052 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 11:43:25,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2021-12-14 11:43:25,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 413. [2021-12-14 11:43:25,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 316 states have (on average 1.2626582278481013) internal successors, (399), 327 states have internal predecessors, (399), 76 states have call successors, (76), 18 states have call predecessors, (76), 20 states have return successors, (110), 67 states have call predecessors, (110), 72 states have call successors, (110) [2021-12-14 11:43:25,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 585 transitions. [2021-12-14 11:43:25,442 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 585 transitions. Word has length 82 [2021-12-14 11:43:25,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:25,442 INFO L470 AbstractCegarLoop]: Abstraction has 413 states and 585 transitions. [2021-12-14 11:43:25,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-14 11:43:25,442 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 585 transitions. [2021-12-14 11:43:25,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-14 11:43:25,443 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:25,444 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:25,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-12-14 11:43:25,444 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:25,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:25,444 INFO L85 PathProgramCache]: Analyzing trace with hash -166689667, now seen corresponding path program 1 times [2021-12-14 11:43:25,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:25,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760208564] [2021-12-14 11:43:25,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:25,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:25,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:25,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 11:43:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:25,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 11:43:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:25,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 11:43:25,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:25,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 11:43:25,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:25,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 11:43:25,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:25,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-14 11:43:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:25,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:25,566 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:25,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760208564] [2021-12-14 11:43:25,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760208564] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:25,566 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:25,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-14 11:43:25,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262055081] [2021-12-14 11:43:25,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:25,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 11:43:25,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:25,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 11:43:25,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-12-14 11:43:25,570 INFO L87 Difference]: Start difference. First operand 413 states and 585 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-14 11:43:25,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:25,955 INFO L93 Difference]: Finished difference Result 809 states and 1103 transitions. [2021-12-14 11:43:25,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 11:43:25,956 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), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 84 [2021-12-14 11:43:25,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:25,959 INFO L225 Difference]: With dead ends: 809 [2021-12-14 11:43:25,959 INFO L226 Difference]: Without dead ends: 538 [2021-12-14 11:43:25,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2021-12-14 11:43:25,960 INFO L933 BasicCegarLoop]: 240 mSDtfsCounter, 377 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:25,961 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [379 Valid, 1086 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 11:43:25,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2021-12-14 11:43:25,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 496. [2021-12-14 11:43:25,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 387 states have (on average 1.2532299741602067) internal successors, (485), 397 states have internal predecessors, (485), 79 states have call successors, (79), 25 states have call predecessors, (79), 29 states have return successors, (114), 73 states have call predecessors, (114), 75 states have call successors, (114) [2021-12-14 11:43:25,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 678 transitions. [2021-12-14 11:43:25,990 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 678 transitions. Word has length 84 [2021-12-14 11:43:25,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:25,990 INFO L470 AbstractCegarLoop]: Abstraction has 496 states and 678 transitions. [2021-12-14 11:43:25,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-14 11:43:25,991 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 678 transitions. [2021-12-14 11:43:25,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-14 11:43:25,992 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:25,992 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:25,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-12-14 11:43:25,992 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:25,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:25,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1602435204, now seen corresponding path program 1 times [2021-12-14 11:43:25,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:25,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529430234] [2021-12-14 11:43:25,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:25,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:26,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:26,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 11:43:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:26,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 11:43:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:26,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 11:43:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:26,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 11:43:26,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:26,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 11:43:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:26,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-14 11:43:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:26,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:26,119 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:26,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529430234] [2021-12-14 11:43:26,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529430234] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:26,120 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:26,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-14 11:43:26,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887740486] [2021-12-14 11:43:26,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:26,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 11:43:26,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:26,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 11:43:26,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-14 11:43:26,121 INFO L87 Difference]: Start difference. First operand 496 states and 678 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 7 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-14 11:43:26,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:26,610 INFO L93 Difference]: Finished difference Result 867 states and 1198 transitions. [2021-12-14 11:43:26,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 11:43:26,611 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 7 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 84 [2021-12-14 11:43:26,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:26,614 INFO L225 Difference]: With dead ends: 867 [2021-12-14 11:43:26,614 INFO L226 Difference]: Without dead ends: 496 [2021-12-14 11:43:26,616 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2021-12-14 11:43:26,616 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 447 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:26,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [459 Valid, 715 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 11:43:26,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2021-12-14 11:43:26,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2021-12-14 11:43:26,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 387 states have (on average 1.248062015503876) internal successors, (483), 397 states have internal predecessors, (483), 79 states have call successors, (79), 25 states have call predecessors, (79), 29 states have return successors, (106), 73 states have call predecessors, (106), 75 states have call successors, (106) [2021-12-14 11:43:26,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 668 transitions. [2021-12-14 11:43:26,667 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 668 transitions. Word has length 84 [2021-12-14 11:43:26,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:26,668 INFO L470 AbstractCegarLoop]: Abstraction has 496 states and 668 transitions. [2021-12-14 11:43:26,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 7 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-14 11:43:26,668 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 668 transitions. [2021-12-14 11:43:26,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-14 11:43:26,669 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:26,669 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:26,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-12-14 11:43:26,670 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:26,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:26,670 INFO L85 PathProgramCache]: Analyzing trace with hash 716383564, now seen corresponding path program 1 times [2021-12-14 11:43:26,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:26,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425985933] [2021-12-14 11:43:26,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:26,671 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:26,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:26,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-14 11:43:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:26,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 11:43:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:26,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 11:43:26,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:26,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 11:43:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:26,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-14 11:43:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:26,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-14 11:43:26,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:26,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:26,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:26,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425985933] [2021-12-14 11:43:26,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425985933] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:26,891 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:26,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-12-14 11:43:26,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042805733] [2021-12-14 11:43:26,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:26,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-14 11:43:26,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:26,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-14 11:43:26,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2021-12-14 11:43:26,893 INFO L87 Difference]: Start difference. First operand 496 states and 668 transitions. Second operand has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 11 states have internal predecessors, (70), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-14 11:43:27,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:27,584 INFO L93 Difference]: Finished difference Result 657 states and 955 transitions. [2021-12-14 11:43:27,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-14 11:43:27,584 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 11 states have internal predecessors, (70), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 83 [2021-12-14 11:43:27,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:27,588 INFO L225 Difference]: With dead ends: 657 [2021-12-14 11:43:27,588 INFO L226 Difference]: Without dead ends: 610 [2021-12-14 11:43:27,589 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2021-12-14 11:43:27,589 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 249 mSDsluCounter, 2550 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 2791 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:27,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 2791 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 11:43:27,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2021-12-14 11:43:27,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 493. [2021-12-14 11:43:27,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 385 states have (on average 1.2493506493506494) internal successors, (481), 394 states have internal predecessors, (481), 79 states have call successors, (79), 25 states have call predecessors, (79), 28 states have return successors, (105), 73 states have call predecessors, (105), 75 states have call successors, (105) [2021-12-14 11:43:27,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 665 transitions. [2021-12-14 11:43:27,623 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 665 transitions. Word has length 83 [2021-12-14 11:43:27,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:27,624 INFO L470 AbstractCegarLoop]: Abstraction has 493 states and 665 transitions. [2021-12-14 11:43:27,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 11 states have internal predecessors, (70), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-14 11:43:27,624 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 665 transitions. [2021-12-14 11:43:27,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-14 11:43:27,625 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:27,625 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:27,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-12-14 11:43:27,626 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:27,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:27,626 INFO L85 PathProgramCache]: Analyzing trace with hash 971177342, now seen corresponding path program 1 times [2021-12-14 11:43:27,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:27,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044368537] [2021-12-14 11:43:27,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:27,627 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:27,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:27,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 11:43:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:27,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 11:43:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:27,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 11:43:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:27,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 11:43:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:27,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 11:43:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:27,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-14 11:43:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:27,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:27,800 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:27,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044368537] [2021-12-14 11:43:27,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044368537] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:27,800 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:27,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-12-14 11:43:27,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014921468] [2021-12-14 11:43:27,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:27,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-14 11:43:27,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:27,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-14 11:43:27,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-12-14 11:43:27,803 INFO L87 Difference]: Start difference. First operand 493 states and 665 transitions. Second operand has 16 states, 16 states have (on average 4.4375) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-14 11:43:28,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:28,535 INFO L93 Difference]: Finished difference Result 965 states and 1304 transitions. [2021-12-14 11:43:28,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-14 11:43:28,536 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 84 [2021-12-14 11:43:28,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:28,540 INFO L225 Difference]: With dead ends: 965 [2021-12-14 11:43:28,541 INFO L226 Difference]: Without dead ends: 931 [2021-12-14 11:43:28,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=787, Unknown=0, NotChecked=0, Total=930 [2021-12-14 11:43:28,542 INFO L933 BasicCegarLoop]: 221 mSDtfsCounter, 366 mSDsluCounter, 2068 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 2289 SdHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:28,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [375 Valid, 2289 Invalid, 1025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 11:43:28,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2021-12-14 11:43:28,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 585. [2021-12-14 11:43:28,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 461 states have (on average 1.2190889370932756) internal successors, (562), 473 states have internal predecessors, (562), 85 states have call successors, (85), 31 states have call predecessors, (85), 38 states have return successors, (115), 80 states have call predecessors, (115), 81 states have call successors, (115) [2021-12-14 11:43:28,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 762 transitions. [2021-12-14 11:43:28,590 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 762 transitions. Word has length 84 [2021-12-14 11:43:28,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:28,590 INFO L470 AbstractCegarLoop]: Abstraction has 585 states and 762 transitions. [2021-12-14 11:43:28,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-14 11:43:28,591 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 762 transitions. [2021-12-14 11:43:28,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-14 11:43:28,592 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:28,592 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:28,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-12-14 11:43:28,592 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:28,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:28,593 INFO L85 PathProgramCache]: Analyzing trace with hash -171325124, now seen corresponding path program 1 times [2021-12-14 11:43:28,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:28,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920752412] [2021-12-14 11:43:28,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:28,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:28,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 11:43:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:28,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 11:43:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:28,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 11:43:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:28,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 11:43:28,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:28,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 11:43:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:28,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-14 11:43:28,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:28,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:28,763 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:28,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920752412] [2021-12-14 11:43:28,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920752412] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:28,763 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:28,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-12-14 11:43:28,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550220328] [2021-12-14 11:43:28,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:28,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-14 11:43:28,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:28,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-14 11:43:28,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-12-14 11:43:28,765 INFO L87 Difference]: Start difference. First operand 585 states and 762 transitions. Second operand has 16 states, 16 states have (on average 4.4375) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-14 11:43:29,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:29,459 INFO L93 Difference]: Finished difference Result 952 states and 1287 transitions. [2021-12-14 11:43:29,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-14 11:43:29,460 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 84 [2021-12-14 11:43:29,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:29,464 INFO L225 Difference]: With dead ends: 952 [2021-12-14 11:43:29,464 INFO L226 Difference]: Without dead ends: 918 [2021-12-14 11:43:29,465 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=787, Unknown=0, NotChecked=0, Total=930 [2021-12-14 11:43:29,466 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 287 mSDsluCounter, 2857 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 3204 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:29,466 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 3204 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 11:43:29,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2021-12-14 11:43:29,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 468. [2021-12-14 11:43:29,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 366 states have (on average 1.2486338797814207) internal successors, (457), 375 states have internal predecessors, (457), 75 states have call successors, (75), 23 states have call predecessors, (75), 26 states have return successors, (100), 69 states have call predecessors, (100), 71 states have call successors, (100) [2021-12-14 11:43:29,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 632 transitions. [2021-12-14 11:43:29,504 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 632 transitions. Word has length 84 [2021-12-14 11:43:29,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:29,504 INFO L470 AbstractCegarLoop]: Abstraction has 468 states and 632 transitions. [2021-12-14 11:43:29,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-14 11:43:29,504 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 632 transitions. [2021-12-14 11:43:29,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-14 11:43:29,505 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:29,505 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:29,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-12-14 11:43:29,506 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:29,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:29,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1715684878, now seen corresponding path program 1 times [2021-12-14 11:43:29,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:29,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061971525] [2021-12-14 11:43:29,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:29,507 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:29,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:29,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-14 11:43:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:29,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 11:43:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:29,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 11:43:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:29,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 11:43:29,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:29,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 11:43:29,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:29,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-14 11:43:29,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:29,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-14 11:43:29,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:29,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:29,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:29,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061971525] [2021-12-14 11:43:29,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061971525] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:29,688 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:29,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-12-14 11:43:29,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905731275] [2021-12-14 11:43:29,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:29,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-14 11:43:29,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:29,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-14 11:43:29,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2021-12-14 11:43:29,691 INFO L87 Difference]: Start difference. First operand 468 states and 632 transitions. Second operand has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 10 states have internal predecessors, (78), 4 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-14 11:43:30,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:30,628 INFO L93 Difference]: Finished difference Result 932 states and 1258 transitions. [2021-12-14 11:43:30,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-14 11:43:30,629 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 10 states have internal predecessors, (78), 4 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 93 [2021-12-14 11:43:30,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:30,633 INFO L225 Difference]: With dead ends: 932 [2021-12-14 11:43:30,634 INFO L226 Difference]: Without dead ends: 885 [2021-12-14 11:43:30,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=1134, Unknown=0, NotChecked=0, Total=1332 [2021-12-14 11:43:30,643 INFO L933 BasicCegarLoop]: 251 mSDtfsCounter, 479 mSDsluCounter, 2116 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 2367 SdHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:30,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [494 Valid, 2367 Invalid, 1419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-14 11:43:30,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2021-12-14 11:43:30,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 858. [2021-12-14 11:43:30,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 666 states have (on average 1.2147147147147148) internal successors, (809), 684 states have internal predecessors, (809), 142 states have call successors, (142), 43 states have call predecessors, (142), 49 states have return successors, (185), 130 states have call predecessors, (185), 137 states have call successors, (185) [2021-12-14 11:43:30,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1136 transitions. [2021-12-14 11:43:30,705 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1136 transitions. Word has length 93 [2021-12-14 11:43:30,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:30,707 INFO L470 AbstractCegarLoop]: Abstraction has 858 states and 1136 transitions. [2021-12-14 11:43:30,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 10 states have internal predecessors, (78), 4 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-14 11:43:30,707 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1136 transitions. [2021-12-14 11:43:30,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-12-14 11:43:30,709 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:30,710 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:30,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-12-14 11:43:30,710 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:30,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:30,710 INFO L85 PathProgramCache]: Analyzing trace with hash 327002288, now seen corresponding path program 1 times [2021-12-14 11:43:30,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:30,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631591006] [2021-12-14 11:43:30,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:30,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:30,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-14 11:43:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:30,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 11:43:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:30,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 11:43:30,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:30,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 11:43:30,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:30,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-14 11:43:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:30,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-14 11:43:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:30,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 11:43:30,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:30,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 11:43:30,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:30,826 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-14 11:43:30,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:30,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631591006] [2021-12-14 11:43:30,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631591006] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:30,827 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:30,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-14 11:43:30,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968457541] [2021-12-14 11:43:30,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:30,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 11:43:30,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:30,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 11:43:30,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-14 11:43:30,829 INFO L87 Difference]: Start difference. First operand 858 states and 1136 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-14 11:43:31,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:31,178 INFO L93 Difference]: Finished difference Result 1692 states and 2335 transitions. [2021-12-14 11:43:31,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 11:43:31,179 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 95 [2021-12-14 11:43:31,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:31,185 INFO L225 Difference]: With dead ends: 1692 [2021-12-14 11:43:31,185 INFO L226 Difference]: Without dead ends: 1142 [2021-12-14 11:43:31,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-12-14 11:43:31,190 INFO L933 BasicCegarLoop]: 245 mSDtfsCounter, 206 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 1437 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:31,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 1437 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:31,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2021-12-14 11:43:31,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 834. [2021-12-14 11:43:31,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 650 states have (on average 1.1953846153846155) internal successors, (777), 664 states have internal predecessors, (777), 134 states have call successors, (134), 43 states have call predecessors, (134), 49 states have return successors, (173), 126 states have call predecessors, (173), 129 states have call successors, (173) [2021-12-14 11:43:31,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1084 transitions. [2021-12-14 11:43:31,258 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1084 transitions. Word has length 95 [2021-12-14 11:43:31,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:31,259 INFO L470 AbstractCegarLoop]: Abstraction has 834 states and 1084 transitions. [2021-12-14 11:43:31,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-14 11:43:31,259 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1084 transitions. [2021-12-14 11:43:31,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-14 11:43:31,261 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:31,261 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:31,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-12-14 11:43:31,262 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:31,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:31,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1808548852, now seen corresponding path program 1 times [2021-12-14 11:43:31,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:31,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366894397] [2021-12-14 11:43:31,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:31,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:31,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:31,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-14 11:43:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:31,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 11:43:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:31,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 11:43:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:31,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 11:43:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:31,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-14 11:43:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:31,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-14 11:43:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:31,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-14 11:43:31,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:31,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:31,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:31,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366894397] [2021-12-14 11:43:31,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366894397] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:31,447 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:31,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-12-14 11:43:31,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102452879] [2021-12-14 11:43:31,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:31,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-14 11:43:31,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:31,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-14 11:43:31,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2021-12-14 11:43:31,449 INFO L87 Difference]: Start difference. First operand 834 states and 1084 transitions. Second operand has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 10 states have internal predecessors, (78), 4 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-14 11:43:32,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:32,587 INFO L93 Difference]: Finished difference Result 858 states and 1116 transitions. [2021-12-14 11:43:32,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-14 11:43:32,589 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 10 states have internal predecessors, (78), 4 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 93 [2021-12-14 11:43:32,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:32,593 INFO L225 Difference]: With dead ends: 858 [2021-12-14 11:43:32,593 INFO L226 Difference]: Without dead ends: 809 [2021-12-14 11:43:32,594 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=1134, Unknown=0, NotChecked=0, Total=1332 [2021-12-14 11:43:32,594 INFO L933 BasicCegarLoop]: 356 mSDtfsCounter, 330 mSDsluCounter, 3271 mSDsCounter, 0 mSdLazyCounter, 2119 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 3627 SdHoareTripleChecker+Invalid, 2212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 2119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:32,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [345 Valid, 3627 Invalid, 2212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 2119 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-14 11:43:32,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2021-12-14 11:43:32,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 306. [2021-12-14 11:43:32,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 242 states have (on average 1.1363636363636365) internal successors, (275), 247 states have internal predecessors, (275), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (48), 37 states have call predecessors, (48), 38 states have call successors, (48) [2021-12-14 11:43:32,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 364 transitions. [2021-12-14 11:43:32,626 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 364 transitions. Word has length 93 [2021-12-14 11:43:32,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:32,626 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 364 transitions. [2021-12-14 11:43:32,626 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 10 states have internal predecessors, (78), 4 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-14 11:43:32,626 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 364 transitions. [2021-12-14 11:43:32,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-12-14 11:43:32,628 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:32,628 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-14 11:43:32,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-12-14 11:43:32,628 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:32,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:32,629 INFO L85 PathProgramCache]: Analyzing trace with hash 46403579, now seen corresponding path program 1 times [2021-12-14 11:43:32,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:32,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024364602] [2021-12-14 11:43:32,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:32,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:32,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-14 11:43:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:32,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 11:43:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:32,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 11:43:32,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:32,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 11:43:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:32,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-14 11:43:32,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:32,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-14 11:43:32,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:32,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 11:43:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:32,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 11:43:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:32,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-14 11:43:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:32,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-14 11:43:32,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:32,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 11:43:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:32,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 11:43:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:32,742 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-12-14 11:43:32,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:32,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024364602] [2021-12-14 11:43:32,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024364602] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 11:43:32,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989895297] [2021-12-14 11:43:32,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:32,743 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 11:43:32,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:43:32,750 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) [2021-12-14 11:43:32,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 11:43:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:32,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 11:43:32,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 11:43:33,279 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 11:43:33,279 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 11:43:33,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989895297] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:33,280 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 11:43:33,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2021-12-14 11:43:33,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319835031] [2021-12-14 11:43:33,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:33,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 11:43:33,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:33,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 11:43:33,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-12-14 11:43:33,281 INFO L87 Difference]: Start difference. First operand 306 states and 364 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-14 11:43:33,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:33,363 INFO L93 Difference]: Finished difference Result 513 states and 620 transitions. [2021-12-14 11:43:33,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 11:43:33,363 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 133 [2021-12-14 11:43:33,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:33,365 INFO L225 Difference]: With dead ends: 513 [2021-12-14 11:43:33,365 INFO L226 Difference]: Without dead ends: 327 [2021-12-14 11:43:33,366 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-12-14 11:43:33,366 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 12 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:33,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 720 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:43:33,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-12-14 11:43:33,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 322. [2021-12-14 11:43:33,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 256 states have (on average 1.12890625) internal successors, (289), 262 states have internal predecessors, (289), 41 states have call successors, (41), 21 states have call predecessors, (41), 24 states have return successors, (55), 38 states have call predecessors, (55), 38 states have call successors, (55) [2021-12-14 11:43:33,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 385 transitions. [2021-12-14 11:43:33,440 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 385 transitions. Word has length 133 [2021-12-14 11:43:33,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:33,440 INFO L470 AbstractCegarLoop]: Abstraction has 322 states and 385 transitions. [2021-12-14 11:43:33,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-14 11:43:33,440 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 385 transitions. [2021-12-14 11:43:33,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-12-14 11:43:33,450 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:33,450 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-14 11:43:33,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 11:43:33,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2021-12-14 11:43:33,651 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:33,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:33,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1067504510, now seen corresponding path program 1 times [2021-12-14 11:43:33,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:33,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147163300] [2021-12-14 11:43:33,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:33,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:33,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:33,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-14 11:43:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:33,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 11:43:33,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:33,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 11:43:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:33,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 11:43:33,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:33,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-14 11:43:33,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:33,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-14 11:43:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:33,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 11:43:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:33,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 11:43:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:33,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-14 11:43:33,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:33,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-14 11:43:33,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:33,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 11:43:33,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:33,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 11:43:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:33,784 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-12-14 11:43:33,784 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:33,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147163300] [2021-12-14 11:43:33,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147163300] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:33,785 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:33,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-14 11:43:33,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99348580] [2021-12-14 11:43:33,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:33,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 11:43:33,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:33,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 11:43:33,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-14 11:43:33,786 INFO L87 Difference]: Start difference. First operand 322 states and 385 transitions. Second operand has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2021-12-14 11:43:34,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:34,148 INFO L93 Difference]: Finished difference Result 534 states and 639 transitions. [2021-12-14 11:43:34,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 11:43:34,148 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 134 [2021-12-14 11:43:34,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:34,150 INFO L225 Difference]: With dead ends: 534 [2021-12-14 11:43:34,150 INFO L226 Difference]: Without dead ends: 362 [2021-12-14 11:43:34,151 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-12-14 11:43:34,151 INFO L933 BasicCegarLoop]: 192 mSDtfsCounter, 124 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:34,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 1184 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 11:43:34,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2021-12-14 11:43:34,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 315. [2021-12-14 11:43:34,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 251 states have (on average 1.1155378486055776) internal successors, (280), 256 states have internal predecessors, (280), 39 states have call successors, (39), 21 states have call predecessors, (39), 24 states have return successors, (51), 37 states have call predecessors, (51), 36 states have call successors, (51) [2021-12-14 11:43:34,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 370 transitions. [2021-12-14 11:43:34,181 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 370 transitions. Word has length 134 [2021-12-14 11:43:34,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:34,181 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 370 transitions. [2021-12-14 11:43:34,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2021-12-14 11:43:34,181 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 370 transitions. [2021-12-14 11:43:34,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-12-14 11:43:34,183 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:34,183 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2021-12-14 11:43:34,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-12-14 11:43:34,183 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:34,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:34,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1031777441, now seen corresponding path program 1 times [2021-12-14 11:43:34,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:34,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440971372] [2021-12-14 11:43:34,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:34,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-14 11:43:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 11:43:34,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 11:43:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 11:43:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-14 11:43:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-14 11:43:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 11:43:34,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 11:43:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-14 11:43:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-14 11:43:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 11:43:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 11:43:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-12-14 11:43:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-14 11:43:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 11:43:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 11:43:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,335 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2021-12-14 11:43:34,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:34,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440971372] [2021-12-14 11:43:34,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440971372] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:34,336 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:34,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-14 11:43:34,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155985811] [2021-12-14 11:43:34,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:34,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 11:43:34,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:34,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 11:43:34,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-14 11:43:34,337 INFO L87 Difference]: Start difference. First operand 315 states and 370 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2021-12-14 11:43:34,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:34,712 INFO L93 Difference]: Finished difference Result 384 states and 451 transitions. [2021-12-14 11:43:34,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 11:43:34,713 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 170 [2021-12-14 11:43:34,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:34,735 INFO L225 Difference]: With dead ends: 384 [2021-12-14 11:43:34,735 INFO L226 Difference]: Without dead ends: 317 [2021-12-14 11:43:34,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-12-14 11:43:34,736 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 91 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:34,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 1087 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 11:43:34,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-12-14 11:43:34,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 217. [2021-12-14 11:43:34,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 176 states have (on average 1.1136363636363635) internal successors, (196), 178 states have internal predecessors, (196), 24 states have call successors, (24), 14 states have call predecessors, (24), 16 states have return successors, (30), 24 states have call predecessors, (30), 22 states have call successors, (30) [2021-12-14 11:43:34,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 250 transitions. [2021-12-14 11:43:34,758 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 250 transitions. Word has length 170 [2021-12-14 11:43:34,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:34,759 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 250 transitions. [2021-12-14 11:43:34,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2021-12-14 11:43:34,759 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 250 transitions. [2021-12-14 11:43:34,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-12-14 11:43:34,761 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:34,761 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2021-12-14 11:43:34,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-12-14 11:43:34,762 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:34,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:34,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1337713774, now seen corresponding path program 1 times [2021-12-14 11:43:34,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:34,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567231894] [2021-12-14 11:43:34,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:34,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:34,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-14 11:43:34,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-14 11:43:34,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 11:43:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 11:43:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-14 11:43:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-14 11:43:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 11:43:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 11:43:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-14 11:43:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-14 11:43:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 11:43:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 11:43:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-12-14 11:43:34,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-14 11:43:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-14 11:43:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-14 11:43:34,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,937 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2021-12-14 11:43:34,938 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:34,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567231894] [2021-12-14 11:43:34,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567231894] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:34,938 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:34,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-14 11:43:34,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420233824] [2021-12-14 11:43:34,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:34,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 11:43:34,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:34,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 11:43:34,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-14 11:43:34,939 INFO L87 Difference]: Start difference. First operand 217 states and 250 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2021-12-14 11:43:35,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:35,220 INFO L93 Difference]: Finished difference Result 223 states and 259 transitions. [2021-12-14 11:43:35,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 11:43:35,221 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 173 [2021-12-14 11:43:35,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:35,222 INFO L225 Difference]: With dead ends: 223 [2021-12-14 11:43:35,222 INFO L226 Difference]: Without dead ends: 0 [2021-12-14 11:43:35,222 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-12-14 11:43:35,223 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 121 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:35,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 698 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:35,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-14 11:43:35,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-14 11:43:35,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:43:35,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-14 11:43:35,224 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 173 [2021-12-14 11:43:35,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:35,224 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-14 11:43:35,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2021-12-14 11:43:35,224 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-14 11:43:35,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-14 11:43:35,227 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-14 11:43:35,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-12-14 11:43:35,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.