./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.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/floppy_simpl4.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b15a3429ae983cb571408e453cffd56861eca4f5fc7e760aad97ad24a44474ad --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 11:43:24,172 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 11:43:24,203 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 11:43:24,242 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 11:43:24,243 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 11:43:24,246 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 11:43:24,247 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 11:43:24,250 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 11:43:24,251 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 11:43:24,256 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 11:43:24,256 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 11:43:24,257 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 11:43:24,258 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 11:43:24,260 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 11:43:24,261 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 11:43:24,265 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 11:43:24,265 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 11:43:24,266 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 11:43:24,268 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 11:43:24,271 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 11:43:24,274 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 11:43:24,275 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 11:43:24,276 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 11:43:24,277 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 11:43:24,280 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 11:43:24,281 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 11:43:24,282 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 11:43:24,282 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 11:43:24,283 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 11:43:24,284 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 11:43:24,284 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 11:43:24,285 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 11:43:24,286 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 11:43:24,286 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 11:43:24,287 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 11:43:24,287 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 11:43:24,288 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 11:43:24,288 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 11:43:24,288 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 11:43:24,289 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 11:43:24,289 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 11:43:24,290 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:24,317 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 11:43:24,317 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 11:43:24,318 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 11:43:24,318 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 11:43:24,318 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 11:43:24,319 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 11:43:24,319 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 11:43:24,319 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 11:43:24,319 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 11:43:24,319 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 11:43:24,320 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 11:43:24,320 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 11:43:24,320 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 11:43:24,321 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 11:43:24,321 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 11:43:24,321 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 11:43:24,321 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 11:43:24,321 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 11:43:24,321 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 11:43:24,322 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 11:43:24,322 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 11:43:24,322 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 11:43:24,322 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 11:43:24,322 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 11:43:24,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 11:43:24,323 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 11:43:24,323 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 11:43:24,323 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 11:43:24,323 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 11:43:24,323 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 11:43:24,323 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 11:43:24,324 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 11:43:24,324 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 11:43:24,324 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 11:43:24,324 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 -> b15a3429ae983cb571408e453cffd56861eca4f5fc7e760aad97ad24a44474ad [2021-12-14 11:43:24,530 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 11:43:24,556 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 11:43:24,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 11:43:24,558 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 11:43:24,559 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 11:43:24,560 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c [2021-12-14 11:43:24,619 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/660650f92/058eaf67a18f482b830ad0d2f5a386a5/FLAG27c9684db [2021-12-14 11:43:24,989 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 11:43:24,996 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c [2021-12-14 11:43:25,008 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/660650f92/058eaf67a18f482b830ad0d2f5a386a5/FLAG27c9684db [2021-12-14 11:43:25,024 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/660650f92/058eaf67a18f482b830ad0d2f5a386a5 [2021-12-14 11:43:25,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 11:43:25,026 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 11:43:25,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 11:43:25,028 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 11:43:25,030 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 11:43:25,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:43:25" (1/1) ... [2021-12-14 11:43:25,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43b80b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:25, skipping insertion in model container [2021-12-14 11:43:25,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:43:25" (1/1) ... [2021-12-14 11:43:25,042 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 11:43:25,094 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 11:43:25,322 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c[48585,48598] [2021-12-14 11:43:25,332 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 11:43:25,339 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 11:43:25,436 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c[48585,48598] [2021-12-14 11:43:25,437 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 11:43:25,447 INFO L208 MainTranslator]: Completed translation [2021-12-14 11:43:25,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:25 WrapperNode [2021-12-14 11:43:25,447 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 11:43:25,448 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 11:43:25,448 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 11:43:25,448 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 11:43:25,453 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:25" (1/1) ... [2021-12-14 11:43:25,465 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:25" (1/1) ... [2021-12-14 11:43:25,523 INFO L137 Inliner]: procedures = 41, calls = 76, calls flagged for inlining = 21, calls inlined = 21, statements flattened = 1331 [2021-12-14 11:43:25,524 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 11:43:25,524 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 11:43:25,524 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 11:43:25,524 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 11:43:25,532 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:25" (1/1) ... [2021-12-14 11:43:25,532 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:25" (1/1) ... [2021-12-14 11:43:25,550 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:25" (1/1) ... [2021-12-14 11:43:25,550 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:25" (1/1) ... [2021-12-14 11:43:25,565 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:25" (1/1) ... [2021-12-14 11:43:25,577 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:25" (1/1) ... [2021-12-14 11:43:25,581 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:25" (1/1) ... [2021-12-14 11:43:25,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 11:43:25,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 11:43:25,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 11:43:25,610 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 11:43:25,623 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:25" (1/1) ... [2021-12-14 11:43:25,635 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 11:43:25,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 11:43:25,673 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:25,685 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:25,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 11:43:25,708 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2021-12-14 11:43:25,709 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2021-12-14 11:43:25,709 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2021-12-14 11:43:25,709 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2021-12-14 11:43:25,709 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2021-12-14 11:43:25,709 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2021-12-14 11:43:25,709 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2021-12-14 11:43:25,710 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2021-12-14 11:43:25,710 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2021-12-14 11:43:25,710 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2021-12-14 11:43:25,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 11:43:25,710 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2021-12-14 11:43:25,710 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2021-12-14 11:43:25,711 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2021-12-14 11:43:25,711 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2021-12-14 11:43:25,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 11:43:25,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 11:43:25,968 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 11:43:25,969 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 11:43:25,975 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-14 11:43:26,046 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2021-12-14 11:43:26,046 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2021-12-14 11:43:26,047 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-14 11:43:26,069 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-12-14 11:43:26,069 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-12-14 11:43:26,076 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-14 11:43:26,080 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-14 11:43:26,085 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-14 11:43:26,086 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-14 11:43:26,088 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-14 11:43:26,089 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-14 11:43:26,091 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-14 11:43:26,494 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##170: assume !false; [2021-12-14 11:43:26,494 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##180: assume false; [2021-12-14 11:43:26,494 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##181: assume !false; [2021-12-14 11:43:26,494 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##67: assume !false; [2021-12-14 11:43:26,495 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##66: assume false; [2021-12-14 11:43:26,495 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##127: assume !false; [2021-12-14 11:43:26,495 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##139: assume false; [2021-12-14 11:43:26,495 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##140: assume !false; [2021-12-14 11:43:26,495 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2021-12-14 11:43:26,495 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2021-12-14 11:43:26,495 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##169: assume false; [2021-12-14 11:43:26,495 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##236: assume !false; [2021-12-14 11:43:26,496 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##235: assume false; [2021-12-14 11:43:26,496 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##126: assume false; [2021-12-14 11:43:26,496 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-14 11:43:26,527 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2021-12-14 11:43:26,527 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2021-12-14 11:43:26,528 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-14 11:43:26,528 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-14 11:43:26,528 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-14 11:43:26,553 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume !false; [2021-12-14 11:43:26,554 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume !false; [2021-12-14 11:43:26,554 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##23: assume false; [2021-12-14 11:43:26,554 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume false; [2021-12-14 11:43:26,555 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2021-12-14 11:43:26,555 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2021-12-14 11:43:26,568 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 11:43:26,580 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 11:43:26,580 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-14 11:43:26,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:43:26 BoogieIcfgContainer [2021-12-14 11:43:26,584 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 11:43:26,585 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 11:43:26,585 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 11:43:26,588 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 11:43:26,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 11:43:25" (1/3) ... [2021-12-14 11:43:26,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a36453d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:43:26, skipping insertion in model container [2021-12-14 11:43:26,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:43:25" (2/3) ... [2021-12-14 11:43:26,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a36453d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:43:26, skipping insertion in model container [2021-12-14 11:43:26,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:43:26" (3/3) ... [2021-12-14 11:43:26,590 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.c [2021-12-14 11:43:26,597 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 11:43:26,597 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 11:43:26,659 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 11:43:26,665 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:26,665 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 11:43:26,689 INFO L276 IsEmpty]: Start isEmpty. Operand has 318 states, 259 states have (on average 1.5212355212355213) internal successors, (394), 284 states have internal predecessors, (394), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 45 states have call predecessors, (50), 50 states have call successors, (50) [2021-12-14 11:43:26,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-14 11:43:26,693 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:26,694 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:26,694 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:26,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:26,698 INFO L85 PathProgramCache]: Analyzing trace with hash -581881369, now seen corresponding path program 1 times [2021-12-14 11:43:26,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:26,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796498155] [2021-12-14 11:43:26,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:26,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:26,898 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,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:26,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796498155] [2021-12-14 11:43:26,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796498155] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:26,899 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:26,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:43:26,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251202586] [2021-12-14 11:43:26,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:26,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:43:26,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:26,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:43:26,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:43:26,932 INFO L87 Difference]: Start difference. First operand has 318 states, 259 states have (on average 1.5212355212355213) internal successors, (394), 284 states have internal predecessors, (394), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 45 states have call predecessors, (50), 50 states have call successors, (50) 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:27,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:27,024 INFO L93 Difference]: Finished difference Result 511 states and 794 transitions. [2021-12-14 11:43:27,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:43:27,026 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:27,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:27,034 INFO L225 Difference]: With dead ends: 511 [2021-12-14 11:43:27,034 INFO L226 Difference]: Without dead ends: 310 [2021-12-14 11:43:27,039 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:27,041 INFO L933 BasicCegarLoop]: 466 mSDtfsCounter, 261 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:27,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 629 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:43:27,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-12-14 11:43:27,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2021-12-14 11:43:27,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 253 states have (on average 1.4782608695652173) internal successors, (374), 276 states have internal predecessors, (374), 50 states have call successors, (50), 7 states have call predecessors, (50), 6 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2021-12-14 11:43:27,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 453 transitions. [2021-12-14 11:43:27,087 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 453 transitions. Word has length 13 [2021-12-14 11:43:27,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:27,087 INFO L470 AbstractCegarLoop]: Abstraction has 310 states and 453 transitions. [2021-12-14 11:43:27,087 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:27,087 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 453 transitions. [2021-12-14 11:43:27,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 11:43:27,088 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:27,088 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:27,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 11:43:27,088 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:27,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:27,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1536856865, now seen corresponding path program 1 times [2021-12-14 11:43:27,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:27,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399965411] [2021-12-14 11:43:27,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:27,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:27,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:27,129 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,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:27,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399965411] [2021-12-14 11:43:27,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399965411] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:27,130 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:27,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:43:27,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074306773] [2021-12-14 11:43:27,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:27,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:43:27,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:27,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:43:27,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:43:27,132 INFO L87 Difference]: Start difference. First operand 310 states and 453 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, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:43:27,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:27,299 INFO L93 Difference]: Finished difference Result 558 states and 805 transitions. [2021-12-14 11:43:27,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:43:27,299 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, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-14 11:43:27,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:27,305 INFO L225 Difference]: With dead ends: 558 [2021-12-14 11:43:27,305 INFO L226 Difference]: Without dead ends: 428 [2021-12-14 11:43:27,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:43:27,313 INFO L933 BasicCegarLoop]: 560 mSDtfsCounter, 359 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:27,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [359 Valid, 752 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:43:27,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2021-12-14 11:43:27,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 411. [2021-12-14 11:43:27,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 353 states have (on average 1.4022662889518414) internal successors, (495), 356 states have internal predecessors, (495), 48 states have call successors, (48), 11 states have call predecessors, (48), 9 states have return successors, (52), 44 states have call predecessors, (52), 37 states have call successors, (52) [2021-12-14 11:43:27,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 595 transitions. [2021-12-14 11:43:27,344 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 595 transitions. Word has length 16 [2021-12-14 11:43:27,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:27,344 INFO L470 AbstractCegarLoop]: Abstraction has 411 states and 595 transitions. [2021-12-14 11:43:27,344 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, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:43:27,344 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 595 transitions. [2021-12-14 11:43:27,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-14 11:43:27,345 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:27,345 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:27,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 11:43:27,346 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:27,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:27,346 INFO L85 PathProgramCache]: Analyzing trace with hash -866854987, now seen corresponding path program 1 times [2021-12-14 11:43:27,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:27,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445007090] [2021-12-14 11:43:27,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:27,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:27,406 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,407 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:27,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445007090] [2021-12-14 11:43:27,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445007090] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:27,407 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:27,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:43:27,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668076189] [2021-12-14 11:43:27,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:27,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:43:27,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:27,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:43:27,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:43:27,408 INFO L87 Difference]: Start difference. First operand 411 states and 595 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:43:27,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:27,454 INFO L93 Difference]: Finished difference Result 516 states and 730 transitions. [2021-12-14 11:43:27,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:43:27,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-14 11:43:27,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:27,456 INFO L225 Difference]: With dead ends: 516 [2021-12-14 11:43:27,456 INFO L226 Difference]: Without dead ends: 497 [2021-12-14 11:43:27,457 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:27,457 INFO L933 BasicCegarLoop]: 437 mSDtfsCounter, 407 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:27,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [407 Valid, 540 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:43:27,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2021-12-14 11:43:27,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 459. [2021-12-14 11:43:27,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 394 states have (on average 1.3959390862944163) internal successors, (550), 404 states have internal predecessors, (550), 50 states have call successors, (50), 14 states have call predecessors, (50), 14 states have return successors, (59), 43 states have call predecessors, (59), 41 states have call successors, (59) [2021-12-14 11:43:27,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 659 transitions. [2021-12-14 11:43:27,500 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 659 transitions. Word has length 19 [2021-12-14 11:43:27,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:27,501 INFO L470 AbstractCegarLoop]: Abstraction has 459 states and 659 transitions. [2021-12-14 11:43:27,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:43:27,501 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 659 transitions. [2021-12-14 11:43:27,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-14 11:43:27,502 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:27,502 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:27,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 11:43:27,502 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:27,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:27,510 INFO L85 PathProgramCache]: Analyzing trace with hash 122564178, now seen corresponding path program 1 times [2021-12-14 11:43:27,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:27,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988325487] [2021-12-14 11:43:27,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:27,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:27,549 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,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:27,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988325487] [2021-12-14 11:43:27,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988325487] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:27,550 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:27,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:43:27,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467607228] [2021-12-14 11:43:27,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:27,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:43:27,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:27,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:43:27,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:43:27,551 INFO L87 Difference]: Start difference. First operand 459 states and 659 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:43:27,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:27,576 INFO L93 Difference]: Finished difference Result 861 states and 1224 transitions. [2021-12-14 11:43:27,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:43:27,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-14 11:43:27,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:27,579 INFO L225 Difference]: With dead ends: 861 [2021-12-14 11:43:27,579 INFO L226 Difference]: Without dead ends: 638 [2021-12-14 11:43:27,580 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:27,581 INFO L933 BasicCegarLoop]: 494 mSDtfsCounter, 394 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:27,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [394 Valid, 655 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:43:27,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2021-12-14 11:43:27,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 613. [2021-12-14 11:43:27,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 531 states have (on average 1.384180790960452) internal successors, (735), 538 states have internal predecessors, (735), 60 states have call successors, (60), 22 states have call predecessors, (60), 21 states have return successors, (80), 55 states have call predecessors, (80), 53 states have call successors, (80) [2021-12-14 11:43:27,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 875 transitions. [2021-12-14 11:43:27,604 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 875 transitions. Word has length 22 [2021-12-14 11:43:27,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:27,604 INFO L470 AbstractCegarLoop]: Abstraction has 613 states and 875 transitions. [2021-12-14 11:43:27,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:43:27,604 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 875 transitions. [2021-12-14 11:43:27,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 11:43:27,605 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:27,605 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:27,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 11:43:27,606 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:27,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:27,606 INFO L85 PathProgramCache]: Analyzing trace with hash -278451968, now seen corresponding path program 1 times [2021-12-14 11:43:27,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:27,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411638681] [2021-12-14 11:43:27,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:27,606 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:27,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 11:43:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:27,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 11:43:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:27,663 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,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:27,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411638681] [2021-12-14 11:43:27,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411638681] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:27,664 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:27,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 11:43:27,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129057177] [2021-12-14 11:43:27,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:27,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 11:43:27,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:27,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 11:43:27,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-14 11:43:27,666 INFO L87 Difference]: Start difference. First operand 613 states and 875 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 11:43:27,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:27,914 INFO L93 Difference]: Finished difference Result 674 states and 955 transitions. [2021-12-14 11:43:27,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 11:43:27,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2021-12-14 11:43:27,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:27,919 INFO L225 Difference]: With dead ends: 674 [2021-12-14 11:43:27,919 INFO L226 Difference]: Without dead ends: 669 [2021-12-14 11:43:27,919 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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:27,920 INFO L933 BasicCegarLoop]: 422 mSDtfsCounter, 188 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:27,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 996 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:27,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2021-12-14 11:43:27,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 648. [2021-12-14 11:43:27,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 564 states have (on average 1.375886524822695) internal successors, (776), 571 states have internal predecessors, (776), 60 states have call successors, (60), 22 states have call predecessors, (60), 23 states have return successors, (85), 55 states have call predecessors, (85), 53 states have call successors, (85) [2021-12-14 11:43:27,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 921 transitions. [2021-12-14 11:43:27,946 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 921 transitions. Word has length 30 [2021-12-14 11:43:27,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:27,946 INFO L470 AbstractCegarLoop]: Abstraction has 648 states and 921 transitions. [2021-12-14 11:43:27,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 11:43:27,947 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 921 transitions. [2021-12-14 11:43:27,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-14 11:43:27,950 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:27,950 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:27,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 11:43:27,951 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:27,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:27,952 INFO L85 PathProgramCache]: Analyzing trace with hash 935646203, now seen corresponding path program 1 times [2021-12-14 11:43:27,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:27,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432971960] [2021-12-14 11:43:27,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:27,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:27,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:28,005 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,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:28,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432971960] [2021-12-14 11:43:28,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432971960] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:28,006 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:28,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:43:28,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726605220] [2021-12-14 11:43:28,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:28,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:43:28,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:28,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:43:28,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:43:28,008 INFO L87 Difference]: Start difference. First operand 648 states and 921 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (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:28,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:28,075 INFO L93 Difference]: Finished difference Result 663 states and 941 transitions. [2021-12-14 11:43:28,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:43:28,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-14 11:43:28,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:28,079 INFO L225 Difference]: With dead ends: 663 [2021-12-14 11:43:28,079 INFO L226 Difference]: Without dead ends: 660 [2021-12-14 11:43:28,079 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:28,081 INFO L933 BasicCegarLoop]: 420 mSDtfsCounter, 20 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:28,083 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 778 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:43:28,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2021-12-14 11:43:28,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 659. [2021-12-14 11:43:28,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 575 states have (on average 1.373913043478261) internal successors, (790), 581 states have internal predecessors, (790), 60 states have call successors, (60), 23 states have call predecessors, (60), 23 states have return successors, (85), 55 states have call predecessors, (85), 53 states have call successors, (85) [2021-12-14 11:43:28,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 935 transitions. [2021-12-14 11:43:28,111 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 935 transitions. Word has length 28 [2021-12-14 11:43:28,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:28,111 INFO L470 AbstractCegarLoop]: Abstraction has 659 states and 935 transitions. [2021-12-14 11:43:28,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (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:28,112 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 935 transitions. [2021-12-14 11:43:28,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 11:43:28,112 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:28,113 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:28,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 11:43:28,113 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:28,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:28,113 INFO L85 PathProgramCache]: Analyzing trace with hash -525593641, now seen corresponding path program 1 times [2021-12-14 11:43:28,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:28,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298844651] [2021-12-14 11:43:28,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:28,114 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:28,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 11:43:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:28,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 11:43:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:28,231 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,231 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:28,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298844651] [2021-12-14 11:43:28,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298844651] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:28,232 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:28,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 11:43:28,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117656804] [2021-12-14 11:43:28,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:28,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 11:43:28,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:28,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 11:43:28,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-14 11:43:28,235 INFO L87 Difference]: Start difference. First operand 659 states and 935 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 11:43:28,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:28,527 INFO L93 Difference]: Finished difference Result 686 states and 968 transitions. [2021-12-14 11:43:28,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 11:43:28,528 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2021-12-14 11:43:28,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:28,532 INFO L225 Difference]: With dead ends: 686 [2021-12-14 11:43:28,533 INFO L226 Difference]: Without dead ends: 680 [2021-12-14 11:43:28,534 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-12-14 11:43:28,536 INFO L933 BasicCegarLoop]: 420 mSDtfsCounter, 681 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:28,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [695 Valid, 948 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:28,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2021-12-14 11:43:28,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 659. [2021-12-14 11:43:28,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 575 states have (on average 1.3721739130434782) internal successors, (789), 581 states have internal predecessors, (789), 60 states have call successors, (60), 23 states have call predecessors, (60), 23 states have return successors, (85), 55 states have call predecessors, (85), 53 states have call successors, (85) [2021-12-14 11:43:28,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 934 transitions. [2021-12-14 11:43:28,574 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 934 transitions. Word has length 30 [2021-12-14 11:43:28,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:28,574 INFO L470 AbstractCegarLoop]: Abstraction has 659 states and 934 transitions. [2021-12-14 11:43:28,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 11:43:28,575 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 934 transitions. [2021-12-14 11:43:28,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-14 11:43:28,577 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:28,578 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:28,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 11:43:28,578 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:28,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:28,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1034674387, now seen corresponding path program 1 times [2021-12-14 11:43:28,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:28,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238371421] [2021-12-14 11:43:28,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:28,579 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:28,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 11:43:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:28,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 11:43:28,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:28,679 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,679 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:28,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238371421] [2021-12-14 11:43:28,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238371421] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:28,679 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:28,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 11:43:28,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372410845] [2021-12-14 11:43:28,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:28,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 11:43:28,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:28,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 11:43:28,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-14 11:43:28,681 INFO L87 Difference]: Start difference. First operand 659 states and 934 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 11:43:28,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:28,991 INFO L93 Difference]: Finished difference Result 686 states and 967 transitions. [2021-12-14 11:43:28,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 11:43:28,992 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2021-12-14 11:43:28,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:28,995 INFO L225 Difference]: With dead ends: 686 [2021-12-14 11:43:28,995 INFO L226 Difference]: Without dead ends: 680 [2021-12-14 11:43:28,995 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-12-14 11:43:28,996 INFO L933 BasicCegarLoop]: 422 mSDtfsCounter, 597 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:28,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [611 Valid, 1201 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:28,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2021-12-14 11:43:29,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 659. [2021-12-14 11:43:29,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 575 states have (on average 1.3704347826086956) internal successors, (788), 581 states have internal predecessors, (788), 60 states have call successors, (60), 23 states have call predecessors, (60), 23 states have return successors, (85), 55 states have call predecessors, (85), 53 states have call successors, (85) [2021-12-14 11:43:29,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 933 transitions. [2021-12-14 11:43:29,020 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 933 transitions. Word has length 32 [2021-12-14 11:43:29,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:29,020 INFO L470 AbstractCegarLoop]: Abstraction has 659 states and 933 transitions. [2021-12-14 11:43:29,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 11:43:29,021 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 933 transitions. [2021-12-14 11:43:29,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-14 11:43:29,021 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:29,022 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] [2021-12-14 11:43:29,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 11:43:29,022 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:29,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:29,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1926147241, now seen corresponding path program 1 times [2021-12-14 11:43:29,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:29,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456337720] [2021-12-14 11:43:29,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:29,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:29,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-14 11:43:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:29,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 11:43:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:29,074 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,074 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:29,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456337720] [2021-12-14 11:43:29,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456337720] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:29,075 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:29,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 11:43:29,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054858542] [2021-12-14 11:43:29,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:29,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 11:43:29,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:29,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 11:43:29,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 11:43:29,076 INFO L87 Difference]: Start difference. First operand 659 states and 933 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 11:43:29,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:29,317 INFO L93 Difference]: Finished difference Result 691 states and 972 transitions. [2021-12-14 11:43:29,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 11:43:29,317 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2021-12-14 11:43:29,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:29,320 INFO L225 Difference]: With dead ends: 691 [2021-12-14 11:43:29,320 INFO L226 Difference]: Without dead ends: 676 [2021-12-14 11:43:29,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-14 11:43:29,321 INFO L933 BasicCegarLoop]: 430 mSDtfsCounter, 322 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 1758 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:29,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [351 Valid, 1758 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:29,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2021-12-14 11:43:29,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 657. [2021-12-14 11:43:29,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 574 states have (on average 1.3693379790940767) internal successors, (786), 580 states have internal predecessors, (786), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (84), 54 states have call predecessors, (84), 52 states have call successors, (84) [2021-12-14 11:43:29,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 929 transitions. [2021-12-14 11:43:29,344 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 929 transitions. Word has length 33 [2021-12-14 11:43:29,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:29,344 INFO L470 AbstractCegarLoop]: Abstraction has 657 states and 929 transitions. [2021-12-14 11:43:29,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 11:43:29,344 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 929 transitions. [2021-12-14 11:43:29,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-14 11:43:29,345 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:29,345 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:29,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 11:43:29,346 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:29,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:29,346 INFO L85 PathProgramCache]: Analyzing trace with hash 898874144, now seen corresponding path program 1 times [2021-12-14 11:43:29,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:29,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857790160] [2021-12-14 11:43:29,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:29,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:29,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 11:43:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:29,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 11:43:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:29,389 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,389 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:29,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857790160] [2021-12-14 11:43:29,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857790160] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:29,390 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:29,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 11:43:29,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545823882] [2021-12-14 11:43:29,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:29,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 11:43:29,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:29,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 11:43:29,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 11:43:29,391 INFO L87 Difference]: Start difference. First operand 657 states and 929 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 11:43:29,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:29,598 INFO L93 Difference]: Finished difference Result 689 states and 968 transitions. [2021-12-14 11:43:29,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 11:43:29,599 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2021-12-14 11:43:29,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:29,601 INFO L225 Difference]: With dead ends: 689 [2021-12-14 11:43:29,601 INFO L226 Difference]: Without dead ends: 669 [2021-12-14 11:43:29,602 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-14 11:43:29,602 INFO L933 BasicCegarLoop]: 419 mSDtfsCounter, 394 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1464 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:29,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [422 Valid, 1464 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:29,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2021-12-14 11:43:29,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 650. [2021-12-14 11:43:29,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 570 states have (on average 1.3701754385964913) internal successors, (781), 576 states have internal predecessors, (781), 57 states have call successors, (57), 22 states have call predecessors, (57), 22 states have return successors, (82), 52 states have call predecessors, (82), 50 states have call successors, (82) [2021-12-14 11:43:29,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 920 transitions. [2021-12-14 11:43:29,624 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 920 transitions. Word has length 32 [2021-12-14 11:43:29,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:29,625 INFO L470 AbstractCegarLoop]: Abstraction has 650 states and 920 transitions. [2021-12-14 11:43:29,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 11:43:29,625 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 920 transitions. [2021-12-14 11:43:29,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 11:43:29,626 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:29,627 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:29,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-14 11:43:29,627 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:29,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:29,628 INFO L85 PathProgramCache]: Analyzing trace with hash -608614915, now seen corresponding path program 1 times [2021-12-14 11:43:29,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:29,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416280609] [2021-12-14 11:43:29,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:29,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:29,655 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,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:29,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416280609] [2021-12-14 11:43:29,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416280609] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:29,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:29,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:43:29,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559978352] [2021-12-14 11:43:29,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:29,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:43:29,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:29,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:43:29,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:43:29,658 INFO L87 Difference]: Start difference. First operand 650 states and 920 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:29,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:29,683 INFO L93 Difference]: Finished difference Result 691 states and 968 transitions. [2021-12-14 11:43:29,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:43:29,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 30 [2021-12-14 11:43:29,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:29,686 INFO L225 Difference]: With dead ends: 691 [2021-12-14 11:43:29,686 INFO L226 Difference]: Without dead ends: 625 [2021-12-14 11:43:29,687 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:29,687 INFO L933 BasicCegarLoop]: 483 mSDtfsCounter, 84 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:29,688 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 880 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:43:29,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2021-12-14 11:43:29,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 621. [2021-12-14 11:43:29,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 545 states have (on average 1.3688073394495412) internal successors, (746), 552 states have internal predecessors, (746), 55 states have call successors, (55), 21 states have call predecessors, (55), 20 states have return successors, (78), 48 states have call predecessors, (78), 48 states have call successors, (78) [2021-12-14 11:43:29,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 879 transitions. [2021-12-14 11:43:29,708 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 879 transitions. Word has length 30 [2021-12-14 11:43:29,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:29,709 INFO L470 AbstractCegarLoop]: Abstraction has 621 states and 879 transitions. [2021-12-14 11:43:29,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:29,709 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 879 transitions. [2021-12-14 11:43:29,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 11:43:29,710 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:29,710 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:29,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 11:43:29,710 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:29,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:29,711 INFO L85 PathProgramCache]: Analyzing trace with hash -444205803, now seen corresponding path program 1 times [2021-12-14 11:43:29,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:29,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585976400] [2021-12-14 11:43:29,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:29,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:29,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:29,732 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,732 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:29,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585976400] [2021-12-14 11:43:29,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585976400] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:29,733 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:29,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 11:43:29,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588004293] [2021-12-14 11:43:29,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:29,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 11:43:29,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:29,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 11:43:29,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 11:43:29,734 INFO L87 Difference]: Start difference. First operand 621 states and 879 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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:29,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:29,773 INFO L93 Difference]: Finished difference Result 657 states and 920 transitions. [2021-12-14 11:43:29,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 11:43:29,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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 30 [2021-12-14 11:43:29,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:29,776 INFO L225 Difference]: With dead ends: 657 [2021-12-14 11:43:29,776 INFO L226 Difference]: Without dead ends: 637 [2021-12-14 11:43:29,776 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:29,777 INFO L933 BasicCegarLoop]: 420 mSDtfsCounter, 27 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:29,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 1213 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:43:29,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2021-12-14 11:43:29,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 623. [2021-12-14 11:43:29,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 547 states have (on average 1.3674588665447898) internal successors, (748), 554 states have internal predecessors, (748), 55 states have call successors, (55), 21 states have call predecessors, (55), 20 states have return successors, (78), 48 states have call predecessors, (78), 48 states have call successors, (78) [2021-12-14 11:43:29,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 881 transitions. [2021-12-14 11:43:29,797 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 881 transitions. Word has length 30 [2021-12-14 11:43:29,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:29,797 INFO L470 AbstractCegarLoop]: Abstraction has 623 states and 881 transitions. [2021-12-14 11:43:29,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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:29,798 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 881 transitions. [2021-12-14 11:43:29,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-14 11:43:29,799 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:29,799 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:29,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-14 11:43:29,799 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:29,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:29,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1157172893, now seen corresponding path program 1 times [2021-12-14 11:43:29,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:29,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838094280] [2021-12-14 11:43:29,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:29,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:29,822 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,822 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:29,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838094280] [2021-12-14 11:43:29,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838094280] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:29,823 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:29,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 11:43:29,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219342165] [2021-12-14 11:43:29,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:29,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 11:43:29,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:29,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 11:43:29,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 11:43:29,824 INFO L87 Difference]: Start difference. First operand 623 states and 881 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:43:29,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:29,877 INFO L93 Difference]: Finished difference Result 659 states and 922 transitions. [2021-12-14 11:43:29,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 11:43:29,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-14 11:43:29,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:29,879 INFO L225 Difference]: With dead ends: 659 [2021-12-14 11:43:29,880 INFO L226 Difference]: Without dead ends: 639 [2021-12-14 11:43:29,880 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:29,880 INFO L933 BasicCegarLoop]: 423 mSDtfsCounter, 28 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:29,881 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 1217 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:43:29,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2021-12-14 11:43:29,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 623. [2021-12-14 11:43:29,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 547 states have (on average 1.3674588665447898) internal successors, (748), 554 states have internal predecessors, (748), 55 states have call successors, (55), 21 states have call predecessors, (55), 20 states have return successors, (78), 48 states have call predecessors, (78), 48 states have call successors, (78) [2021-12-14 11:43:29,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 881 transitions. [2021-12-14 11:43:29,900 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 881 transitions. Word has length 31 [2021-12-14 11:43:29,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:29,900 INFO L470 AbstractCegarLoop]: Abstraction has 623 states and 881 transitions. [2021-12-14 11:43:29,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 11:43:29,900 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 881 transitions. [2021-12-14 11:43:29,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-14 11:43:29,901 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:29,901 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:29,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-14 11:43:29,901 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:29,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:29,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1727959565, now seen corresponding path program 1 times [2021-12-14 11:43:29,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:29,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593154290] [2021-12-14 11:43:29,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:29,902 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:29,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 11:43:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:29,929 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,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:29,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593154290] [2021-12-14 11:43:29,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593154290] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:29,929 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:29,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 11:43:29,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655102974] [2021-12-14 11:43:29,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:29,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 11:43:29,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:29,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 11:43:29,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 11:43:29,930 INFO L87 Difference]: Start difference. First operand 623 states and 881 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:30,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:30,125 INFO L93 Difference]: Finished difference Result 884 states and 1250 transitions. [2021-12-14 11:43:30,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 11:43:30,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2021-12-14 11:43:30,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:30,129 INFO L225 Difference]: With dead ends: 884 [2021-12-14 11:43:30,129 INFO L226 Difference]: Without dead ends: 881 [2021-12-14 11:43:30,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 11:43:30,130 INFO L933 BasicCegarLoop]: 506 mSDtfsCounter, 162 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:30,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 1133 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:30,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2021-12-14 11:43:30,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 702. [2021-12-14 11:43:30,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 622 states have (on average 1.3762057877813505) internal successors, (856), 630 states have internal predecessors, (856), 57 states have call successors, (57), 23 states have call predecessors, (57), 22 states have return successors, (80), 49 states have call predecessors, (80), 50 states have call successors, (80) [2021-12-14 11:43:30,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 993 transitions. [2021-12-14 11:43:30,156 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 993 transitions. Word has length 34 [2021-12-14 11:43:30,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:30,156 INFO L470 AbstractCegarLoop]: Abstraction has 702 states and 993 transitions. [2021-12-14 11:43:30,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:30,157 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 993 transitions. [2021-12-14 11:43:30,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-14 11:43:30,157 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:30,157 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:30,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-14 11:43:30,158 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:30,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:30,158 INFO L85 PathProgramCache]: Analyzing trace with hash -2030213193, now seen corresponding path program 1 times [2021-12-14 11:43:30,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:30,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795195155] [2021-12-14 11:43:30,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:30,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:30,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-14 11:43:30,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:30,186 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:30,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:30,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795195155] [2021-12-14 11:43:30,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795195155] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:30,187 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:30,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 11:43:30,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149549837] [2021-12-14 11:43:30,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:30,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 11:43:30,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:30,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 11:43:30,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 11:43:30,188 INFO L87 Difference]: Start difference. First operand 702 states and 993 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 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:30,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:30,333 INFO L93 Difference]: Finished difference Result 733 states and 1030 transitions. [2021-12-14 11:43:30,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 11:43:30,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 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 33 [2021-12-14 11:43:30,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:30,336 INFO L225 Difference]: With dead ends: 733 [2021-12-14 11:43:30,336 INFO L226 Difference]: Without dead ends: 717 [2021-12-14 11:43:30,336 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:30,337 INFO L933 BasicCegarLoop]: 404 mSDtfsCounter, 85 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:30,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 1396 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:43:30,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2021-12-14 11:43:30,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 700. [2021-12-14 11:43:30,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 621 states have (on average 1.3752012882447664) internal successors, (854), 629 states have internal predecessors, (854), 56 states have call successors, (56), 23 states have call predecessors, (56), 22 states have return successors, (79), 48 states have call predecessors, (79), 49 states have call successors, (79) [2021-12-14 11:43:30,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 989 transitions. [2021-12-14 11:43:30,359 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 989 transitions. Word has length 33 [2021-12-14 11:43:30,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:30,359 INFO L470 AbstractCegarLoop]: Abstraction has 700 states and 989 transitions. [2021-12-14 11:43:30,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 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:30,359 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 989 transitions. [2021-12-14 11:43:30,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-14 11:43:30,360 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:30,360 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:30,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-14 11:43:30,361 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:30,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:30,361 INFO L85 PathProgramCache]: Analyzing trace with hash 2029473173, now seen corresponding path program 1 times [2021-12-14 11:43:30,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:30,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678649557] [2021-12-14 11:43:30,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:30,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:30,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:30,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 11:43:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:30,406 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:30,407 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:30,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678649557] [2021-12-14 11:43:30,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678649557] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:30,407 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:30,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 11:43:30,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028783715] [2021-12-14 11:43:30,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:30,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 11:43:30,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:30,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 11:43:30,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 11:43:30,409 INFO L87 Difference]: Start difference. First operand 700 states and 989 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:30,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:30,688 INFO L93 Difference]: Finished difference Result 1172 states and 1614 transitions. [2021-12-14 11:43:30,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 11:43:30,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-12-14 11:43:30,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:30,691 INFO L225 Difference]: With dead ends: 1172 [2021-12-14 11:43:30,691 INFO L226 Difference]: Without dead ends: 729 [2021-12-14 11:43:30,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-14 11:43:30,693 INFO L933 BasicCegarLoop]: 506 mSDtfsCounter, 721 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:30,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [739 Valid, 935 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:30,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2021-12-14 11:43:30,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 691. [2021-12-14 11:43:30,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 612 states have (on average 1.3611111111111112) internal successors, (833), 620 states have internal predecessors, (833), 56 states have call successors, (56), 23 states have call predecessors, (56), 22 states have return successors, (79), 48 states have call predecessors, (79), 49 states have call successors, (79) [2021-12-14 11:43:30,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 968 transitions. [2021-12-14 11:43:30,718 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 968 transitions. Word has length 35 [2021-12-14 11:43:30,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:30,718 INFO L470 AbstractCegarLoop]: Abstraction has 691 states and 968 transitions. [2021-12-14 11:43:30,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:30,718 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 968 transitions. [2021-12-14 11:43:30,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-14 11:43:30,719 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:30,719 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:30,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-14 11:43:30,719 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:30,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:30,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1933424636, now seen corresponding path program 1 times [2021-12-14 11:43:30,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:30,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720463314] [2021-12-14 11:43:30,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:30,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:30,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 11:43:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:30,755 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:30,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:30,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720463314] [2021-12-14 11:43:30,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720463314] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:30,755 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:30,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 11:43:30,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573915954] [2021-12-14 11:43:30,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:30,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 11:43:30,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:30,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 11:43:30,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 11:43:30,757 INFO L87 Difference]: Start difference. First operand 691 states and 968 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 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:30,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:30,889 INFO L93 Difference]: Finished difference Result 722 states and 1005 transitions. [2021-12-14 11:43:30,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 11:43:30,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 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:30,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:30,892 INFO L225 Difference]: With dead ends: 722 [2021-12-14 11:43:30,892 INFO L226 Difference]: Without dead ends: 706 [2021-12-14 11:43:30,892 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:30,893 INFO L933 BasicCegarLoop]: 400 mSDtfsCounter, 85 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1383 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:30,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 1383 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:43:30,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2021-12-14 11:43:30,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 689. [2021-12-14 11:43:30,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 611 states have (on average 1.3600654664484453) internal successors, (831), 619 states have internal predecessors, (831), 55 states have call successors, (55), 23 states have call predecessors, (55), 22 states have return successors, (78), 47 states have call predecessors, (78), 48 states have call successors, (78) [2021-12-14 11:43:30,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 964 transitions. [2021-12-14 11:43:30,917 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 964 transitions. Word has length 35 [2021-12-14 11:43:30,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:30,918 INFO L470 AbstractCegarLoop]: Abstraction has 689 states and 964 transitions. [2021-12-14 11:43:30,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 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:30,918 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 964 transitions. [2021-12-14 11:43:30,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-14 11:43:30,919 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:30,919 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:30,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-14 11:43:30,919 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:30,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:30,920 INFO L85 PathProgramCache]: Analyzing trace with hash 2075108197, now seen corresponding path program 1 times [2021-12-14 11:43:30,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:30,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023362628] [2021-12-14 11:43:30,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:30,920 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:30,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:30,963 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:30,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:30,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023362628] [2021-12-14 11:43:30,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023362628] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:30,963 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:30,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 11:43:30,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543645518] [2021-12-14 11:43:30,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:30,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 11:43:30,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:30,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 11:43:30,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 11:43:30,964 INFO L87 Difference]: Start difference. First operand 689 states and 964 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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:31,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:31,033 INFO L93 Difference]: Finished difference Result 1096 states and 1521 transitions. [2021-12-14 11:43:31,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 11:43:31,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 37 [2021-12-14 11:43:31,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:31,036 INFO L225 Difference]: With dead ends: 1096 [2021-12-14 11:43:31,036 INFO L226 Difference]: Without dead ends: 697 [2021-12-14 11:43:31,037 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:31,037 INFO L933 BasicCegarLoop]: 409 mSDtfsCounter, 5 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:31,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 766 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:43:31,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2021-12-14 11:43:31,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 697. [2021-12-14 11:43:31,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 619 states have (on average 1.3602584814216478) internal successors, (842), 627 states have internal predecessors, (842), 55 states have call successors, (55), 23 states have call predecessors, (55), 22 states have return successors, (78), 47 states have call predecessors, (78), 48 states have call successors, (78) [2021-12-14 11:43:31,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 975 transitions. [2021-12-14 11:43:31,063 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 975 transitions. Word has length 37 [2021-12-14 11:43:31,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:31,064 INFO L470 AbstractCegarLoop]: Abstraction has 697 states and 975 transitions. [2021-12-14 11:43:31,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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:31,064 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 975 transitions. [2021-12-14 11:43:31,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-14 11:43:31,065 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:31,065 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:31,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-14 11:43:31,065 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:31,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:31,066 INFO L85 PathProgramCache]: Analyzing trace with hash 657684690, now seen corresponding path program 1 times [2021-12-14 11:43:31,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:31,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811293736] [2021-12-14 11:43:31,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:31,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:31,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-14 11:43:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:31,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:31,111 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:31,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811293736] [2021-12-14 11:43:31,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811293736] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:31,111 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:31,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 11:43:31,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335550443] [2021-12-14 11:43:31,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:31,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 11:43:31,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:31,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 11:43:31,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 11:43:31,112 INFO L87 Difference]: Start difference. First operand 697 states and 975 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:31,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:31,286 INFO L93 Difference]: Finished difference Result 722 states and 1002 transitions. [2021-12-14 11:43:31,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 11:43:31,286 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:31,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:31,289 INFO L225 Difference]: With dead ends: 722 [2021-12-14 11:43:31,289 INFO L226 Difference]: Without dead ends: 704 [2021-12-14 11:43:31,290 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:31,290 INFO L933 BasicCegarLoop]: 403 mSDtfsCounter, 96 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 1705 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:31,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 1705 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:43:31,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2021-12-14 11:43:31,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 697. [2021-12-14 11:43:31,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 619 states have (on average 1.3408723747980613) internal successors, (830), 627 states have internal predecessors, (830), 55 states have call successors, (55), 23 states have call predecessors, (55), 22 states have return successors, (78), 47 states have call predecessors, (78), 48 states have call successors, (78) [2021-12-14 11:43:31,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 963 transitions. [2021-12-14 11:43:31,316 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 963 transitions. Word has length 38 [2021-12-14 11:43:31,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:31,316 INFO L470 AbstractCegarLoop]: Abstraction has 697 states and 963 transitions. [2021-12-14 11:43:31,316 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:31,316 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 963 transitions. [2021-12-14 11:43:31,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-14 11:43:31,317 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:31,317 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:31,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-14 11:43:31,318 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:31,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:31,318 INFO L85 PathProgramCache]: Analyzing trace with hash 101448372, now seen corresponding path program 1 times [2021-12-14 11:43:31,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:31,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317735991] [2021-12-14 11:43:31,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:31,319 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:31,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 11:43:31,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:31,355 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,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:31,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317735991] [2021-12-14 11:43:31,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317735991] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:31,356 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:31,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 11:43:31,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625351878] [2021-12-14 11:43:31,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:31,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 11:43:31,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:31,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 11:43:31,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-14 11:43:31,357 INFO L87 Difference]: Start difference. First operand 697 states and 963 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 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:31,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:31,660 INFO L93 Difference]: Finished difference Result 783 states and 1067 transitions. [2021-12-14 11:43:31,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 11:43:31,660 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 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:31,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:31,663 INFO L225 Difference]: With dead ends: 783 [2021-12-14 11:43:31,663 INFO L226 Difference]: Without dead ends: 717 [2021-12-14 11:43:31,664 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-12-14 11:43:31,664 INFO L933 BasicCegarLoop]: 378 mSDtfsCounter, 525 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 1399 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:31,664 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [537 Valid, 1399 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:31,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2021-12-14 11:43:31,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 707. [2021-12-14 11:43:31,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 626 states have (on average 1.3354632587859425) internal successors, (836), 637 states have internal predecessors, (836), 55 states have call successors, (55), 23 states have call predecessors, (55), 25 states have return successors, (82), 47 states have call predecessors, (82), 48 states have call successors, (82) [2021-12-14 11:43:31,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 973 transitions. [2021-12-14 11:43:31,696 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 973 transitions. Word has length 38 [2021-12-14 11:43:31,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:31,696 INFO L470 AbstractCegarLoop]: Abstraction has 707 states and 973 transitions. [2021-12-14 11:43:31,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 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:31,697 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 973 transitions. [2021-12-14 11:43:31,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-14 11:43:31,698 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:31,698 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:31,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-14 11:43:31,698 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:31,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:31,698 INFO L85 PathProgramCache]: Analyzing trace with hash 2119312611, now seen corresponding path program 1 times [2021-12-14 11:43:31,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:31,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695233703] [2021-12-14 11:43:31,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:31,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:31,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-14 11:43:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:31,737 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,737 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:31,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695233703] [2021-12-14 11:43:31,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695233703] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:31,737 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:31,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 11:43:31,737 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790247774] [2021-12-14 11:43:31,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:31,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 11:43:31,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:31,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 11:43:31,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 11:43:31,738 INFO L87 Difference]: Start difference. First operand 707 states and 973 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:31,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:31,916 INFO L93 Difference]: Finished difference Result 727 states and 993 transitions. [2021-12-14 11:43:31,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 11:43:31,916 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2021-12-14 11:43:31,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:31,919 INFO L225 Difference]: With dead ends: 727 [2021-12-14 11:43:31,919 INFO L226 Difference]: Without dead ends: 705 [2021-12-14 11:43:31,919 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-12-14 11:43:31,920 INFO L933 BasicCegarLoop]: 380 mSDtfsCounter, 108 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1987 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:31,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 1987 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:43:31,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2021-12-14 11:43:31,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 699. [2021-12-14 11:43:31,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 619 states have (on average 1.3344103392568658) internal successors, (826), 630 states have internal predecessors, (826), 54 states have call successors, (54), 23 states have call predecessors, (54), 25 states have return successors, (81), 46 states have call predecessors, (81), 47 states have call successors, (81) [2021-12-14 11:43:31,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 961 transitions. [2021-12-14 11:43:31,946 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 961 transitions. Word has length 39 [2021-12-14 11:43:31,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:31,946 INFO L470 AbstractCegarLoop]: Abstraction has 699 states and 961 transitions. [2021-12-14 11:43:31,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:31,946 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 961 transitions. [2021-12-14 11:43:31,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-14 11:43:31,947 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:31,947 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:31,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-14 11:43:31,947 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:31,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:31,948 INFO L85 PathProgramCache]: Analyzing trace with hash 114444064, now seen corresponding path program 1 times [2021-12-14 11:43:31,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:31,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590383993] [2021-12-14 11:43:31,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:31,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:31,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 11:43:31,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:31,979 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,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:31,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590383993] [2021-12-14 11:43:31,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590383993] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:31,979 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:31,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 11:43:31,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051313722] [2021-12-14 11:43:31,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:31,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 11:43:31,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:31,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 11:43:31,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 11:43:31,980 INFO L87 Difference]: Start difference. First operand 699 states and 961 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:32,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:32,158 INFO L93 Difference]: Finished difference Result 721 states and 984 transitions. [2021-12-14 11:43:32,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 11:43:32,159 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2021-12-14 11:43:32,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:32,162 INFO L225 Difference]: With dead ends: 721 [2021-12-14 11:43:32,162 INFO L226 Difference]: Without dead ends: 697 [2021-12-14 11:43:32,162 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:32,163 INFO L933 BasicCegarLoop]: 366 mSDtfsCounter, 312 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:32,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 1338 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:43:32,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2021-12-14 11:43:32,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 691. [2021-12-14 11:43:32,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 611 states have (on average 1.3338788870703764) internal successors, (815), 622 states have internal predecessors, (815), 54 states have call successors, (54), 23 states have call predecessors, (54), 25 states have return successors, (81), 46 states have call predecessors, (81), 47 states have call successors, (81) [2021-12-14 11:43:32,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 950 transitions. [2021-12-14 11:43:32,187 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 950 transitions. Word has length 39 [2021-12-14 11:43:32,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:32,188 INFO L470 AbstractCegarLoop]: Abstraction has 691 states and 950 transitions. [2021-12-14 11:43:32,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:32,188 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 950 transitions. [2021-12-14 11:43:32,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-14 11:43:32,189 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:32,189 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:32,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-14 11:43:32,189 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:32,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:32,190 INFO L85 PathProgramCache]: Analyzing trace with hash -2104766079, now seen corresponding path program 1 times [2021-12-14 11:43:32,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:32,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734303862] [2021-12-14 11:43:32,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:32,190 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:32,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 11:43:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:32,229 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:32,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:32,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734303862] [2021-12-14 11:43:32,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734303862] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:32,229 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:32,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 11:43:32,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747993586] [2021-12-14 11:43:32,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:32,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 11:43:32,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:32,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 11:43:32,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 11:43:32,231 INFO L87 Difference]: Start difference. First operand 691 states and 950 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:32,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:32,428 INFO L93 Difference]: Finished difference Result 731 states and 996 transitions. [2021-12-14 11:43:32,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 11:43:32,429 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2021-12-14 11:43:32,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:32,431 INFO L225 Difference]: With dead ends: 731 [2021-12-14 11:43:32,431 INFO L226 Difference]: Without dead ends: 711 [2021-12-14 11:43:32,432 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 11:43:32,432 INFO L933 BasicCegarLoop]: 375 mSDtfsCounter, 84 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:32,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 1855 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:32,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2021-12-14 11:43:32,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 696. [2021-12-14 11:43:32,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 615 states have (on average 1.3317073170731708) internal successors, (819), 626 states have internal predecessors, (819), 54 states have call successors, (54), 23 states have call predecessors, (54), 26 states have return successors, (83), 47 states have call predecessors, (83), 47 states have call successors, (83) [2021-12-14 11:43:32,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 956 transitions. [2021-12-14 11:43:32,458 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 956 transitions. Word has length 39 [2021-12-14 11:43:32,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:32,458 INFO L470 AbstractCegarLoop]: Abstraction has 696 states and 956 transitions. [2021-12-14 11:43:32,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:32,458 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 956 transitions. [2021-12-14 11:43:32,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-14 11:43:32,459 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:32,459 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:32,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-14 11:43:32,460 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:32,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:32,460 INFO L85 PathProgramCache]: Analyzing trace with hash 225426455, now seen corresponding path program 1 times [2021-12-14 11:43:32,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:32,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955543555] [2021-12-14 11:43:32,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:32,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:32,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 11:43:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:32,490 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:32,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:32,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955543555] [2021-12-14 11:43:32,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955543555] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:32,491 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:32,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 11:43:32,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611139709] [2021-12-14 11:43:32,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:32,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 11:43:32,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:32,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 11:43:32,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 11:43:32,492 INFO L87 Difference]: Start difference. First operand 696 states and 956 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:32,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:32,700 INFO L93 Difference]: Finished difference Result 780 states and 1040 transitions. [2021-12-14 11:43:32,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 11:43:32,701 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2021-12-14 11:43:32,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:32,703 INFO L225 Difference]: With dead ends: 780 [2021-12-14 11:43:32,703 INFO L226 Difference]: Without dead ends: 518 [2021-12-14 11:43:32,704 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:32,704 INFO L933 BasicCegarLoop]: 419 mSDtfsCounter, 485 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:32,704 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [489 Valid, 955 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:32,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2021-12-14 11:43:32,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 477. [2021-12-14 11:43:32,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 418 states have (on average 1.299043062200957) internal successors, (543), 428 states have internal predecessors, (543), 39 states have call successors, (39), 16 states have call predecessors, (39), 19 states have return successors, (47), 33 states have call predecessors, (47), 32 states have call successors, (47) [2021-12-14 11:43:32,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 629 transitions. [2021-12-14 11:43:32,722 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 629 transitions. Word has length 41 [2021-12-14 11:43:32,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:32,722 INFO L470 AbstractCegarLoop]: Abstraction has 477 states and 629 transitions. [2021-12-14 11:43:32,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:32,722 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 629 transitions. [2021-12-14 11:43:32,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-14 11:43:32,723 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:32,723 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:32,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-14 11:43:32,724 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:32,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:32,724 INFO L85 PathProgramCache]: Analyzing trace with hash -974540775, now seen corresponding path program 1 times [2021-12-14 11:43:32,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:32,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557557278] [2021-12-14 11:43:32,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:32,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:32,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 11:43:32,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:32,769 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:32,770 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:32,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557557278] [2021-12-14 11:43:32,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557557278] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:32,770 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:32,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 11:43:32,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348810841] [2021-12-14 11:43:32,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:32,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 11:43:32,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:32,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 11:43:32,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 11:43:32,771 INFO L87 Difference]: Start difference. First operand 477 states and 629 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:33,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:33,014 INFO L93 Difference]: Finished difference Result 797 states and 1063 transitions. [2021-12-14 11:43:33,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 11:43:33,014 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-12-14 11:43:33,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:33,016 INFO L225 Difference]: With dead ends: 797 [2021-12-14 11:43:33,016 INFO L226 Difference]: Without dead ends: 520 [2021-12-14 11:43:33,017 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-12-14 11:43:33,018 INFO L933 BasicCegarLoop]: 345 mSDtfsCounter, 458 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:33,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [465 Valid, 1080 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:33,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2021-12-14 11:43:33,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 481. [2021-12-14 11:43:33,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 422 states have (on average 1.2962085308056872) internal successors, (547), 432 states have internal predecessors, (547), 39 states have call successors, (39), 16 states have call predecessors, (39), 19 states have return successors, (47), 33 states have call predecessors, (47), 32 states have call successors, (47) [2021-12-14 11:43:33,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 633 transitions. [2021-12-14 11:43:33,038 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 633 transitions. Word has length 40 [2021-12-14 11:43:33,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:33,038 INFO L470 AbstractCegarLoop]: Abstraction has 481 states and 633 transitions. [2021-12-14 11:43:33,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:33,038 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 633 transitions. [2021-12-14 11:43:33,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-14 11:43:33,039 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:33,039 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:33,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-14 11:43:33,039 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:33,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:33,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1588334311, now seen corresponding path program 1 times [2021-12-14 11:43:33,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:33,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730124927] [2021-12-14 11:43:33,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:33,040 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:33,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 11:43:33,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:33,066 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:33,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:33,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730124927] [2021-12-14 11:43:33,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730124927] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:33,067 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:33,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 11:43:33,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807884548] [2021-12-14 11:43:33,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:33,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 11:43:33,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:33,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 11:43:33,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 11:43:33,068 INFO L87 Difference]: Start difference. First operand 481 states and 633 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:33,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:33,225 INFO L93 Difference]: Finished difference Result 579 states and 759 transitions. [2021-12-14 11:43:33,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 11:43:33,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2021-12-14 11:43:33,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:33,227 INFO L225 Difference]: With dead ends: 579 [2021-12-14 11:43:33,227 INFO L226 Difference]: Without dead ends: 509 [2021-12-14 11:43:33,227 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:33,227 INFO L933 BasicCegarLoop]: 430 mSDtfsCounter, 180 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:33,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 951 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:43:33,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2021-12-14 11:43:33,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 455. [2021-12-14 11:43:33,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 398 states have (on average 1.3115577889447236) internal successors, (522), 409 states have internal predecessors, (522), 38 states have call successors, (38), 15 states have call predecessors, (38), 18 states have return successors, (47), 31 states have call predecessors, (47), 31 states have call successors, (47) [2021-12-14 11:43:33,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 607 transitions. [2021-12-14 11:43:33,252 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 607 transitions. Word has length 40 [2021-12-14 11:43:33,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:33,252 INFO L470 AbstractCegarLoop]: Abstraction has 455 states and 607 transitions. [2021-12-14 11:43:33,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:33,253 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 607 transitions. [2021-12-14 11:43:33,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-14 11:43:33,253 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:33,253 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:33,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-14 11:43:33,254 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:33,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:33,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1541633835, now seen corresponding path program 1 times [2021-12-14 11:43:33,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:33,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839103375] [2021-12-14 11:43:33,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:33,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:33,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:33,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 11:43:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:33,301 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:33,301 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:33,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839103375] [2021-12-14 11:43:33,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839103375] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:33,301 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:33,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 11:43:33,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460231859] [2021-12-14 11:43:33,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:33,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 11:43:33,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:33,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 11:43:33,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 11:43:33,303 INFO L87 Difference]: Start difference. First operand 455 states and 607 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:33,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:33,529 INFO L93 Difference]: Finished difference Result 503 states and 673 transitions. [2021-12-14 11:43:33,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 11:43:33,530 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2021-12-14 11:43:33,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:33,531 INFO L225 Difference]: With dead ends: 503 [2021-12-14 11:43:33,531 INFO L226 Difference]: Without dead ends: 499 [2021-12-14 11:43:33,532 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-14 11:43:33,532 INFO L933 BasicCegarLoop]: 349 mSDtfsCounter, 287 mSDsluCounter, 1505 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 1854 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:33,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [322 Valid, 1854 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:33,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2021-12-14 11:43:33,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 470. [2021-12-14 11:43:33,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 412 states have (on average 1.3009708737864079) internal successors, (536), 423 states have internal predecessors, (536), 38 states have call successors, (38), 15 states have call predecessors, (38), 19 states have return successors, (55), 32 states have call predecessors, (55), 31 states have call successors, (55) [2021-12-14 11:43:33,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 629 transitions. [2021-12-14 11:43:33,555 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 629 transitions. Word has length 41 [2021-12-14 11:43:33,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:33,555 INFO L470 AbstractCegarLoop]: Abstraction has 470 states and 629 transitions. [2021-12-14 11:43:33,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:33,555 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 629 transitions. [2021-12-14 11:43:33,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-14 11:43:33,556 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:33,556 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:33,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-14 11:43:33,556 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:33,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:33,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1541357005, now seen corresponding path program 1 times [2021-12-14 11:43:33,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:33,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691199899] [2021-12-14 11:43:33,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:33,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:33,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:33,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 11:43:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:33,598 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:33,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:33,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691199899] [2021-12-14 11:43:33,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691199899] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:33,599 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:33,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 11:43:33,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051506372] [2021-12-14 11:43:33,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:33,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 11:43:33,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:33,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 11:43:33,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 11:43:33,600 INFO L87 Difference]: Start difference. First operand 470 states and 629 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:33,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:33,869 INFO L93 Difference]: Finished difference Result 490 states and 650 transitions. [2021-12-14 11:43:33,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 11:43:33,869 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2021-12-14 11:43:33,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:33,871 INFO L225 Difference]: With dead ends: 490 [2021-12-14 11:43:33,871 INFO L226 Difference]: Without dead ends: 477 [2021-12-14 11:43:33,872 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:33,872 INFO L933 BasicCegarLoop]: 352 mSDtfsCounter, 78 mSDsluCounter, 1591 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1943 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:33,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 1943 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:33,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2021-12-14 11:43:33,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 467. [2021-12-14 11:43:33,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 409 states have (on average 1.3031784841075795) internal successors, (533), 421 states have internal predecessors, (533), 38 states have call successors, (38), 15 states have call predecessors, (38), 19 states have return successors, (54), 31 states have call predecessors, (54), 31 states have call successors, (54) [2021-12-14 11:43:33,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 625 transitions. [2021-12-14 11:43:33,895 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 625 transitions. Word has length 41 [2021-12-14 11:43:33,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:33,895 INFO L470 AbstractCegarLoop]: Abstraction has 467 states and 625 transitions. [2021-12-14 11:43:33,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:33,895 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 625 transitions. [2021-12-14 11:43:33,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-14 11:43:33,896 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:33,896 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:33,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-14 11:43:33,897 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:33,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:33,897 INFO L85 PathProgramCache]: Analyzing trace with hash -681787036, now seen corresponding path program 1 times [2021-12-14 11:43:33,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:33,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169177249] [2021-12-14 11:43:33,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:33,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:33,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:33,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-14 11:43:33,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:33,943 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:33,943 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:33,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169177249] [2021-12-14 11:43:33,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169177249] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:33,944 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:33,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 11:43:33,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426097809] [2021-12-14 11:43:33,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:33,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 11:43:33,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:33,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 11:43:33,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 11:43:33,945 INFO L87 Difference]: Start difference. First operand 467 states and 625 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:34,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:34,283 INFO L93 Difference]: Finished difference Result 527 states and 699 transitions. [2021-12-14 11:43:34,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 11:43:34,283 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2021-12-14 11:43:34,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:34,285 INFO L225 Difference]: With dead ends: 527 [2021-12-14 11:43:34,285 INFO L226 Difference]: Without dead ends: 511 [2021-12-14 11:43:34,286 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 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:34,286 INFO L933 BasicCegarLoop]: 422 mSDtfsCounter, 603 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:34,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [614 Valid, 1107 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:34,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2021-12-14 11:43:34,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 453. [2021-12-14 11:43:34,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 397 states have (on average 1.309823677581864) internal successors, (520), 408 states have internal predecessors, (520), 37 states have call successors, (37), 15 states have call predecessors, (37), 18 states have return successors, (46), 30 states have call predecessors, (46), 30 states have call successors, (46) [2021-12-14 11:43:34,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 603 transitions. [2021-12-14 11:43:34,306 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 603 transitions. Word has length 42 [2021-12-14 11:43:34,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:34,306 INFO L470 AbstractCegarLoop]: Abstraction has 453 states and 603 transitions. [2021-12-14 11:43:34,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:34,306 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 603 transitions. [2021-12-14 11:43:34,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-14 11:43:34,307 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:34,307 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:34,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-14 11:43:34,308 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:34,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:34,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1773882886, now seen corresponding path program 1 times [2021-12-14 11:43:34,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:34,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524482116] [2021-12-14 11:43:34,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:34,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 11:43:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,402 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:34,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:34,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524482116] [2021-12-14 11:43:34,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524482116] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:34,402 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:34,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 11:43:34,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671983053] [2021-12-14 11:43:34,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:34,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 11:43:34,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:34,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 11:43:34,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 11:43:34,404 INFO L87 Difference]: Start difference. First operand 453 states and 603 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:34,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:34,608 INFO L93 Difference]: Finished difference Result 653 states and 873 transitions. [2021-12-14 11:43:34,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 11:43:34,608 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2021-12-14 11:43:34,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:34,610 INFO L225 Difference]: With dead ends: 653 [2021-12-14 11:43:34,610 INFO L226 Difference]: Without dead ends: 413 [2021-12-14 11:43:34,610 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 11:43:34,611 INFO L933 BasicCegarLoop]: 359 mSDtfsCounter, 102 mSDsluCounter, 1436 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1795 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:34,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 1795 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:34,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-12-14 11:43:34,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 407. [2021-12-14 11:43:34,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 357 states have (on average 1.2913165266106443) internal successors, (461), 364 states have internal predecessors, (461), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (41), 29 states have call predecessors, (41), 29 states have call successors, (41) [2021-12-14 11:43:34,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 537 transitions. [2021-12-14 11:43:34,634 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 537 transitions. Word has length 44 [2021-12-14 11:43:34,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:34,641 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 537 transitions. [2021-12-14 11:43:34,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:34,641 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 537 transitions. [2021-12-14 11:43:34,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-14 11:43:34,642 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:34,642 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:34,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-14 11:43:34,642 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:34,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:34,643 INFO L85 PathProgramCache]: Analyzing trace with hash -126970977, now seen corresponding path program 1 times [2021-12-14 11:43:34,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:34,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877679098] [2021-12-14 11:43:34,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:34,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 11:43:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,690 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:34,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:34,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877679098] [2021-12-14 11:43:34,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877679098] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:34,690 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:34,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 11:43:34,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540835963] [2021-12-14 11:43:34,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:34,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 11:43:34,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:34,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 11:43:34,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 11:43:34,692 INFO L87 Difference]: Start difference. First operand 407 states and 537 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:34,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:34,897 INFO L93 Difference]: Finished difference Result 607 states and 802 transitions. [2021-12-14 11:43:34,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 11:43:34,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2021-12-14 11:43:34,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:34,899 INFO L225 Difference]: With dead ends: 607 [2021-12-14 11:43:34,899 INFO L226 Difference]: Without dead ends: 413 [2021-12-14 11:43:34,900 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-14 11:43:34,900 INFO L933 BasicCegarLoop]: 341 mSDtfsCounter, 397 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:34,900 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [401 Valid, 1031 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:34,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-12-14 11:43:34,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 407. [2021-12-14 11:43:34,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 357 states have (on average 1.2857142857142858) internal successors, (459), 364 states have internal predecessors, (459), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (41), 29 states have call predecessors, (41), 29 states have call successors, (41) [2021-12-14 11:43:34,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 535 transitions. [2021-12-14 11:43:34,918 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 535 transitions. Word has length 46 [2021-12-14 11:43:34,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:34,918 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 535 transitions. [2021-12-14 11:43:34,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:34,918 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 535 transitions. [2021-12-14 11:43:34,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-14 11:43:34,919 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:34,919 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:34,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-12-14 11:43:34,923 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:34,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:34,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1699061038, now seen corresponding path program 1 times [2021-12-14 11:43:34,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:34,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368052575] [2021-12-14 11:43:34,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:34,923 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-14 11:43:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:34,977 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:34,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:34,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368052575] [2021-12-14 11:43:34,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368052575] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:34,978 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:34,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 11:43:34,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221874483] [2021-12-14 11:43:34,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:34,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 11:43:34,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:34,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 11:43:34,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 11:43:34,980 INFO L87 Difference]: Start difference. First operand 407 states and 535 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 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:35,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:35,308 INFO L93 Difference]: Finished difference Result 425 states and 553 transitions. [2021-12-14 11:43:35,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 11:43:35,309 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 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 46 [2021-12-14 11:43:35,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:35,310 INFO L225 Difference]: With dead ends: 425 [2021-12-14 11:43:35,310 INFO L226 Difference]: Without dead ends: 409 [2021-12-14 11:43:35,311 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:35,311 INFO L933 BasicCegarLoop]: 350 mSDtfsCounter, 74 mSDsluCounter, 1586 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1936 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:35,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 1936 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 11:43:35,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2021-12-14 11:43:35,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 403. [2021-12-14 11:43:35,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 354 states have (on average 1.2853107344632768) internal successors, (455), 361 states have internal predecessors, (455), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (40), 28 states have call predecessors, (40), 28 states have call successors, (40) [2021-12-14 11:43:35,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 529 transitions. [2021-12-14 11:43:35,329 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 529 transitions. Word has length 46 [2021-12-14 11:43:35,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:35,329 INFO L470 AbstractCegarLoop]: Abstraction has 403 states and 529 transitions. [2021-12-14 11:43:35,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 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:35,330 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 529 transitions. [2021-12-14 11:43:35,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-14 11:43:35,330 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:35,330 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] [2021-12-14 11:43:35,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-12-14 11:43:35,331 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:35,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:35,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1266428222, now seen corresponding path program 1 times [2021-12-14 11:43:35,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:35,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501957296] [2021-12-14 11:43:35,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:35,332 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:35,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 11:43:35,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:35,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-14 11:43:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:35,388 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:35,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:35,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501957296] [2021-12-14 11:43:35,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501957296] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:35,388 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:35,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 11:43:35,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791779089] [2021-12-14 11:43:35,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:35,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 11:43:35,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:35,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 11:43:35,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-14 11:43:35,389 INFO L87 Difference]: Start difference. First operand 403 states and 529 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 11:43:35,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:35,757 INFO L93 Difference]: Finished difference Result 425 states and 552 transitions. [2021-12-14 11:43:35,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 11:43:35,757 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 47 [2021-12-14 11:43:35,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:35,758 INFO L225 Difference]: With dead ends: 425 [2021-12-14 11:43:35,758 INFO L226 Difference]: Without dead ends: 404 [2021-12-14 11:43:35,759 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-12-14 11:43:35,759 INFO L933 BasicCegarLoop]: 337 mSDtfsCounter, 148 mSDsluCounter, 1699 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 2036 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:35,759 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 2036 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 11:43:35,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2021-12-14 11:43:35,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 398. [2021-12-14 11:43:35,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 349 states have (on average 1.2836676217765044) internal successors, (448), 357 states have internal predecessors, (448), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (39), 27 states have call predecessors, (39), 28 states have call successors, (39) [2021-12-14 11:43:35,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 521 transitions. [2021-12-14 11:43:35,776 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 521 transitions. Word has length 47 [2021-12-14 11:43:35,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:35,776 INFO L470 AbstractCegarLoop]: Abstraction has 398 states and 521 transitions. [2021-12-14 11:43:35,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 11:43:35,777 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 521 transitions. [2021-12-14 11:43:35,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-14 11:43:35,777 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:35,777 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:35,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-12-14 11:43:35,778 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:35,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:35,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1875666142, now seen corresponding path program 1 times [2021-12-14 11:43:35,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:35,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640930746] [2021-12-14 11:43:35,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:35,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:35,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:35,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 11:43:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:35,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-14 11:43:35,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:35,817 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:35,817 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:35,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640930746] [2021-12-14 11:43:35,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640930746] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:35,817 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:35,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 11:43:35,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687819816] [2021-12-14 11:43:35,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:35,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 11:43:35,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:35,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 11:43:35,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 11:43:35,819 INFO L87 Difference]: Start difference. First operand 398 states and 521 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 11:43:36,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:36,117 INFO L93 Difference]: Finished difference Result 421 states and 545 transitions. [2021-12-14 11:43:36,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 11:43:36,117 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2021-12-14 11:43:36,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:36,119 INFO L225 Difference]: With dead ends: 421 [2021-12-14 11:43:36,119 INFO L226 Difference]: Without dead ends: 403 [2021-12-14 11:43:36,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-14 11:43:36,120 INFO L933 BasicCegarLoop]: 335 mSDtfsCounter, 148 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:36,120 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 1491 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 11:43:36,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2021-12-14 11:43:36,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 397. [2021-12-14 11:43:36,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 349 states have (on average 1.2808022922636104) internal successors, (447), 356 states have internal predecessors, (447), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (38), 27 states have call predecessors, (38), 27 states have call successors, (38) [2021-12-14 11:43:36,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 518 transitions. [2021-12-14 11:43:36,137 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 518 transitions. Word has length 48 [2021-12-14 11:43:36,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:36,137 INFO L470 AbstractCegarLoop]: Abstraction has 397 states and 518 transitions. [2021-12-14 11:43:36,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 11:43:36,138 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 518 transitions. [2021-12-14 11:43:36,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-14 11:43:36,138 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:36,139 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:36,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-12-14 11:43:36,139 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:36,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:36,139 INFO L85 PathProgramCache]: Analyzing trace with hash 712165053, now seen corresponding path program 1 times [2021-12-14 11:43:36,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:36,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126516753] [2021-12-14 11:43:36,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:36,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:36,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:36,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 11:43:36,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:36,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:36,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:36,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126516753] [2021-12-14 11:43:36,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126516753] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:36,170 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:36,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 11:43:36,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337759399] [2021-12-14 11:43:36,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:36,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 11:43:36,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:36,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 11:43:36,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 11:43:36,171 INFO L87 Difference]: Start difference. First operand 397 states and 518 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:36,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:36,331 INFO L93 Difference]: Finished difference Result 670 states and 869 transitions. [2021-12-14 11:43:36,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 11:43:36,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2021-12-14 11:43:36,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:36,333 INFO L225 Difference]: With dead ends: 670 [2021-12-14 11:43:36,333 INFO L226 Difference]: Without dead ends: 482 [2021-12-14 11:43:36,334 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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:36,334 INFO L933 BasicCegarLoop]: 384 mSDtfsCounter, 188 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:36,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 859 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:43:36,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-12-14 11:43:36,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 450. [2021-12-14 11:43:36,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 397 states have (on average 1.279596977329975) internal successors, (508), 403 states have internal predecessors, (508), 35 states have call successors, (35), 16 states have call predecessors, (35), 17 states have return successors, (44), 31 states have call predecessors, (44), 30 states have call successors, (44) [2021-12-14 11:43:36,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 587 transitions. [2021-12-14 11:43:36,354 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 587 transitions. Word has length 49 [2021-12-14 11:43:36,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:36,354 INFO L470 AbstractCegarLoop]: Abstraction has 450 states and 587 transitions. [2021-12-14 11:43:36,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:36,354 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 587 transitions. [2021-12-14 11:43:36,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-14 11:43:36,355 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:36,355 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:36,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-12-14 11:43:36,361 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:36,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:36,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1620758026, now seen corresponding path program 1 times [2021-12-14 11:43:36,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:36,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346840785] [2021-12-14 11:43:36,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:36,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:36,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:36,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 11:43:36,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:36,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:36,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:36,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346840785] [2021-12-14 11:43:36,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346840785] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:36,395 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:36,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 11:43:36,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71973921] [2021-12-14 11:43:36,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:36,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 11:43:36,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:36,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 11:43:36,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 11:43:36,396 INFO L87 Difference]: Start difference. First operand 450 states and 587 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:36,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:36,550 INFO L93 Difference]: Finished difference Result 549 states and 702 transitions. [2021-12-14 11:43:36,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 11:43:36,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2021-12-14 11:43:36,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:36,552 INFO L225 Difference]: With dead ends: 549 [2021-12-14 11:43:36,552 INFO L226 Difference]: Without dead ends: 463 [2021-12-14 11:43:36,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 11:43:36,553 INFO L933 BasicCegarLoop]: 334 mSDtfsCounter, 70 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:36,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 1105 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:43:36,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2021-12-14 11:43:36,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 452. [2021-12-14 11:43:36,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 399 states have (on average 1.2781954887218046) internal successors, (510), 405 states have internal predecessors, (510), 35 states have call successors, (35), 16 states have call predecessors, (35), 17 states have return successors, (44), 31 states have call predecessors, (44), 30 states have call successors, (44) [2021-12-14 11:43:36,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 589 transitions. [2021-12-14 11:43:36,572 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 589 transitions. Word has length 48 [2021-12-14 11:43:36,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:36,572 INFO L470 AbstractCegarLoop]: Abstraction has 452 states and 589 transitions. [2021-12-14 11:43:36,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:36,573 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 589 transitions. [2021-12-14 11:43:36,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-14 11:43:36,574 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:36,574 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:36,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-12-14 11:43:36,574 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:36,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:36,574 INFO L85 PathProgramCache]: Analyzing trace with hash -979201482, now seen corresponding path program 1 times [2021-12-14 11:43:36,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:36,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375335876] [2021-12-14 11:43:36,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:36,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:36,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 11:43:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:36,620 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:36,620 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:36,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375335876] [2021-12-14 11:43:36,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375335876] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:36,621 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:36,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 11:43:36,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322723847] [2021-12-14 11:43:36,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:36,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 11:43:36,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:36,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 11:43:36,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 11:43:36,623 INFO L87 Difference]: Start difference. First operand 452 states and 589 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:36,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:36,843 INFO L93 Difference]: Finished difference Result 473 states and 609 transitions. [2021-12-14 11:43:36,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 11:43:36,844 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2021-12-14 11:43:36,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:36,846 INFO L225 Difference]: With dead ends: 473 [2021-12-14 11:43:36,846 INFO L226 Difference]: Without dead ends: 451 [2021-12-14 11:43:36,846 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:36,847 INFO L933 BasicCegarLoop]: 331 mSDtfsCounter, 81 mSDsluCounter, 1585 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1916 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:36,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 1916 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:36,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2021-12-14 11:43:36,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 440. [2021-12-14 11:43:36,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 388 states have (on average 1.2731958762886597) internal successors, (494), 393 states have internal predecessors, (494), 34 states have call successors, (34), 16 states have call predecessors, (34), 17 states have return successors, (44), 31 states have call predecessors, (44), 30 states have call successors, (44) [2021-12-14 11:43:36,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 572 transitions. [2021-12-14 11:43:36,865 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 572 transitions. Word has length 48 [2021-12-14 11:43:36,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:36,866 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 572 transitions. [2021-12-14 11:43:36,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:36,866 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 572 transitions. [2021-12-14 11:43:36,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-14 11:43:36,867 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:36,867 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:36,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-12-14 11:43:36,867 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:36,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:36,868 INFO L85 PathProgramCache]: Analyzing trace with hash -697229217, now seen corresponding path program 1 times [2021-12-14 11:43:36,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:36,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443844234] [2021-12-14 11:43:36,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:36,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:36,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-14 11:43:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:36,917 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:36,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:36,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443844234] [2021-12-14 11:43:36,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443844234] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:36,918 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:36,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 11:43:36,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30836245] [2021-12-14 11:43:36,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:36,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 11:43:36,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:36,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 11:43:36,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 11:43:36,919 INFO L87 Difference]: Start difference. First operand 440 states and 572 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:37,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:37,152 INFO L93 Difference]: Finished difference Result 690 states and 898 transitions. [2021-12-14 11:43:37,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 11:43:37,153 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2021-12-14 11:43:37,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:37,154 INFO L225 Difference]: With dead ends: 690 [2021-12-14 11:43:37,154 INFO L226 Difference]: Without dead ends: 469 [2021-12-14 11:43:37,155 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-14 11:43:37,155 INFO L933 BasicCegarLoop]: 360 mSDtfsCounter, 81 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 1819 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:37,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 1819 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:37,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2021-12-14 11:43:37,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 440. [2021-12-14 11:43:37,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 388 states have (on average 1.268041237113402) internal successors, (492), 393 states have internal predecessors, (492), 34 states have call successors, (34), 16 states have call predecessors, (34), 17 states have return successors, (44), 31 states have call predecessors, (44), 30 states have call successors, (44) [2021-12-14 11:43:37,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 570 transitions. [2021-12-14 11:43:37,174 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 570 transitions. Word has length 51 [2021-12-14 11:43:37,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:37,174 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 570 transitions. [2021-12-14 11:43:37,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:37,174 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 570 transitions. [2021-12-14 11:43:37,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-14 11:43:37,175 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:37,175 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:37,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-12-14 11:43:37,176 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:37,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:37,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1011871155, now seen corresponding path program 1 times [2021-12-14 11:43:37,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:37,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077356121] [2021-12-14 11:43:37,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:37,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:37,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-14 11:43:37,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:37,223 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:37,223 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:37,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077356121] [2021-12-14 11:43:37,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077356121] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:37,223 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:37,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 11:43:37,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664059577] [2021-12-14 11:43:37,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:37,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 11:43:37,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:37,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 11:43:37,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-14 11:43:37,225 INFO L87 Difference]: Start difference. First operand 440 states and 570 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 7 states have internal predecessors, (48), 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:37,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:37,489 INFO L93 Difference]: Finished difference Result 461 states and 592 transitions. [2021-12-14 11:43:37,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 11:43:37,489 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 7 states have internal predecessors, (48), 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 51 [2021-12-14 11:43:37,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:37,491 INFO L225 Difference]: With dead ends: 461 [2021-12-14 11:43:37,491 INFO L226 Difference]: Without dead ends: 442 [2021-12-14 11:43:37,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-14 11:43:37,492 INFO L933 BasicCegarLoop]: 325 mSDtfsCounter, 82 mSDsluCounter, 1715 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 2040 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:37,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 2040 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:37,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2021-12-14 11:43:37,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 436. [2021-12-14 11:43:37,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 385 states have (on average 1.2675324675324675) internal successors, (488), 390 states have internal predecessors, (488), 33 states have call successors, (33), 16 states have call predecessors, (33), 17 states have return successors, (43), 30 states have call predecessors, (43), 29 states have call successors, (43) [2021-12-14 11:43:37,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 564 transitions. [2021-12-14 11:43:37,510 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 564 transitions. Word has length 51 [2021-12-14 11:43:37,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:37,510 INFO L470 AbstractCegarLoop]: Abstraction has 436 states and 564 transitions. [2021-12-14 11:43:37,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 7 states have internal predecessors, (48), 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:37,510 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 564 transitions. [2021-12-14 11:43:37,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-14 11:43:37,511 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:37,511 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] [2021-12-14 11:43:37,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-12-14 11:43:37,511 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:37,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:37,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1800703409, now seen corresponding path program 1 times [2021-12-14 11:43:37,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:37,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456213935] [2021-12-14 11:43:37,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:37,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:37,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:37,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-14 11:43:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:37,555 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:37,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:37,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456213935] [2021-12-14 11:43:37,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456213935] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:37,555 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:37,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 11:43:37,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540960384] [2021-12-14 11:43:37,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:37,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 11:43:37,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:37,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 11:43:37,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-14 11:43:37,557 INFO L87 Difference]: Start difference. First operand 436 states and 564 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 7 states have internal predecessors, (49), 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:37,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:37,827 INFO L93 Difference]: Finished difference Result 457 states and 586 transitions. [2021-12-14 11:43:37,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 11:43:37,827 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 7 states have internal predecessors, (49), 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 52 [2021-12-14 11:43:37,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:37,829 INFO L225 Difference]: With dead ends: 457 [2021-12-14 11:43:37,829 INFO L226 Difference]: Without dead ends: 437 [2021-12-14 11:43:37,830 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-14 11:43:37,830 INFO L933 BasicCegarLoop]: 319 mSDtfsCounter, 82 mSDsluCounter, 1683 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 2002 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:37,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 2002 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:37,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2021-12-14 11:43:37,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 431. [2021-12-14 11:43:37,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 381 states have (on average 1.2677165354330708) internal successors, (483), 386 states have internal predecessors, (483), 32 states have call successors, (32), 16 states have call predecessors, (32), 17 states have return successors, (42), 29 states have call predecessors, (42), 28 states have call successors, (42) [2021-12-14 11:43:37,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 557 transitions. [2021-12-14 11:43:37,848 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 557 transitions. Word has length 52 [2021-12-14 11:43:37,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:37,848 INFO L470 AbstractCegarLoop]: Abstraction has 431 states and 557 transitions. [2021-12-14 11:43:37,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 7 states have internal predecessors, (49), 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:37,849 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 557 transitions. [2021-12-14 11:43:37,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-14 11:43:37,850 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:37,850 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] [2021-12-14 11:43:37,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-12-14 11:43:37,850 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:37,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:37,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1557824811, now seen corresponding path program 1 times [2021-12-14 11:43:37,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:37,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227587783] [2021-12-14 11:43:37,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:37,851 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:37,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-14 11:43:37,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:37,903 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:37,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:37,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227587783] [2021-12-14 11:43:37,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227587783] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:37,904 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:37,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 11:43:37,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959846867] [2021-12-14 11:43:37,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:37,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 11:43:37,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:37,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 11:43:37,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-14 11:43:37,907 INFO L87 Difference]: Start difference. First operand 431 states and 557 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 7 states have internal predecessors, (49), 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:38,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:38,161 INFO L93 Difference]: Finished difference Result 452 states and 579 transitions. [2021-12-14 11:43:38,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 11:43:38,162 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 7 states have internal predecessors, (49), 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 52 [2021-12-14 11:43:38,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:38,164 INFO L225 Difference]: With dead ends: 452 [2021-12-14 11:43:38,164 INFO L226 Difference]: Without dead ends: 433 [2021-12-14 11:43:38,165 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-14 11:43:38,165 INFO L933 BasicCegarLoop]: 312 mSDtfsCounter, 82 mSDsluCounter, 1644 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1956 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:38,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 1956 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:38,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2021-12-14 11:43:38,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 427. [2021-12-14 11:43:38,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 378 states have (on average 1.2671957671957672) internal successors, (479), 383 states have internal predecessors, (479), 31 states have call successors, (31), 16 states have call predecessors, (31), 17 states have return successors, (41), 28 states have call predecessors, (41), 27 states have call successors, (41) [2021-12-14 11:43:38,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 551 transitions. [2021-12-14 11:43:38,184 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 551 transitions. Word has length 52 [2021-12-14 11:43:38,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:38,184 INFO L470 AbstractCegarLoop]: Abstraction has 427 states and 551 transitions. [2021-12-14 11:43:38,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 7 states have internal predecessors, (49), 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:38,184 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 551 transitions. [2021-12-14 11:43:38,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-14 11:43:38,185 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:38,185 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] [2021-12-14 11:43:38,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-12-14 11:43:38,185 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:38,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:38,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1863063646, now seen corresponding path program 1 times [2021-12-14 11:43:38,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:38,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596155432] [2021-12-14 11:43:38,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:38,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:38,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-14 11:43:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:38,233 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:38,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:38,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596155432] [2021-12-14 11:43:38,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596155432] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:38,234 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:38,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 11:43:38,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164899060] [2021-12-14 11:43:38,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:38,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 11:43:38,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:38,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 11:43:38,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 11:43:38,235 INFO L87 Difference]: Start difference. First operand 427 states and 551 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 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:38,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:38,438 INFO L93 Difference]: Finished difference Result 444 states and 568 transitions. [2021-12-14 11:43:38,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 11:43:38,438 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 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 52 [2021-12-14 11:43:38,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:38,439 INFO L225 Difference]: With dead ends: 444 [2021-12-14 11:43:38,440 INFO L226 Difference]: Without dead ends: 424 [2021-12-14 11:43:38,440 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:38,440 INFO L933 BasicCegarLoop]: 324 mSDtfsCounter, 72 mSDsluCounter, 1454 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1778 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:38,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 1778 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:38,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2021-12-14 11:43:38,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 418. [2021-12-14 11:43:38,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 370 states have (on average 1.2648648648648648) internal successors, (468), 375 states have internal predecessors, (468), 30 states have call successors, (30), 16 states have call predecessors, (30), 17 states have return successors, (40), 27 states have call predecessors, (40), 26 states have call successors, (40) [2021-12-14 11:43:38,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 538 transitions. [2021-12-14 11:43:38,457 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 538 transitions. Word has length 52 [2021-12-14 11:43:38,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:38,458 INFO L470 AbstractCegarLoop]: Abstraction has 418 states and 538 transitions. [2021-12-14 11:43:38,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 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:38,458 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 538 transitions. [2021-12-14 11:43:38,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-12-14 11:43:38,460 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:38,460 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:38,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-12-14 11:43:38,460 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:38,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:38,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1043047530, now seen corresponding path program 1 times [2021-12-14 11:43:38,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:38,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192623986] [2021-12-14 11:43:38,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:38,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:38,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:38,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 11:43:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:38,524 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:38,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:38,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192623986] [2021-12-14 11:43:38,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192623986] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:38,526 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:38,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 11:43:38,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520744505] [2021-12-14 11:43:38,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:38,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 11:43:38,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:38,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 11:43:38,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 11:43:38,528 INFO L87 Difference]: Start difference. First operand 418 states and 538 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:38,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:38,758 INFO L93 Difference]: Finished difference Result 760 states and 992 transitions. [2021-12-14 11:43:38,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 11:43:38,759 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2021-12-14 11:43:38,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:38,761 INFO L225 Difference]: With dead ends: 760 [2021-12-14 11:43:38,761 INFO L226 Difference]: Without dead ends: 550 [2021-12-14 11:43:38,762 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-14 11:43:38,767 INFO L933 BasicCegarLoop]: 389 mSDtfsCounter, 133 mSDsluCounter, 1542 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1931 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:38,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 1931 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:38,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2021-12-14 11:43:38,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 418. [2021-12-14 11:43:38,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 370 states have (on average 1.2621621621621621) internal successors, (467), 375 states have internal predecessors, (467), 30 states have call successors, (30), 16 states have call predecessors, (30), 17 states have return successors, (40), 27 states have call predecessors, (40), 26 states have call successors, (40) [2021-12-14 11:43:38,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 537 transitions. [2021-12-14 11:43:38,790 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 537 transitions. Word has length 54 [2021-12-14 11:43:38,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:38,791 INFO L470 AbstractCegarLoop]: Abstraction has 418 states and 537 transitions. [2021-12-14 11:43:38,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 11:43:38,792 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 537 transitions. [2021-12-14 11:43:38,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-14 11:43:38,794 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:38,794 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] [2021-12-14 11:43:38,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-12-14 11:43:38,794 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:38,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:38,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1077241075, now seen corresponding path program 1 times [2021-12-14 11:43:38,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:38,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589589547] [2021-12-14 11:43:38,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:38,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:38,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 11:43:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:38,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-14 11:43:38,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:38,862 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:38,862 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:38,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589589547] [2021-12-14 11:43:38,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589589547] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:38,862 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:38,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 11:43:38,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601564322] [2021-12-14 11:43:38,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:38,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 11:43:38,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:38,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 11:43:38,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-14 11:43:38,863 INFO L87 Difference]: Start difference. First operand 418 states and 537 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 11:43:39,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:39,204 INFO L93 Difference]: Finished difference Result 437 states and 556 transitions. [2021-12-14 11:43:39,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 11:43:39,204 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 56 [2021-12-14 11:43:39,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:39,206 INFO L225 Difference]: With dead ends: 437 [2021-12-14 11:43:39,206 INFO L226 Difference]: Without dead ends: 390 [2021-12-14 11:43:39,206 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2021-12-14 11:43:39,207 INFO L933 BasicCegarLoop]: 302 mSDtfsCounter, 137 mSDsluCounter, 1647 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1949 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:39,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 1949 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 11:43:39,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-12-14 11:43:39,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 382. [2021-12-14 11:43:39,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 338 states have (on average 1.257396449704142) internal successors, (425), 342 states have internal predecessors, (425), 28 states have call successors, (28), 15 states have call predecessors, (28), 15 states have return successors, (37), 25 states have call predecessors, (37), 24 states have call successors, (37) [2021-12-14 11:43:39,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 490 transitions. [2021-12-14 11:43:39,225 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 490 transitions. Word has length 56 [2021-12-14 11:43:39,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:39,225 INFO L470 AbstractCegarLoop]: Abstraction has 382 states and 490 transitions. [2021-12-14 11:43:39,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 11:43:39,225 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 490 transitions. [2021-12-14 11:43:39,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-14 11:43:39,226 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:39,226 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] [2021-12-14 11:43:39,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-12-14 11:43:39,227 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:39,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:39,227 INFO L85 PathProgramCache]: Analyzing trace with hash 843934500, now seen corresponding path program 1 times [2021-12-14 11:43:39,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:39,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029389855] [2021-12-14 11:43:39,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:39,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:39,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-14 11:43:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:39,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 11:43:39,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:39,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029389855] [2021-12-14 11:43:39,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029389855] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:39,274 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:39,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 11:43:39,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423690694] [2021-12-14 11:43:39,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:39,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 11:43:39,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:39,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 11:43:39,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-14 11:43:39,276 INFO L87 Difference]: Start difference. First operand 382 states and 490 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 7 states have internal predecessors, (53), 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:39,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:39,509 INFO L93 Difference]: Finished difference Result 403 states and 512 transitions. [2021-12-14 11:43:39,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 11:43:39,509 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 7 states have internal predecessors, (53), 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 56 [2021-12-14 11:43:39,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:39,510 INFO L225 Difference]: With dead ends: 403 [2021-12-14 11:43:39,510 INFO L226 Difference]: Without dead ends: 366 [2021-12-14 11:43:39,511 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-14 11:43:39,512 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 90 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:39,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 1547 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:39,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-12-14 11:43:39,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 360. [2021-12-14 11:43:39,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 319 states have (on average 1.2570532915360502) internal successors, (401), 323 states have internal predecessors, (401), 26 states have call successors, (26), 14 states have call predecessors, (26), 14 states have return successors, (35), 23 states have call predecessors, (35), 22 states have call successors, (35) [2021-12-14 11:43:39,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 462 transitions. [2021-12-14 11:43:39,538 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 462 transitions. Word has length 56 [2021-12-14 11:43:39,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:39,539 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 462 transitions. [2021-12-14 11:43:39,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 7 states have internal predecessors, (53), 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:39,539 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 462 transitions. [2021-12-14 11:43:39,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-14 11:43:39,540 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:39,540 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:39,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-12-14 11:43:39,540 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:39,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:39,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1757413827, now seen corresponding path program 1 times [2021-12-14 11:43:39,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:39,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957144873] [2021-12-14 11:43:39,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:39,541 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:39,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-14 11:43:39,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:39,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-14 11:43:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:39,592 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:39,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:39,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957144873] [2021-12-14 11:43:39,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957144873] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:39,593 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:39,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 11:43:39,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202908437] [2021-12-14 11:43:39,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:39,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 11:43:39,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:39,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 11:43:39,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-14 11:43:39,594 INFO L87 Difference]: Start difference. First operand 360 states and 462 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 11:43:39,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:39,756 INFO L93 Difference]: Finished difference Result 572 states and 729 transitions. [2021-12-14 11:43:39,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 11:43:39,757 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 62 [2021-12-14 11:43:39,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:39,758 INFO L225 Difference]: With dead ends: 572 [2021-12-14 11:43:39,758 INFO L226 Difference]: Without dead ends: 341 [2021-12-14 11:43:39,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-12-14 11:43:39,760 INFO L933 BasicCegarLoop]: 309 mSDtfsCounter, 250 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:39,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [251 Valid, 870 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:43:39,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-12-14 11:43:39,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 327. [2021-12-14 11:43:39,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 291 states have (on average 1.2577319587628866) internal successors, (366), 294 states have internal predecessors, (366), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2021-12-14 11:43:39,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 412 transitions. [2021-12-14 11:43:39,776 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 412 transitions. Word has length 62 [2021-12-14 11:43:39,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:39,776 INFO L470 AbstractCegarLoop]: Abstraction has 327 states and 412 transitions. [2021-12-14 11:43:39,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 11:43:39,776 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 412 transitions. [2021-12-14 11:43:39,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-14 11:43:39,777 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:39,777 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] [2021-12-14 11:43:39,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-12-14 11:43:39,777 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:39,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:39,778 INFO L85 PathProgramCache]: Analyzing trace with hash 282061023, now seen corresponding path program 1 times [2021-12-14 11:43:39,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:39,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518805231] [2021-12-14 11:43:39,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:39,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:39,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-14 11:43:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:39,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-14 11:43:39,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:39,836 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:39,836 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:39,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518805231] [2021-12-14 11:43:39,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518805231] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:39,836 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:39,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 11:43:39,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838937765] [2021-12-14 11:43:39,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:39,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 11:43:39,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:39,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 11:43:39,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-14 11:43:39,838 INFO L87 Difference]: Start difference. First operand 327 states and 412 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 7 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 11:43:40,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:40,080 INFO L93 Difference]: Finished difference Result 364 states and 454 transitions. [2021-12-14 11:43:40,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 11:43:40,080 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 7 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 66 [2021-12-14 11:43:40,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:40,089 INFO L225 Difference]: With dead ends: 364 [2021-12-14 11:43:40,089 INFO L226 Difference]: Without dead ends: 345 [2021-12-14 11:43:40,090 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-12-14 11:43:40,090 INFO L933 BasicCegarLoop]: 249 mSDtfsCounter, 352 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:40,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [357 Valid, 1341 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:40,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2021-12-14 11:43:40,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 327. [2021-12-14 11:43:40,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 291 states have (on average 1.254295532646048) internal successors, (365), 294 states have internal predecessors, (365), 23 states have call successors, (23), 13 states have call predecessors, (23), 12 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2021-12-14 11:43:40,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 411 transitions. [2021-12-14 11:43:40,107 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 411 transitions. Word has length 66 [2021-12-14 11:43:40,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:40,108 INFO L470 AbstractCegarLoop]: Abstraction has 327 states and 411 transitions. [2021-12-14 11:43:40,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 7 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 11:43:40,108 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 411 transitions. [2021-12-14 11:43:40,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-14 11:43:40,109 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:40,109 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:40,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-12-14 11:43:40,109 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:40,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:40,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1597986012, now seen corresponding path program 1 times [2021-12-14 11:43:40,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:40,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899885046] [2021-12-14 11:43:40,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:40,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:40,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:40,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 11:43:40,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:40,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-14 11:43:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:40,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-14 11:43:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:40,178 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:40,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:40,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899885046] [2021-12-14 11:43:40,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899885046] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:40,178 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:40,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 11:43:40,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114871288] [2021-12-14 11:43:40,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:40,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 11:43:40,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:40,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 11:43:40,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-14 11:43:40,179 INFO L87 Difference]: Start difference. First operand 327 states and 411 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 11:43:40,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:40,497 INFO L93 Difference]: Finished difference Result 678 states and 834 transitions. [2021-12-14 11:43:40,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 11:43:40,497 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 68 [2021-12-14 11:43:40,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:40,499 INFO L225 Difference]: With dead ends: 678 [2021-12-14 11:43:40,499 INFO L226 Difference]: Without dead ends: 440 [2021-12-14 11:43:40,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-14 11:43:40,501 INFO L933 BasicCegarLoop]: 295 mSDtfsCounter, 538 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:40,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [544 Valid, 1057 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:40,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2021-12-14 11:43:40,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 421. [2021-12-14 11:43:40,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 375 states have (on average 1.2426666666666666) internal successors, (466), 380 states have internal predecessors, (466), 25 states have call successors, (25), 19 states have call predecessors, (25), 20 states have return successors, (26), 22 states have call predecessors, (26), 22 states have call successors, (26) [2021-12-14 11:43:40,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 517 transitions. [2021-12-14 11:43:40,528 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 517 transitions. Word has length 68 [2021-12-14 11:43:40,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:40,529 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 517 transitions. [2021-12-14 11:43:40,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 11:43:40,529 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 517 transitions. [2021-12-14 11:43:40,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-14 11:43:40,530 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:40,530 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] [2021-12-14 11:43:40,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-12-14 11:43:40,530 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:40,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:40,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1162614473, now seen corresponding path program 1 times [2021-12-14 11:43:40,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:40,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70644100] [2021-12-14 11:43:40,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:40,531 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:40,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-14 11:43:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:40,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-14 11:43:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:40,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-14 11:43:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:40,598 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:40,598 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:40,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70644100] [2021-12-14 11:43:40,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70644100] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:40,598 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:40,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-14 11:43:40,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079719375] [2021-12-14 11:43:40,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:40,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 11:43:40,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:40,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 11:43:40,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-14 11:43:40,600 INFO L87 Difference]: Start difference. First operand 421 states and 517 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-14 11:43:40,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:40,984 INFO L93 Difference]: Finished difference Result 423 states and 518 transitions. [2021-12-14 11:43:40,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 11:43:40,984 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 69 [2021-12-14 11:43:40,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:40,986 INFO L225 Difference]: With dead ends: 423 [2021-12-14 11:43:40,986 INFO L226 Difference]: Without dead ends: 346 [2021-12-14 11:43:40,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2021-12-14 11:43:40,986 INFO L933 BasicCegarLoop]: 233 mSDtfsCounter, 193 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:40,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 1429 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 11:43:40,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2021-12-14 11:43:41,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2021-12-14 11:43:41,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 307 states have (on average 1.247557003257329) internal successors, (383), 311 states have internal predecessors, (383), 21 states have call successors, (21), 16 states have call predecessors, (21), 17 states have return successors, (23), 19 states have call predecessors, (23), 19 states have call successors, (23) [2021-12-14 11:43:41,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 427 transitions. [2021-12-14 11:43:41,002 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 427 transitions. Word has length 69 [2021-12-14 11:43:41,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:41,002 INFO L470 AbstractCegarLoop]: Abstraction has 346 states and 427 transitions. [2021-12-14 11:43:41,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-14 11:43:41,003 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 427 transitions. [2021-12-14 11:43:41,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-14 11:43:41,003 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:41,004 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] [2021-12-14 11:43:41,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-12-14 11:43:41,005 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:41,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:41,006 INFO L85 PathProgramCache]: Analyzing trace with hash -2112644440, now seen corresponding path program 1 times [2021-12-14 11:43:41,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:41,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161224582] [2021-12-14 11:43:41,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:41,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:41,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 11:43:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:41,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-14 11:43:41,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:41,063 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:41,063 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:41,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161224582] [2021-12-14 11:43:41,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161224582] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:41,064 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:41,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 11:43:41,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583104670] [2021-12-14 11:43:41,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:41,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 11:43:41,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:41,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 11:43:41,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-14 11:43:41,065 INFO L87 Difference]: Start difference. First operand 346 states and 427 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 11:43:41,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:41,206 INFO L93 Difference]: Finished difference Result 504 states and 620 transitions. [2021-12-14 11:43:41,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 11:43:41,206 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 71 [2021-12-14 11:43:41,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:41,208 INFO L225 Difference]: With dead ends: 504 [2021-12-14 11:43:41,209 INFO L226 Difference]: Without dead ends: 373 [2021-12-14 11:43:41,209 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-12-14 11:43:41,209 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 85 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:41,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 1234 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:43:41,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-12-14 11:43:41,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 357. [2021-12-14 11:43:41,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 317 states have (on average 1.22397476340694) internal successors, (388), 322 states have internal predecessors, (388), 22 states have call successors, (22), 16 states have call predecessors, (22), 17 states have return successors, (23), 19 states have call predecessors, (23), 19 states have call successors, (23) [2021-12-14 11:43:41,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 433 transitions. [2021-12-14 11:43:41,239 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 433 transitions. Word has length 71 [2021-12-14 11:43:41,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:41,240 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 433 transitions. [2021-12-14 11:43:41,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 11:43:41,240 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 433 transitions. [2021-12-14 11:43:41,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-14 11:43:41,241 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:41,241 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:41,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-12-14 11:43:41,241 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:41,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:41,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1723775457, now seen corresponding path program 1 times [2021-12-14 11:43:41,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:41,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594356661] [2021-12-14 11:43:41,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:41,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:41,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 11:43:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:41,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-14 11:43:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:41,300 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 11:43:41,301 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:41,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594356661] [2021-12-14 11:43:41,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594356661] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:41,301 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:41,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 11:43:41,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791594695] [2021-12-14 11:43:41,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:41,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 11:43:41,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:41,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 11:43:41,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 11:43:41,302 INFO L87 Difference]: Start difference. First operand 357 states and 433 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 11:43:41,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:41,395 INFO L93 Difference]: Finished difference Result 456 states and 556 transitions. [2021-12-14 11:43:41,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 11:43:41,396 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 74 [2021-12-14 11:43:41,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:41,397 INFO L225 Difference]: With dead ends: 456 [2021-12-14 11:43:41,397 INFO L226 Difference]: Without dead ends: 392 [2021-12-14 11:43:41,398 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 11:43:41,400 INFO L933 BasicCegarLoop]: 240 mSDtfsCounter, 77 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:41,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 1229 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:43:41,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2021-12-14 11:43:41,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 265. [2021-12-14 11:43:41,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 234 states have (on average 1.1794871794871795) internal successors, (276), 238 states have internal predecessors, (276), 16 states have call successors, (16), 12 states have call predecessors, (16), 14 states have return successors, (19), 15 states have call predecessors, (19), 15 states have call successors, (19) [2021-12-14 11:43:41,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 311 transitions. [2021-12-14 11:43:41,419 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 311 transitions. Word has length 74 [2021-12-14 11:43:41,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:41,419 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 311 transitions. [2021-12-14 11:43:41,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 11:43:41,420 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 311 transitions. [2021-12-14 11:43:41,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-14 11:43:41,421 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:41,421 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] [2021-12-14 11:43:41,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-12-14 11:43:41,421 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:41,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:41,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1573659208, now seen corresponding path program 1 times [2021-12-14 11:43:41,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:41,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880407698] [2021-12-14 11:43:41,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:41,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:41,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-14 11:43:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:41,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-14 11:43:41,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:41,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-14 11:43:41,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:41,496 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:41,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:41,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880407698] [2021-12-14 11:43:41,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880407698] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:41,497 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:41,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-14 11:43:41,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878593310] [2021-12-14 11:43:41,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:41,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-14 11:43:41,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:41,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 11:43:41,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-12-14 11:43:41,498 INFO L87 Difference]: Start difference. First operand 265 states and 311 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 11:43:41,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:41,763 INFO L93 Difference]: Finished difference Result 497 states and 582 transitions. [2021-12-14 11:43:41,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-14 11:43:41,763 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 77 [2021-12-14 11:43:41,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:41,765 INFO L225 Difference]: With dead ends: 497 [2021-12-14 11:43:41,765 INFO L226 Difference]: Without dead ends: 444 [2021-12-14 11:43:41,765 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2021-12-14 11:43:41,766 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 650 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:41,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [650 Valid, 1202 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:41,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2021-12-14 11:43:41,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 191. [2021-12-14 11:43:41,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 171 states have (on average 1.1578947368421053) internal successors, (198), 173 states have internal predecessors, (198), 9 states have call successors, (9), 9 states have call predecessors, (9), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2021-12-14 11:43:41,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 217 transitions. [2021-12-14 11:43:41,778 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 217 transitions. Word has length 77 [2021-12-14 11:43:41,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:41,779 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 217 transitions. [2021-12-14 11:43:41,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 11:43:41,779 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 217 transitions. [2021-12-14 11:43:41,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-14 11:43:41,780 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:41,780 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:41,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-12-14 11:43:41,780 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:41,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:41,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1441970232, now seen corresponding path program 1 times [2021-12-14 11:43:41,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:41,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308516942] [2021-12-14 11:43:41,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:41,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:41,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 11:43:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:41,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-14 11:43:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:41,815 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:41,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:41,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308516942] [2021-12-14 11:43:41,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308516942] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:41,816 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:41,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 11:43:41,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992176885] [2021-12-14 11:43:41,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:41,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 11:43:41,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:41,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 11:43:41,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 11:43:41,817 INFO L87 Difference]: Start difference. First operand 191 states and 217 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 11:43:41,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:41,874 INFO L93 Difference]: Finished difference Result 256 states and 294 transitions. [2021-12-14 11:43:41,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 11:43:41,874 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 83 [2021-12-14 11:43:41,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:41,875 INFO L225 Difference]: With dead ends: 256 [2021-12-14 11:43:41,875 INFO L226 Difference]: Without dead ends: 197 [2021-12-14 11:43:41,875 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-14 11:43:41,876 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 45 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:41,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 513 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:43:41,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-12-14 11:43:41,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 191. [2021-12-14 11:43:41,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 171 states have (on average 1.152046783625731) internal successors, (197), 173 states have internal predecessors, (197), 9 states have call successors, (9), 9 states have call predecessors, (9), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2021-12-14 11:43:41,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 216 transitions. [2021-12-14 11:43:41,886 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 216 transitions. Word has length 83 [2021-12-14 11:43:41,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:41,887 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 216 transitions. [2021-12-14 11:43:41,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 11:43:41,887 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 216 transitions. [2021-12-14 11:43:41,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-12-14 11:43:41,888 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:41,888 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:41,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-12-14 11:43:41,888 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:41,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:41,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1573344441, now seen corresponding path program 1 times [2021-12-14 11:43:41,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:41,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950124951] [2021-12-14 11:43:41,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:41,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:41,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 11:43:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:41,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-14 11:43:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:41,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-14 11:43:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:41,942 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-14 11:43:41,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:41,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950124951] [2021-12-14 11:43:41,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950124951] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:41,942 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:41,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 11:43:41,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233711400] [2021-12-14 11:43:41,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:41,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 11:43:41,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:41,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 11:43:41,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 11:43:41,944 INFO L87 Difference]: Start difference. First operand 191 states and 216 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 11:43:42,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:42,029 INFO L93 Difference]: Finished difference Result 247 states and 277 transitions. [2021-12-14 11:43:42,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 11:43:42,029 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 103 [2021-12-14 11:43:42,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:42,030 INFO L225 Difference]: With dead ends: 247 [2021-12-14 11:43:42,031 INFO L226 Difference]: Without dead ends: 221 [2021-12-14 11:43:42,031 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-14 11:43:42,031 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 47 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:42,032 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 690 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:43:42,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-12-14 11:43:42,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 193. [2021-12-14 11:43:42,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 173 states have (on average 1.1502890173410405) internal successors, (199), 175 states have internal predecessors, (199), 9 states have call successors, (9), 9 states have call predecessors, (9), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2021-12-14 11:43:42,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 218 transitions. [2021-12-14 11:43:42,048 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 218 transitions. Word has length 103 [2021-12-14 11:43:42,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:42,048 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 218 transitions. [2021-12-14 11:43:42,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 11:43:42,049 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 218 transitions. [2021-12-14 11:43:42,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-12-14 11:43:42,050 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:42,050 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:42,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-12-14 11:43:42,050 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:42,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:42,051 INFO L85 PathProgramCache]: Analyzing trace with hash -696614137, now seen corresponding path program 1 times [2021-12-14 11:43:42,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:42,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34164402] [2021-12-14 11:43:42,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:42,051 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:42,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 11:43:42,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:42,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-14 11:43:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:42,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-14 11:43:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:42,119 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-14 11:43:42,120 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:42,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34164402] [2021-12-14 11:43:42,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34164402] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:42,120 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:42,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 11:43:42,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476302419] [2021-12-14 11:43:42,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:42,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 11:43:42,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:42,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 11:43:42,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-14 11:43:42,121 INFO L87 Difference]: Start difference. First operand 193 states and 218 transitions. Second operand has 10 states, 10 states have (on average 8.1) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 11:43:42,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:42,326 INFO L93 Difference]: Finished difference Result 237 states and 269 transitions. [2021-12-14 11:43:42,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 11:43:42,327 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 103 [2021-12-14 11:43:42,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:42,328 INFO L225 Difference]: With dead ends: 237 [2021-12-14 11:43:42,328 INFO L226 Difference]: Without dead ends: 201 [2021-12-14 11:43:42,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2021-12-14 11:43:42,328 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 289 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:42,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 977 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:43:42,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-12-14 11:43:42,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 191. [2021-12-14 11:43:42,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 171 states have (on average 1.1403508771929824) internal successors, (195), 173 states have internal predecessors, (195), 9 states have call successors, (9), 9 states have call predecessors, (9), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2021-12-14 11:43:42,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 214 transitions. [2021-12-14 11:43:42,340 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 214 transitions. Word has length 103 [2021-12-14 11:43:42,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:42,340 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 214 transitions. [2021-12-14 11:43:42,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 11:43:42,341 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 214 transitions. [2021-12-14 11:43:42,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-12-14 11:43:42,341 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:42,341 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:42,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-12-14 11:43:42,342 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:42,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:42,342 INFO L85 PathProgramCache]: Analyzing trace with hash 561522837, now seen corresponding path program 1 times [2021-12-14 11:43:42,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:42,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395480495] [2021-12-14 11:43:42,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:42,343 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:42,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 11:43:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:42,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-14 11:43:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:42,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-14 11:43:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:42,445 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-14 11:43:42,445 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:42,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395480495] [2021-12-14 11:43:42,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395480495] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:42,446 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:42,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-14 11:43:42,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789584211] [2021-12-14 11:43:42,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:42,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 11:43:42,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:42,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 11:43:42,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2021-12-14 11:43:42,447 INFO L87 Difference]: Start difference. First operand 191 states and 214 transitions. Second operand has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 11 states have internal predecessors, (88), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 11:43:42,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:42,739 INFO L93 Difference]: Finished difference Result 284 states and 325 transitions. [2021-12-14 11:43:42,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 11:43:42,740 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 11 states have internal predecessors, (88), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 104 [2021-12-14 11:43:42,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:42,741 INFO L225 Difference]: With dead ends: 284 [2021-12-14 11:43:42,741 INFO L226 Difference]: Without dead ends: 250 [2021-12-14 11:43:42,741 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2021-12-14 11:43:42,741 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 509 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:42,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [509 Valid, 1299 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:42,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-12-14 11:43:42,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 198. [2021-12-14 11:43:42,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 178 states have (on average 1.146067415730337) internal successors, (204), 180 states have internal predecessors, (204), 9 states have call successors, (9), 9 states have call predecessors, (9), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2021-12-14 11:43:42,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 223 transitions. [2021-12-14 11:43:42,753 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 223 transitions. Word has length 104 [2021-12-14 11:43:42,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:42,754 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 223 transitions. [2021-12-14 11:43:42,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 11 states have internal predecessors, (88), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 11:43:42,754 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 223 transitions. [2021-12-14 11:43:42,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-12-14 11:43:42,755 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:42,755 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:42,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-12-14 11:43:42,755 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:42,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:42,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1392028993, now seen corresponding path program 1 times [2021-12-14 11:43:42,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:42,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257682476] [2021-12-14 11:43:42,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:42,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:42,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 11:43:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:42,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-14 11:43:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:42,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-14 11:43:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:42,803 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-14 11:43:42,803 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:42,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257682476] [2021-12-14 11:43:42,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257682476] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:42,803 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:42,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 11:43:42,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580879892] [2021-12-14 11:43:42,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:42,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 11:43:42,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:42,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 11:43:42,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 11:43:42,805 INFO L87 Difference]: Start difference. First operand 198 states and 223 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 11:43:42,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:42,871 INFO L93 Difference]: Finished difference Result 250 states and 280 transitions. [2021-12-14 11:43:42,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 11:43:42,872 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 108 [2021-12-14 11:43:42,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:42,872 INFO L225 Difference]: With dead ends: 250 [2021-12-14 11:43:42,872 INFO L226 Difference]: Without dead ends: 190 [2021-12-14 11:43:42,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-14 11:43:42,873 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 136 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:42,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 300 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 11:43:42,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-12-14 11:43:42,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 184. [2021-12-14 11:43:42,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 164 states have (on average 1.1219512195121952) internal successors, (184), 166 states have internal predecessors, (184), 9 states have call successors, (9), 9 states have call predecessors, (9), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2021-12-14 11:43:42,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 203 transitions. [2021-12-14 11:43:42,894 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 203 transitions. Word has length 108 [2021-12-14 11:43:42,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:42,894 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 203 transitions. [2021-12-14 11:43:42,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 11:43:42,894 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 203 transitions. [2021-12-14 11:43:42,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-12-14 11:43:42,895 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:42,895 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:42,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-12-14 11:43:42,896 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:42,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:42,896 INFO L85 PathProgramCache]: Analyzing trace with hash 171236406, now seen corresponding path program 1 times [2021-12-14 11:43:42,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:42,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006982322] [2021-12-14 11:43:42,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:42,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:42,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:42,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 11:43:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:42,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-14 11:43:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:42,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 11:43:42,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:42,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-14 11:43:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:42,959 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-14 11:43:42,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:42,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006982322] [2021-12-14 11:43:42,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006982322] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:42,959 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:42,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 11:43:42,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528096034] [2021-12-14 11:43:42,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:42,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 11:43:42,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:42,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 11:43:42,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-14 11:43:42,961 INFO L87 Difference]: Start difference. First operand 184 states and 203 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 11:43:43,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:43,068 INFO L93 Difference]: Finished difference Result 238 states and 263 transitions. [2021-12-14 11:43:43,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 11:43:43,068 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 114 [2021-12-14 11:43:43,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:43,072 INFO L225 Difference]: With dead ends: 238 [2021-12-14 11:43:43,072 INFO L226 Difference]: Without dead ends: 163 [2021-12-14 11:43:43,073 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-12-14 11:43:43,073 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 46 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:43,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 761 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:43:43,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-12-14 11:43:43,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2021-12-14 11:43:43,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 146 states have (on average 1.1095890410958904) internal successors, (162), 147 states have internal predecessors, (162), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2021-12-14 11:43:43,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 178 transitions. [2021-12-14 11:43:43,082 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 178 transitions. Word has length 114 [2021-12-14 11:43:43,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:43,083 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 178 transitions. [2021-12-14 11:43:43,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 11:43:43,083 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 178 transitions. [2021-12-14 11:43:43,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-12-14 11:43:43,084 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:43,084 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:43,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-12-14 11:43:43,084 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:43,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:43,084 INFO L85 PathProgramCache]: Analyzing trace with hash 2140745716, now seen corresponding path program 1 times [2021-12-14 11:43:43,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:43,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802960818] [2021-12-14 11:43:43,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:43,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:43,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 11:43:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:43,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-14 11:43:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:43,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-14 11:43:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:43,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-14 11:43:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:43,167 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-14 11:43:43,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:43,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802960818] [2021-12-14 11:43:43,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802960818] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:43,168 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:43,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 11:43:43,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745747152] [2021-12-14 11:43:43,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:43,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 11:43:43,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:43,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 11:43:43,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-14 11:43:43,169 INFO L87 Difference]: Start difference. First operand 163 states and 178 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 11:43:43,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:43,374 INFO L93 Difference]: Finished difference Result 334 states and 366 transitions. [2021-12-14 11:43:43,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 11:43:43,374 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 115 [2021-12-14 11:43:43,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:43,375 INFO L225 Difference]: With dead ends: 334 [2021-12-14 11:43:43,375 INFO L226 Difference]: Without dead ends: 163 [2021-12-14 11:43:43,376 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2021-12-14 11:43:43,376 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 130 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:43,376 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 913 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 11:43:43,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-12-14 11:43:43,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2021-12-14 11:43:43,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 146 states have (on average 1.1027397260273972) internal successors, (161), 147 states have internal predecessors, (161), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2021-12-14 11:43:43,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 177 transitions. [2021-12-14 11:43:43,385 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 177 transitions. Word has length 115 [2021-12-14 11:43:43,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:43,386 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 177 transitions. [2021-12-14 11:43:43,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 11:43:43,386 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 177 transitions. [2021-12-14 11:43:43,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-12-14 11:43:43,386 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 11:43:43,387 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 11:43:43,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-12-14 11:43:43,387 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 11:43:43,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 11:43:43,387 INFO L85 PathProgramCache]: Analyzing trace with hash 493382774, now seen corresponding path program 1 times [2021-12-14 11:43:43,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 11:43:43,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732477670] [2021-12-14 11:43:43,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 11:43:43,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 11:43:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:43,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 11:43:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:43,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-14 11:43:43,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:43,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-14 11:43:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:43,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-14 11:43:43,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 11:43:43,493 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-14 11:43:43,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 11:43:43,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732477670] [2021-12-14 11:43:43,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732477670] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 11:43:43,494 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 11:43:43,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-14 11:43:43,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394377628] [2021-12-14 11:43:43,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 11:43:43,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-14 11:43:43,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 11:43:43,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-14 11:43:43,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-12-14 11:43:43,495 INFO L87 Difference]: Start difference. First operand 163 states and 177 transitions. Second operand has 14 states, 14 states have (on average 6.714285714285714) internal successors, (94), 11 states have internal predecessors, (94), 4 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-14 11:43:43,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 11:43:43,826 INFO L93 Difference]: Finished difference Result 176 states and 193 transitions. [2021-12-14 11:43:43,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 11:43:43,827 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.714285714285714) internal successors, (94), 11 states have internal predecessors, (94), 4 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 115 [2021-12-14 11:43:43,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 11:43:43,827 INFO L225 Difference]: With dead ends: 176 [2021-12-14 11:43:43,827 INFO L226 Difference]: Without dead ends: 0 [2021-12-14 11:43:43,828 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2021-12-14 11:43:43,828 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 410 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 11:43:43,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [410 Valid, 829 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 11:43:43,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-14 11:43:43,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-14 11:43:43,828 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:43,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-14 11:43:43,829 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 115 [2021-12-14 11:43:43,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 11:43:43,829 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-14 11:43:43,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.714285714285714) internal successors, (94), 11 states have internal predecessors, (94), 4 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-14 11:43:43,829 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-14 11:43:43,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-14 11:43:43,831 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-14 11:43:43,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-12-14 11:43:43,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.