./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec 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-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f5e490cdb414af150c1a875602a078da9d38c5d6 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-25 20:11:13,425 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:11:13,427 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:11:13,459 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:11:13,459 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:11:13,462 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:11:13,463 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:11:13,467 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:11:13,469 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:11:13,472 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:11:13,473 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:11:13,476 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:11:13,476 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:11:13,478 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:11:13,479 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:11:13,481 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:11:13,482 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:11:13,482 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:11:13,484 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:11:13,489 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:11:13,489 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:11:13,490 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:11:13,491 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:11:13,492 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:11:13,497 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:11:13,497 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:11:13,497 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:11:13,499 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:11:13,499 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:11:13,499 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:11:13,500 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:11:13,500 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:11:13,501 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:11:13,502 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:11:13,502 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:11:13,503 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:11:13,503 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:11:13,503 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:11:13,504 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:11:13,505 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:11:13,505 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:11:13,508 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-25 20:11:13,538 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:11:13,538 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:11:13,539 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:11:13,539 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:11:13,540 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:11:13,540 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:11:13,540 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:11:13,540 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:11:13,540 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:11:13,541 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-25 20:11:13,541 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:11:13,541 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:11:13,541 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:11:13,541 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:11:13,541 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:11:13,541 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:11:13,542 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:11:13,542 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:11:13,542 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:11:13,542 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:11:13,542 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:11:13,542 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:11:13,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:11:13,542 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:11:13,555 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:11:13,555 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:11:13,555 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-25 20:11:13,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-25 20:11:13,556 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:11:13,556 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:11:13,556 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 -> f5e490cdb414af150c1a875602a078da9d38c5d6 [2021-08-25 20:11:13,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:11:13,827 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:11:13,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:11:13,831 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:11:13,831 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:11:13,832 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-1.c [2021-08-25 20:11:13,882 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/326382c96/c5d142604f9d431cb72ec93aff7ff58f/FLAGde304f4cf [2021-08-25 20:11:14,244 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:11:14,245 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-1.c [2021-08-25 20:11:14,256 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/326382c96/c5d142604f9d431cb72ec93aff7ff58f/FLAGde304f4cf [2021-08-25 20:11:14,612 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/326382c96/c5d142604f9d431cb72ec93aff7ff58f [2021-08-25 20:11:14,615 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:11:14,617 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:11:14,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:11:14,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:11:14,622 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:11:14,622 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:11:14" (1/1) ... [2021-08-25 20:11:14,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@274b6699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:14, skipping insertion in model container [2021-08-25 20:11:14,624 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:11:14" (1/1) ... [2021-08-25 20:11:14,628 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:11:14,672 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:11:14,862 WARN L228 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-1.c[48581,48594] [2021-08-25 20:11:14,864 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:11:14,881 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:11:14,966 WARN L228 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-1.c[48581,48594] [2021-08-25 20:11:14,967 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:11:14,984 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:11:14,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:14 WrapperNode [2021-08-25 20:11:14,984 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:11:14,985 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:11:14,985 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:11:14,985 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:11:14,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:14" (1/1) ... [2021-08-25 20:11:15,007 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:14" (1/1) ... [2021-08-25 20:11:15,083 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:11:15,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:11:15,085 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:11:15,085 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:11:15,090 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:14" (1/1) ... [2021-08-25 20:11:15,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:14" (1/1) ... [2021-08-25 20:11:15,105 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:14" (1/1) ... [2021-08-25 20:11:15,106 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:14" (1/1) ... [2021-08-25 20:11:15,145 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:14" (1/1) ... [2021-08-25 20:11:15,156 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:14" (1/1) ... [2021-08-25 20:11:15,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:14" (1/1) ... [2021-08-25 20:11:15,174 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:11:15,176 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:11:15,176 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:11:15,177 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:11:15,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:14" (1/1) ... [2021-08-25 20:11:15,182 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:11:15,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:11:15,196 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-08-25 20:11:15,213 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-08-25 20:11:15,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:11:15,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-25 20:11:15,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:11:15,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:11:15,558 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:15,571 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:15,576 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:15,579 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:15,580 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:15,581 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:15,583 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:15,594 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:15,597 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:15,599 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:15,599 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:15,600 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:15,601 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:15,603 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:15,604 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:15,604 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:15,605 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:15,606 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:15,606 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:15,607 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:15,608 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:15,608 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:15,610 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:15,611 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:15,612 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:15,613 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:15,614 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:15,615 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:15,615 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:15,616 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:16,454 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##658: assume !false; [2021-08-25 20:11:16,454 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##657: assume false; [2021-08-25 20:11:16,454 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##665: assume !false; [2021-08-25 20:11:16,454 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##664: assume false; [2021-08-25 20:11:16,454 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##683: assume false; [2021-08-25 20:11:16,454 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##684: assume !false; [2021-08-25 20:11:16,454 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##609: assume false; [2021-08-25 20:11:16,455 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##610: assume !false; [2021-08-25 20:11:16,455 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##639: assume false; [2021-08-25 20:11:16,455 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##640: assume !false; [2021-08-25 20:11:16,455 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2021-08-25 20:11:16,455 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2021-08-25 20:11:16,455 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##279: assume false; [2021-08-25 20:11:16,455 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##280: assume !false; [2021-08-25 20:11:16,455 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##285: assume !false; [2021-08-25 20:11:16,455 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##284: assume false; [2021-08-25 20:11:16,455 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##229: assume !false; [2021-08-25 20:11:16,455 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##228: assume false; [2021-08-25 20:11:16,456 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##302: assume !false; [2021-08-25 20:11:16,456 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##301: assume false; [2021-08-25 20:11:16,456 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##369: assume !false; [2021-08-25 20:11:16,456 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##375: assume !false; [2021-08-25 20:11:16,456 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##374: assume false; [2021-08-25 20:11:16,456 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##331: assume false; [2021-08-25 20:11:16,456 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##332: assume !false; [2021-08-25 20:11:16,457 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##357: assume false; [2021-08-25 20:11:16,457 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##358: assume !false; [2021-08-25 20:11:16,457 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##368: assume false; [2021-08-25 20:11:16,457 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##404: assume !false; [2021-08-25 20:11:16,457 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##403: assume false; [2021-08-25 20:11:16,457 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##427: assume !false; [2021-08-25 20:11:16,457 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##426: assume false; [2021-08-25 20:11:16,457 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##436: assume !false; [2021-08-25 20:11:16,457 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##435: assume false; [2021-08-25 20:11:16,457 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##439: assume false; [2021-08-25 20:11:16,457 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##440: assume !false; [2021-08-25 20:11:16,458 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##463: assume false; [2021-08-25 20:11:16,458 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##464: assume !false; [2021-08-25 20:11:16,458 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##485: assume !false; [2021-08-25 20:11:16,458 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##484: assume false; [2021-08-25 20:11:16,458 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##524: assume !false; [2021-08-25 20:11:16,458 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##523: assume false; [2021-08-25 20:11:16,458 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##558: assume !false; [2021-08-25 20:11:16,458 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##557: assume false; [2021-08-25 20:11:16,458 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##187: assume !false; [2021-08-25 20:11:16,458 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##186: assume false; [2021-08-25 20:11:16,458 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##68: assume !false; [2021-08-25 20:11:16,458 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##67: assume false; [2021-08-25 20:11:16,458 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##144: assume false; [2021-08-25 20:11:16,459 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##145: assume !false; [2021-08-25 20:11:16,459 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2021-08-25 20:11:16,459 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2021-08-25 20:11:16,459 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##154: assume !false; [2021-08-25 20:11:16,459 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##153: assume false; [2021-08-25 20:11:16,459 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##158: assume !false; [2021-08-25 20:11:16,459 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##157: assume false; [2021-08-25 20:11:16,459 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##588: assume !false; [2021-08-25 20:11:16,459 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##587: assume false; [2021-08-25 20:11:16,459 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !false; [2021-08-25 20:11:16,459 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume false; [2021-08-25 20:11:16,478 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:11:16,478 INFO L299 CfgBuilder]: Removed 277 assume(true) statements. [2021-08-25 20:11:16,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:11:16 BoogieIcfgContainer [2021-08-25 20:11:16,481 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:11:16,482 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:11:16,482 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:11:16,485 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:11:16,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:11:14" (1/3) ... [2021-08-25 20:11:16,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12764142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:11:16, skipping insertion in model container [2021-08-25 20:11:16,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:14" (2/3) ... [2021-08-25 20:11:16,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12764142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:11:16, skipping insertion in model container [2021-08-25 20:11:16,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:11:16" (3/3) ... [2021-08-25 20:11:16,486 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-1.c [2021-08-25 20:11:16,490 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:11:16,490 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 54 error locations. [2021-08-25 20:11:16,526 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:11:16,530 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, mConcurrency=FINITE_AUTOMATA, 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-08-25 20:11:16,530 INFO L340 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2021-08-25 20:11:16,547 INFO L276 IsEmpty]: Start isEmpty. Operand has 572 states, 517 states have (on average 1.6034816247582204) internal successors, (829), 571 states have internal predecessors, (829), 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-08-25 20:11:16,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-25 20:11:16,550 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:16,551 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:11:16,551 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:16,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:16,554 INFO L82 PathProgramCache]: Analyzing trace with hash 538056098, now seen corresponding path program 1 times [2021-08-25 20:11:16,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:16,560 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437844603] [2021-08-25 20:11:16,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:16,560 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:16,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:16,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:16,687 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437844603] [2021-08-25 20:11:16,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437844603] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:16,687 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:16,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:11:16,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394384891] [2021-08-25 20:11:16,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:11:16,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:16,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:11:16,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:16,721 INFO L87 Difference]: Start difference. First operand has 572 states, 517 states have (on average 1.6034816247582204) internal successors, (829), 571 states have internal predecessors, (829), 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) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-08-25 20:11:17,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:17,003 INFO L93 Difference]: Finished difference Result 1136 states and 1626 transitions. [2021-08-25 20:11:17,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:11:17,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) Word has length 10 [2021-08-25 20:11:17,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:17,021 INFO L225 Difference]: With dead ends: 1136 [2021-08-25 20:11:17,022 INFO L226 Difference]: Without dead ends: 692 [2021-08-25 20:11:17,025 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:17,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2021-08-25 20:11:17,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 666. [2021-08-25 20:11:17,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 631 states have (on average 1.434231378763867) internal successors, (905), 665 states have internal predecessors, (905), 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-08-25 20:11:17,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 905 transitions. [2021-08-25 20:11:17,096 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 905 transitions. Word has length 10 [2021-08-25 20:11:17,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:17,097 INFO L470 AbstractCegarLoop]: Abstraction has 666 states and 905 transitions. [2021-08-25 20:11:17,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-08-25 20:11:17,097 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 905 transitions. [2021-08-25 20:11:17,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-25 20:11:17,097 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:17,097 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:11:17,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-25 20:11:17,098 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:17,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:17,098 INFO L82 PathProgramCache]: Analyzing trace with hash 369677969, now seen corresponding path program 1 times [2021-08-25 20:11:17,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:17,099 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082290406] [2021-08-25 20:11:17,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:17,099 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:17,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:17,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:17,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:17,150 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082290406] [2021-08-25 20:11:17,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082290406] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:17,151 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:17,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:11:17,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968772693] [2021-08-25 20:11:17,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:11:17,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:17,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:11:17,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:17,154 INFO L87 Difference]: Start difference. First operand 666 states and 905 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-08-25 20:11:17,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:17,175 INFO L93 Difference]: Finished difference Result 688 states and 930 transitions. [2021-08-25 20:11:17,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:11:17,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) Word has length 11 [2021-08-25 20:11:17,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:17,178 INFO L225 Difference]: With dead ends: 688 [2021-08-25 20:11:17,178 INFO L226 Difference]: Without dead ends: 666 [2021-08-25 20:11:17,179 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:17,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2021-08-25 20:11:17,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2021-08-25 20:11:17,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 631 states have (on average 1.432646592709984) internal successors, (904), 665 states have internal predecessors, (904), 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-08-25 20:11:17,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 904 transitions. [2021-08-25 20:11:17,218 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 904 transitions. Word has length 11 [2021-08-25 20:11:17,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:17,218 INFO L470 AbstractCegarLoop]: Abstraction has 666 states and 904 transitions. [2021-08-25 20:11:17,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-08-25 20:11:17,218 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 904 transitions. [2021-08-25 20:11:17,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-25 20:11:17,219 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:17,219 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:11:17,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-25 20:11:17,220 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:17,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:17,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1535696421, now seen corresponding path program 1 times [2021-08-25 20:11:17,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:17,221 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277571774] [2021-08-25 20:11:17,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:17,222 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:17,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:17,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:17,298 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277571774] [2021-08-25 20:11:17,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277571774] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:17,298 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:17,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:11:17,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815427129] [2021-08-25 20:11:17,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:11:17,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:17,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:11:17,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:17,300 INFO L87 Difference]: Start difference. First operand 666 states and 904 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-08-25 20:11:17,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:17,342 INFO L93 Difference]: Finished difference Result 762 states and 1022 transitions. [2021-08-25 20:11:17,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:11:17,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) Word has length 16 [2021-08-25 20:11:17,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:17,345 INFO L225 Difference]: With dead ends: 762 [2021-08-25 20:11:17,345 INFO L226 Difference]: Without dead ends: 735 [2021-08-25 20:11:17,345 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:17,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2021-08-25 20:11:17,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 686. [2021-08-25 20:11:17,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 654 states have (on average 1.4388379204892967) internal successors, (941), 685 states have internal predecessors, (941), 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-08-25 20:11:17,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 941 transitions. [2021-08-25 20:11:17,366 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 941 transitions. Word has length 16 [2021-08-25 20:11:17,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:17,366 INFO L470 AbstractCegarLoop]: Abstraction has 686 states and 941 transitions. [2021-08-25 20:11:17,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-08-25 20:11:17,366 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 941 transitions. [2021-08-25 20:11:17,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-25 20:11:17,367 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:17,367 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:11:17,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-25 20:11:17,367 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:17,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:17,368 INFO L82 PathProgramCache]: Analyzing trace with hash 107438083, now seen corresponding path program 1 times [2021-08-25 20:11:17,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:17,368 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197986971] [2021-08-25 20:11:17,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:17,368 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:17,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:17,398 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:17,398 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197986971] [2021-08-25 20:11:17,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197986971] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:17,399 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:17,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:11:17,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118159480] [2021-08-25 20:11:17,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:11:17,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:17,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:11:17,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:17,400 INFO L87 Difference]: Start difference. First operand 686 states and 941 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-08-25 20:11:17,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:17,555 INFO L93 Difference]: Finished difference Result 723 states and 987 transitions. [2021-08-25 20:11:17,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:11:17,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) Word has length 19 [2021-08-25 20:11:17,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:17,558 INFO L225 Difference]: With dead ends: 723 [2021-08-25 20:11:17,558 INFO L226 Difference]: Without dead ends: 718 [2021-08-25 20:11:17,559 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:17,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2021-08-25 20:11:17,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 715. [2021-08-25 20:11:17,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 683 states have (on average 1.4333821376281113) internal successors, (979), 714 states have internal predecessors, (979), 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-08-25 20:11:17,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 979 transitions. [2021-08-25 20:11:17,588 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 979 transitions. Word has length 19 [2021-08-25 20:11:17,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:17,589 INFO L470 AbstractCegarLoop]: Abstraction has 715 states and 979 transitions. [2021-08-25 20:11:17,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-08-25 20:11:17,589 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 979 transitions. [2021-08-25 20:11:17,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-25 20:11:17,593 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:17,593 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:11:17,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-25 20:11:17,593 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:17,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:17,594 INFO L82 PathProgramCache]: Analyzing trace with hash 98463890, now seen corresponding path program 1 times [2021-08-25 20:11:17,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:17,595 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258937384] [2021-08-25 20:11:17,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:17,595 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:17,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:17,641 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:17,642 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258937384] [2021-08-25 20:11:17,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258937384] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:17,642 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:17,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:11:17,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889139875] [2021-08-25 20:11:17,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:11:17,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:17,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:11:17,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:17,643 INFO L87 Difference]: Start difference. First operand 715 states and 979 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-08-25 20:11:17,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:17,688 INFO L93 Difference]: Finished difference Result 1230 states and 1671 transitions. [2021-08-25 20:11:17,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:11:17,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) Word has length 19 [2021-08-25 20:11:17,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:17,691 INFO L225 Difference]: With dead ends: 1230 [2021-08-25 20:11:17,691 INFO L226 Difference]: Without dead ends: 858 [2021-08-25 20:11:17,692 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:17,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2021-08-25 20:11:17,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 697. [2021-08-25 20:11:17,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 675 states have (on average 1.4148148148148147) internal successors, (955), 696 states have internal predecessors, (955), 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-08-25 20:11:17,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 955 transitions. [2021-08-25 20:11:17,718 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 955 transitions. Word has length 19 [2021-08-25 20:11:17,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:17,718 INFO L470 AbstractCegarLoop]: Abstraction has 697 states and 955 transitions. [2021-08-25 20:11:17,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-08-25 20:11:17,718 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 955 transitions. [2021-08-25 20:11:17,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-25 20:11:17,718 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:17,718 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:11:17,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-25 20:11:17,719 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:17,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:17,719 INFO L82 PathProgramCache]: Analyzing trace with hash -946806949, now seen corresponding path program 1 times [2021-08-25 20:11:17,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:17,719 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105311043] [2021-08-25 20:11:17,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:17,719 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:17,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:17,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:17,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:17,782 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105311043] [2021-08-25 20:11:17,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105311043] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:17,782 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:17,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:11:17,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386780294] [2021-08-25 20:11:17,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:11:17,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:17,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:11:17,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:11:17,785 INFO L87 Difference]: Start difference. First operand 697 states and 955 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-08-25 20:11:17,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:17,941 INFO L93 Difference]: Finished difference Result 709 states and 965 transitions. [2021-08-25 20:11:17,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:11:17,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) Word has length 20 [2021-08-25 20:11:17,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:17,944 INFO L225 Difference]: With dead ends: 709 [2021-08-25 20:11:17,944 INFO L226 Difference]: Without dead ends: 700 [2021-08-25 20:11:17,945 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:17,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2021-08-25 20:11:17,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 697. [2021-08-25 20:11:17,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 675 states have (on average 1.411851851851852) internal successors, (953), 696 states have internal predecessors, (953), 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-08-25 20:11:17,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 953 transitions. [2021-08-25 20:11:17,966 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 953 transitions. Word has length 20 [2021-08-25 20:11:17,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:17,966 INFO L470 AbstractCegarLoop]: Abstraction has 697 states and 953 transitions. [2021-08-25 20:11:17,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-08-25 20:11:17,967 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 953 transitions. [2021-08-25 20:11:17,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-25 20:11:17,967 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:17,967 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:11:17,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-25 20:11:17,968 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:17,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:17,968 INFO L82 PathProgramCache]: Analyzing trace with hash 180793810, now seen corresponding path program 1 times [2021-08-25 20:11:17,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:17,971 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125561446] [2021-08-25 20:11:17,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:17,971 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:18,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:18,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:18,033 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125561446] [2021-08-25 20:11:18,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125561446] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:18,033 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:18,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:11:18,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942827993] [2021-08-25 20:11:18,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:11:18,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:18,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:11:18,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:11:18,036 INFO L87 Difference]: Start difference. First operand 697 states and 953 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-08-25 20:11:18,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:18,189 INFO L93 Difference]: Finished difference Result 709 states and 963 transitions. [2021-08-25 20:11:18,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:11:18,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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) Word has length 21 [2021-08-25 20:11:18,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:18,193 INFO L225 Difference]: With dead ends: 709 [2021-08-25 20:11:18,193 INFO L226 Difference]: Without dead ends: 700 [2021-08-25 20:11:18,193 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:18,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2021-08-25 20:11:18,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 697. [2021-08-25 20:11:18,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 675 states have (on average 1.4088888888888889) internal successors, (951), 696 states have internal predecessors, (951), 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-08-25 20:11:18,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 951 transitions. [2021-08-25 20:11:18,215 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 951 transitions. Word has length 21 [2021-08-25 20:11:18,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:18,215 INFO L470 AbstractCegarLoop]: Abstraction has 697 states and 951 transitions. [2021-08-25 20:11:18,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-08-25 20:11:18,216 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 951 transitions. [2021-08-25 20:11:18,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-25 20:11:18,216 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:18,216 INFO L512 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-08-25 20:11:18,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-25 20:11:18,217 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:18,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:18,217 INFO L82 PathProgramCache]: Analyzing trace with hash 945683314, now seen corresponding path program 1 times [2021-08-25 20:11:18,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:18,217 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360509625] [2021-08-25 20:11:18,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:18,218 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:18,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:18,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:18,243 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360509625] [2021-08-25 20:11:18,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360509625] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:18,244 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:18,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:11:18,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276299287] [2021-08-25 20:11:18,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:11:18,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:18,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:11:18,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:11:18,245 INFO L87 Difference]: Start difference. First operand 697 states and 951 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-08-25 20:11:18,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:18,291 INFO L93 Difference]: Finished difference Result 709 states and 962 transitions. [2021-08-25 20:11:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:11:18,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) Word has length 22 [2021-08-25 20:11:18,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:18,294 INFO L225 Difference]: With dead ends: 709 [2021-08-25 20:11:18,294 INFO L226 Difference]: Without dead ends: 689 [2021-08-25 20:11:18,295 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:18,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2021-08-25 20:11:18,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2021-08-25 20:11:18,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 667 states have (on average 1.4107946026986506) internal successors, (941), 688 states have internal predecessors, (941), 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-08-25 20:11:18,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 941 transitions. [2021-08-25 20:11:18,322 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 941 transitions. Word has length 22 [2021-08-25 20:11:18,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:18,322 INFO L470 AbstractCegarLoop]: Abstraction has 689 states and 941 transitions. [2021-08-25 20:11:18,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-08-25 20:11:18,322 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 941 transitions. [2021-08-25 20:11:18,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-25 20:11:18,323 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:18,323 INFO L512 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] [2021-08-25 20:11:18,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-25 20:11:18,323 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:18,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:18,324 INFO L82 PathProgramCache]: Analyzing trace with hash 2136813194, now seen corresponding path program 1 times [2021-08-25 20:11:18,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:18,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145682755] [2021-08-25 20:11:18,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:18,324 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:18,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:18,347 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:18,347 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145682755] [2021-08-25 20:11:18,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145682755] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:18,348 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:18,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:11:18,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583145598] [2021-08-25 20:11:18,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:11:18,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:18,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:11:18,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:18,349 INFO L87 Difference]: Start difference. First operand 689 states and 941 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-08-25 20:11:18,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:18,474 INFO L93 Difference]: Finished difference Result 689 states and 941 transitions. [2021-08-25 20:11:18,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:11:18,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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) Word has length 23 [2021-08-25 20:11:18,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:18,476 INFO L225 Difference]: With dead ends: 689 [2021-08-25 20:11:18,476 INFO L226 Difference]: Without dead ends: 673 [2021-08-25 20:11:18,477 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:18,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2021-08-25 20:11:18,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2021-08-25 20:11:18,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 659 states have (on average 1.402124430955994) internal successors, (924), 672 states have internal predecessors, (924), 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-08-25 20:11:18,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 924 transitions. [2021-08-25 20:11:18,497 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 924 transitions. Word has length 23 [2021-08-25 20:11:18,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:18,497 INFO L470 AbstractCegarLoop]: Abstraction has 673 states and 924 transitions. [2021-08-25 20:11:18,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-08-25 20:11:18,498 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 924 transitions. [2021-08-25 20:11:18,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-25 20:11:18,498 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:18,498 INFO L512 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] [2021-08-25 20:11:18,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-25 20:11:18,499 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:18,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:18,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1371761021, now seen corresponding path program 1 times [2021-08-25 20:11:18,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:18,499 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414208] [2021-08-25 20:11:18,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:18,499 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:18,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:18,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:18,529 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:18,529 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414208] [2021-08-25 20:11:18,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414208] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:18,529 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:18,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:11:18,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793973201] [2021-08-25 20:11:18,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:11:18,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:18,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:11:18,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:11:18,530 INFO L87 Difference]: Start difference. First operand 673 states and 924 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-08-25 20:11:18,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:18,571 INFO L93 Difference]: Finished difference Result 806 states and 1074 transitions. [2021-08-25 20:11:18,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 20:11:18,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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) Word has length 25 [2021-08-25 20:11:18,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:18,574 INFO L225 Difference]: With dead ends: 806 [2021-08-25 20:11:18,574 INFO L226 Difference]: Without dead ends: 755 [2021-08-25 20:11:18,574 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:18,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2021-08-25 20:11:18,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 675. [2021-08-25 20:11:18,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 661 states have (on average 1.4009077155824508) internal successors, (926), 674 states have internal predecessors, (926), 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-08-25 20:11:18,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 926 transitions. [2021-08-25 20:11:18,595 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 926 transitions. Word has length 25 [2021-08-25 20:11:18,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:18,596 INFO L470 AbstractCegarLoop]: Abstraction has 675 states and 926 transitions. [2021-08-25 20:11:18,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-08-25 20:11:18,596 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 926 transitions. [2021-08-25 20:11:18,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-25 20:11:18,597 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:18,597 INFO L512 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] [2021-08-25 20:11:18,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-25 20:11:18,597 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:18,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:18,597 INFO L82 PathProgramCache]: Analyzing trace with hash 458344375, now seen corresponding path program 1 times [2021-08-25 20:11:18,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:18,598 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400390419] [2021-08-25 20:11:18,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:18,598 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:18,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:18,622 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:18,622 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400390419] [2021-08-25 20:11:18,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400390419] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:18,622 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:18,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:11:18,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569283818] [2021-08-25 20:11:18,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:11:18,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:18,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:11:18,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:11:18,623 INFO L87 Difference]: Start difference. First operand 675 states and 926 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-08-25 20:11:18,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:18,661 INFO L93 Difference]: Finished difference Result 688 states and 938 transitions. [2021-08-25 20:11:18,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:11:18,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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) Word has length 26 [2021-08-25 20:11:18,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:18,663 INFO L225 Difference]: With dead ends: 688 [2021-08-25 20:11:18,664 INFO L226 Difference]: Without dead ends: 673 [2021-08-25 20:11:18,664 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:18,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2021-08-25 20:11:18,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2021-08-25 20:11:18,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 659 states have (on average 1.4006069802731411) internal successors, (923), 672 states have internal predecessors, (923), 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-08-25 20:11:18,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 923 transitions. [2021-08-25 20:11:18,684 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 923 transitions. Word has length 26 [2021-08-25 20:11:18,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:18,684 INFO L470 AbstractCegarLoop]: Abstraction has 673 states and 923 transitions. [2021-08-25 20:11:18,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-08-25 20:11:18,685 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 923 transitions. [2021-08-25 20:11:18,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-25 20:11:18,685 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:18,685 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:11:18,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-25 20:11:18,686 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:18,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:18,686 INFO L82 PathProgramCache]: Analyzing trace with hash 2044140679, now seen corresponding path program 1 times [2021-08-25 20:11:18,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:18,686 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620823738] [2021-08-25 20:11:18,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:18,687 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:18,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:18,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:18,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:18,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620823738] [2021-08-25 20:11:18,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620823738] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:18,712 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:18,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:11:18,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706204206] [2021-08-25 20:11:18,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:11:18,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:18,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:11:18,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:11:18,713 INFO L87 Difference]: Start difference. First operand 673 states and 923 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-08-25 20:11:18,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:18,758 INFO L93 Difference]: Finished difference Result 711 states and 962 transitions. [2021-08-25 20:11:18,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:11:18,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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) Word has length 27 [2021-08-25 20:11:18,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:18,761 INFO L225 Difference]: With dead ends: 711 [2021-08-25 20:11:18,761 INFO L226 Difference]: Without dead ends: 690 [2021-08-25 20:11:18,762 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:18,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2021-08-25 20:11:18,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 675. [2021-08-25 20:11:18,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 661 states have (on average 1.399394856278366) internal successors, (925), 674 states have internal predecessors, (925), 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-08-25 20:11:18,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 925 transitions. [2021-08-25 20:11:18,779 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 925 transitions. Word has length 27 [2021-08-25 20:11:18,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:18,780 INFO L470 AbstractCegarLoop]: Abstraction has 675 states and 925 transitions. [2021-08-25 20:11:18,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-08-25 20:11:18,780 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 925 transitions. [2021-08-25 20:11:18,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-25 20:11:18,781 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:18,781 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:11:18,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-25 20:11:18,781 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:18,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:18,781 INFO L82 PathProgramCache]: Analyzing trace with hash -610986493, now seen corresponding path program 1 times [2021-08-25 20:11:18,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:18,781 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980817968] [2021-08-25 20:11:18,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:18,782 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:18,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:18,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:18,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:18,809 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980817968] [2021-08-25 20:11:18,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980817968] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:18,809 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:18,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:11:18,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716248300] [2021-08-25 20:11:18,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:11:18,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:18,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:11:18,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:18,812 INFO L87 Difference]: Start difference. First operand 675 states and 925 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-08-25 20:11:18,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:18,839 INFO L93 Difference]: Finished difference Result 708 states and 960 transitions. [2021-08-25 20:11:18,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:11:18,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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) Word has length 27 [2021-08-25 20:11:18,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:18,842 INFO L225 Difference]: With dead ends: 708 [2021-08-25 20:11:18,842 INFO L226 Difference]: Without dead ends: 666 [2021-08-25 20:11:18,842 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:18,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2021-08-25 20:11:18,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 661. [2021-08-25 20:11:18,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 647 states have (on average 1.39258114374034) internal successors, (901), 660 states have internal predecessors, (901), 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-08-25 20:11:18,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 901 transitions. [2021-08-25 20:11:18,861 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 901 transitions. Word has length 27 [2021-08-25 20:11:18,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:18,861 INFO L470 AbstractCegarLoop]: Abstraction has 661 states and 901 transitions. [2021-08-25 20:11:18,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-08-25 20:11:18,861 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 901 transitions. [2021-08-25 20:11:18,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-25 20:11:18,862 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:18,862 INFO L512 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-08-25 20:11:18,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-25 20:11:18,863 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:18,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:18,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1636712997, now seen corresponding path program 1 times [2021-08-25 20:11:18,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:18,863 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128457452] [2021-08-25 20:11:18,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:18,864 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:18,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-08-25 20:11:18,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:18,898 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128457452] [2021-08-25 20:11:18,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128457452] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:18,899 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:18,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:11:18,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550166414] [2021-08-25 20:11:18,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:11:18,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:18,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:11:18,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:11:18,900 INFO L87 Difference]: Start difference. First operand 661 states and 901 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-08-25 20:11:18,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:18,941 INFO L93 Difference]: Finished difference Result 699 states and 940 transitions. [2021-08-25 20:11:18,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:11:18,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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) Word has length 28 [2021-08-25 20:11:18,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:18,944 INFO L225 Difference]: With dead ends: 699 [2021-08-25 20:11:18,944 INFO L226 Difference]: Without dead ends: 678 [2021-08-25 20:11:18,945 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:18,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2021-08-25 20:11:18,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 661. [2021-08-25 20:11:18,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 647 states have (on average 1.39258114374034) internal successors, (901), 660 states have internal predecessors, (901), 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-08-25 20:11:18,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 901 transitions. [2021-08-25 20:11:18,966 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 901 transitions. Word has length 28 [2021-08-25 20:11:18,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:18,967 INFO L470 AbstractCegarLoop]: Abstraction has 661 states and 901 transitions. [2021-08-25 20:11:18,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-08-25 20:11:18,967 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 901 transitions. [2021-08-25 20:11:18,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-25 20:11:18,967 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:18,968 INFO L512 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-08-25 20:11:18,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-25 20:11:18,968 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:18,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:18,968 INFO L82 PathProgramCache]: Analyzing trace with hash 830792837, now seen corresponding path program 1 times [2021-08-25 20:11:18,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:18,969 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333288776] [2021-08-25 20:11:18,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:18,969 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:18,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:18,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:18,992 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333288776] [2021-08-25 20:11:18,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333288776] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:18,992 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:18,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:11:18,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325278342] [2021-08-25 20:11:18,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:11:18,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:18,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:11:18,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:18,993 INFO L87 Difference]: Start difference. First operand 661 states and 901 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-08-25 20:11:19,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:19,124 INFO L93 Difference]: Finished difference Result 840 states and 1143 transitions. [2021-08-25 20:11:19,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:11:19,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) Word has length 28 [2021-08-25 20:11:19,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:19,128 INFO L225 Difference]: With dead ends: 840 [2021-08-25 20:11:19,128 INFO L226 Difference]: Without dead ends: 832 [2021-08-25 20:11:19,130 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:19,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2021-08-25 20:11:19,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 679. [2021-08-25 20:11:19,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 665 states have (on average 1.3954887218045113) internal successors, (928), 678 states have internal predecessors, (928), 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-08-25 20:11:19,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 928 transitions. [2021-08-25 20:11:19,150 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 928 transitions. Word has length 28 [2021-08-25 20:11:19,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:19,150 INFO L470 AbstractCegarLoop]: Abstraction has 679 states and 928 transitions. [2021-08-25 20:11:19,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-08-25 20:11:19,150 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 928 transitions. [2021-08-25 20:11:19,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-25 20:11:19,151 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:19,151 INFO L512 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-08-25 20:11:19,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-25 20:11:19,152 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:19,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:19,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1706944907, now seen corresponding path program 1 times [2021-08-25 20:11:19,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:19,152 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185042871] [2021-08-25 20:11:19,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:19,153 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:19,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:19,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-08-25 20:11:19,186 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:19,186 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185042871] [2021-08-25 20:11:19,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185042871] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:19,187 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:19,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:11:19,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849730074] [2021-08-25 20:11:19,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:11:19,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:19,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:11:19,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:11:19,188 INFO L87 Difference]: Start difference. First operand 679 states and 928 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-08-25 20:11:19,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:19,234 INFO L93 Difference]: Finished difference Result 692 states and 940 transitions. [2021-08-25 20:11:19,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:11:19,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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) Word has length 28 [2021-08-25 20:11:19,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:19,236 INFO L225 Difference]: With dead ends: 692 [2021-08-25 20:11:19,236 INFO L226 Difference]: Without dead ends: 677 [2021-08-25 20:11:19,237 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:19,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2021-08-25 20:11:19,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 677. [2021-08-25 20:11:19,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 663 states have (on average 1.3951734539969833) internal successors, (925), 676 states have internal predecessors, (925), 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-08-25 20:11:19,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 925 transitions. [2021-08-25 20:11:19,261 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 925 transitions. Word has length 28 [2021-08-25 20:11:19,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:19,261 INFO L470 AbstractCegarLoop]: Abstraction has 677 states and 925 transitions. [2021-08-25 20:11:19,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-08-25 20:11:19,262 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 925 transitions. [2021-08-25 20:11:19,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-25 20:11:19,262 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:19,262 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:11:19,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-25 20:11:19,263 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:19,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:19,263 INFO L82 PathProgramCache]: Analyzing trace with hash -22883762, now seen corresponding path program 1 times [2021-08-25 20:11:19,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:19,263 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139040013] [2021-08-25 20:11:19,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:19,264 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:19,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:19,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:19,305 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139040013] [2021-08-25 20:11:19,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139040013] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:19,305 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:19,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:11:19,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299257773] [2021-08-25 20:11:19,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:11:19,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:19,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:11:19,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:11:19,307 INFO L87 Difference]: Start difference. First operand 677 states and 925 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-08-25 20:11:19,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:19,474 INFO L93 Difference]: Finished difference Result 962 states and 1282 transitions. [2021-08-25 20:11:19,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:11:19,475 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), 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) Word has length 29 [2021-08-25 20:11:19,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:19,477 INFO L225 Difference]: With dead ends: 962 [2021-08-25 20:11:19,477 INFO L226 Difference]: Without dead ends: 711 [2021-08-25 20:11:19,477 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:19,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2021-08-25 20:11:19,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 660. [2021-08-25 20:11:19,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 647 states have (on average 1.3740340030911902) internal successors, (889), 659 states have internal predecessors, (889), 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-08-25 20:11:19,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 889 transitions. [2021-08-25 20:11:19,498 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 889 transitions. Word has length 29 [2021-08-25 20:11:19,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:19,498 INFO L470 AbstractCegarLoop]: Abstraction has 660 states and 889 transitions. [2021-08-25 20:11:19,499 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), 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-08-25 20:11:19,499 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 889 transitions. [2021-08-25 20:11:19,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-25 20:11:19,499 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:19,499 INFO L512 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-08-25 20:11:19,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-25 20:11:19,500 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:19,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:19,500 INFO L82 PathProgramCache]: Analyzing trace with hash -879074465, now seen corresponding path program 1 times [2021-08-25 20:11:19,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:19,500 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625906588] [2021-08-25 20:11:19,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:19,501 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:19,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:19,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:19,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625906588] [2021-08-25 20:11:19,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625906588] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:19,543 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:19,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:11:19,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629207204] [2021-08-25 20:11:19,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:11:19,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:19,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:11:19,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:19,545 INFO L87 Difference]: Start difference. First operand 660 states and 889 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-08-25 20:11:19,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:19,601 INFO L93 Difference]: Finished difference Result 677 states and 905 transitions. [2021-08-25 20:11:19,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 20:11:19,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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) Word has length 31 [2021-08-25 20:11:19,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:19,603 INFO L225 Difference]: With dead ends: 677 [2021-08-25 20:11:19,603 INFO L226 Difference]: Without dead ends: 660 [2021-08-25 20:11:19,603 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-25 20:11:19,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2021-08-25 20:11:19,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2021-08-25 20:11:19,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 647 states have (on average 1.3554868624420402) internal successors, (877), 659 states have internal predecessors, (877), 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-08-25 20:11:19,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 877 transitions. [2021-08-25 20:11:19,626 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 877 transitions. Word has length 31 [2021-08-25 20:11:19,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:19,626 INFO L470 AbstractCegarLoop]: Abstraction has 660 states and 877 transitions. [2021-08-25 20:11:19,626 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-08-25 20:11:19,626 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 877 transitions. [2021-08-25 20:11:19,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-25 20:11:19,626 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:19,626 INFO L512 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-08-25 20:11:19,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-25 20:11:19,628 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:19,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:19,628 INFO L82 PathProgramCache]: Analyzing trace with hash 932056973, now seen corresponding path program 1 times [2021-08-25 20:11:19,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:19,628 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371554755] [2021-08-25 20:11:19,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:19,628 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:19,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:19,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:19,665 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:19,665 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371554755] [2021-08-25 20:11:19,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371554755] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:19,665 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:19,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:11:19,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283198161] [2021-08-25 20:11:19,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:11:19,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:19,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:11:19,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:11:19,667 INFO L87 Difference]: Start difference. First operand 660 states and 877 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-08-25 20:11:19,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:19,810 INFO L93 Difference]: Finished difference Result 732 states and 957 transitions. [2021-08-25 20:11:19,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:11:19,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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) Word has length 31 [2021-08-25 20:11:19,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:19,812 INFO L225 Difference]: With dead ends: 732 [2021-08-25 20:11:19,812 INFO L226 Difference]: Without dead ends: 662 [2021-08-25 20:11:19,813 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:19,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2021-08-25 20:11:19,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 660. [2021-08-25 20:11:19,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 647 states have (on average 1.3415765069551777) internal successors, (868), 659 states have internal predecessors, (868), 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-08-25 20:11:19,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 868 transitions. [2021-08-25 20:11:19,838 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 868 transitions. Word has length 31 [2021-08-25 20:11:19,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:19,838 INFO L470 AbstractCegarLoop]: Abstraction has 660 states and 868 transitions. [2021-08-25 20:11:19,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-08-25 20:11:19,838 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 868 transitions. [2021-08-25 20:11:19,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-25 20:11:19,839 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:19,839 INFO L512 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-08-25 20:11:19,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-25 20:11:19,840 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:19,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:19,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1700782205, now seen corresponding path program 1 times [2021-08-25 20:11:19,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:19,840 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945260048] [2021-08-25 20:11:19,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:19,840 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:19,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:19,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:19,860 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:19,860 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945260048] [2021-08-25 20:11:19,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945260048] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:19,860 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:19,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:11:19,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694657089] [2021-08-25 20:11:19,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:11:19,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:19,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:11:19,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:19,861 INFO L87 Difference]: Start difference. First operand 660 states and 868 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-08-25 20:11:19,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:19,962 INFO L93 Difference]: Finished difference Result 868 states and 1144 transitions. [2021-08-25 20:11:19,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:11:19,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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) Word has length 31 [2021-08-25 20:11:19,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:19,964 INFO L225 Difference]: With dead ends: 868 [2021-08-25 20:11:19,964 INFO L226 Difference]: Without dead ends: 662 [2021-08-25 20:11:19,965 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:19,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2021-08-25 20:11:19,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2021-08-25 20:11:19,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 651 states have (on average 1.337941628264209) internal successors, (871), 661 states have internal predecessors, (871), 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-08-25 20:11:19,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 871 transitions. [2021-08-25 20:11:19,986 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 871 transitions. Word has length 31 [2021-08-25 20:11:19,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:19,986 INFO L470 AbstractCegarLoop]: Abstraction has 662 states and 871 transitions. [2021-08-25 20:11:19,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-08-25 20:11:19,986 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 871 transitions. [2021-08-25 20:11:19,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-25 20:11:19,987 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:19,987 INFO L512 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-08-25 20:11:19,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-25 20:11:19,987 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:19,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:19,988 INFO L82 PathProgramCache]: Analyzing trace with hash -191087949, now seen corresponding path program 1 times [2021-08-25 20:11:19,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:19,988 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468813547] [2021-08-25 20:11:19,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:19,988 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:20,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:20,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:20,023 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468813547] [2021-08-25 20:11:20,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468813547] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:20,023 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:20,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-25 20:11:20,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514020108] [2021-08-25 20:11:20,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:11:20,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:20,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:11:20,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:11:20,024 INFO L87 Difference]: Start difference. First operand 662 states and 871 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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-08-25 20:11:20,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:20,108 INFO L93 Difference]: Finished difference Result 729 states and 940 transitions. [2021-08-25 20:11:20,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-25 20:11:20,108 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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) Word has length 32 [2021-08-25 20:11:20,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:20,110 INFO L225 Difference]: With dead ends: 729 [2021-08-25 20:11:20,110 INFO L226 Difference]: Without dead ends: 683 [2021-08-25 20:11:20,111 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 26.6ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-08-25 20:11:20,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2021-08-25 20:11:20,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 650. [2021-08-25 20:11:20,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 639 states have (on average 1.3348982785602503) internal successors, (853), 649 states have internal predecessors, (853), 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-08-25 20:11:20,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 853 transitions. [2021-08-25 20:11:20,133 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 853 transitions. Word has length 32 [2021-08-25 20:11:20,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:20,133 INFO L470 AbstractCegarLoop]: Abstraction has 650 states and 853 transitions. [2021-08-25 20:11:20,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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-08-25 20:11:20,133 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 853 transitions. [2021-08-25 20:11:20,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-25 20:11:20,134 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:20,134 INFO L512 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-08-25 20:11:20,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-25 20:11:20,134 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:20,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:20,135 INFO L82 PathProgramCache]: Analyzing trace with hash -311747134, now seen corresponding path program 1 times [2021-08-25 20:11:20,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:20,135 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322442298] [2021-08-25 20:11:20,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:20,135 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:20,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:20,169 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:20,169 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322442298] [2021-08-25 20:11:20,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322442298] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:20,169 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:20,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-25 20:11:20,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194040386] [2021-08-25 20:11:20,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:11:20,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:20,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:11:20,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:11:20,170 INFO L87 Difference]: Start difference. First operand 650 states and 853 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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-08-25 20:11:20,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:20,225 INFO L93 Difference]: Finished difference Result 662 states and 864 transitions. [2021-08-25 20:11:20,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:11:20,227 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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) Word has length 32 [2021-08-25 20:11:20,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:20,229 INFO L225 Difference]: With dead ends: 662 [2021-08-25 20:11:20,229 INFO L226 Difference]: Without dead ends: 641 [2021-08-25 20:11:20,230 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.4ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-08-25 20:11:20,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2021-08-25 20:11:20,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2021-08-25 20:11:20,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 630 states have (on average 1.3349206349206348) internal successors, (841), 640 states have internal predecessors, (841), 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-08-25 20:11:20,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 841 transitions. [2021-08-25 20:11:20,252 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 841 transitions. Word has length 32 [2021-08-25 20:11:20,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:20,253 INFO L470 AbstractCegarLoop]: Abstraction has 641 states and 841 transitions. [2021-08-25 20:11:20,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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-08-25 20:11:20,253 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 841 transitions. [2021-08-25 20:11:20,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-25 20:11:20,253 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:20,254 INFO L512 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-08-25 20:11:20,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-25 20:11:20,254 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:20,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:20,254 INFO L82 PathProgramCache]: Analyzing trace with hash -909472821, now seen corresponding path program 1 times [2021-08-25 20:11:20,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:20,254 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886315099] [2021-08-25 20:11:20,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:20,255 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:20,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:20,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:20,273 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886315099] [2021-08-25 20:11:20,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886315099] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:20,273 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:20,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:11:20,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048356391] [2021-08-25 20:11:20,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:11:20,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:20,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:11:20,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:20,274 INFO L87 Difference]: Start difference. First operand 641 states and 841 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-08-25 20:11:20,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:20,319 INFO L93 Difference]: Finished difference Result 821 states and 1071 transitions. [2021-08-25 20:11:20,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:11:20,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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) Word has length 32 [2021-08-25 20:11:20,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:20,321 INFO L225 Difference]: With dead ends: 821 [2021-08-25 20:11:20,321 INFO L226 Difference]: Without dead ends: 617 [2021-08-25 20:11:20,322 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:20,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2021-08-25 20:11:20,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 601. [2021-08-25 20:11:20,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 590 states have (on average 1.3271186440677967) internal successors, (783), 600 states have internal predecessors, (783), 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-08-25 20:11:20,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 783 transitions. [2021-08-25 20:11:20,351 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 783 transitions. Word has length 32 [2021-08-25 20:11:20,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:20,351 INFO L470 AbstractCegarLoop]: Abstraction has 601 states and 783 transitions. [2021-08-25 20:11:20,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-08-25 20:11:20,351 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 783 transitions. [2021-08-25 20:11:20,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-25 20:11:20,352 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:20,352 INFO L512 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-08-25 20:11:20,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-25 20:11:20,353 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:20,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:20,353 INFO L82 PathProgramCache]: Analyzing trace with hash -353842307, now seen corresponding path program 1 times [2021-08-25 20:11:20,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:20,353 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880929950] [2021-08-25 20:11:20,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:20,354 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:20,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:20,381 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:20,382 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880929950] [2021-08-25 20:11:20,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880929950] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:20,382 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:20,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:11:20,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23111892] [2021-08-25 20:11:20,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:11:20,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:20,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:11:20,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:20,383 INFO L87 Difference]: Start difference. First operand 601 states and 783 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-08-25 20:11:20,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:20,438 INFO L93 Difference]: Finished difference Result 644 states and 827 transitions. [2021-08-25 20:11:20,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 20:11:20,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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) Word has length 33 [2021-08-25 20:11:20,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:20,440 INFO L225 Difference]: With dead ends: 644 [2021-08-25 20:11:20,440 INFO L226 Difference]: Without dead ends: 620 [2021-08-25 20:11:20,440 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-25 20:11:20,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2021-08-25 20:11:20,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 601. [2021-08-25 20:11:20,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 590 states have (on average 1.3254237288135593) internal successors, (782), 600 states have internal predecessors, (782), 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-08-25 20:11:20,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 782 transitions. [2021-08-25 20:11:20,461 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 782 transitions. Word has length 33 [2021-08-25 20:11:20,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:20,462 INFO L470 AbstractCegarLoop]: Abstraction has 601 states and 782 transitions. [2021-08-25 20:11:20,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-08-25 20:11:20,462 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 782 transitions. [2021-08-25 20:11:20,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-25 20:11:20,462 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:20,463 INFO L512 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-08-25 20:11:20,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-25 20:11:20,463 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:20,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:20,463 INFO L82 PathProgramCache]: Analyzing trace with hash -56726392, now seen corresponding path program 1 times [2021-08-25 20:11:20,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:20,463 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463970986] [2021-08-25 20:11:20,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:20,464 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:20,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:20,481 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:20,481 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463970986] [2021-08-25 20:11:20,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463970986] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:20,481 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:20,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:11:20,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981311867] [2021-08-25 20:11:20,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:11:20,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:20,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:11:20,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:20,483 INFO L87 Difference]: Start difference. First operand 601 states and 782 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-08-25 20:11:20,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:20,590 INFO L93 Difference]: Finished difference Result 732 states and 939 transitions. [2021-08-25 20:11:20,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:11:20,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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) Word has length 33 [2021-08-25 20:11:20,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:20,592 INFO L225 Difference]: With dead ends: 732 [2021-08-25 20:11:20,592 INFO L226 Difference]: Without dead ends: 712 [2021-08-25 20:11:20,593 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:20,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2021-08-25 20:11:20,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 651. [2021-08-25 20:11:20,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 640 states have (on average 1.309375) internal successors, (838), 650 states have internal predecessors, (838), 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-08-25 20:11:20,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 838 transitions. [2021-08-25 20:11:20,634 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 838 transitions. Word has length 33 [2021-08-25 20:11:20,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:20,634 INFO L470 AbstractCegarLoop]: Abstraction has 651 states and 838 transitions. [2021-08-25 20:11:20,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-08-25 20:11:20,634 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 838 transitions. [2021-08-25 20:11:20,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-25 20:11:20,635 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:20,635 INFO L512 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-08-25 20:11:20,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-25 20:11:20,635 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:20,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:20,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1257835912, now seen corresponding path program 1 times [2021-08-25 20:11:20,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:20,636 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633243487] [2021-08-25 20:11:20,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:20,636 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:20,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:20,653 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:20,653 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633243487] [2021-08-25 20:11:20,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633243487] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:20,653 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:20,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:11:20,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195057188] [2021-08-25 20:11:20,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:11:20,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:20,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:11:20,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:20,654 INFO L87 Difference]: Start difference. First operand 651 states and 838 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-08-25 20:11:20,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:20,772 INFO L93 Difference]: Finished difference Result 1258 states and 1614 transitions. [2021-08-25 20:11:20,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:11:20,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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) Word has length 33 [2021-08-25 20:11:20,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:20,775 INFO L225 Difference]: With dead ends: 1258 [2021-08-25 20:11:20,775 INFO L226 Difference]: Without dead ends: 984 [2021-08-25 20:11:20,776 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:20,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2021-08-25 20:11:20,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 688. [2021-08-25 20:11:20,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 677 states have (on average 1.3116691285081241) internal successors, (888), 687 states have internal predecessors, (888), 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-08-25 20:11:20,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 888 transitions. [2021-08-25 20:11:20,803 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 888 transitions. Word has length 33 [2021-08-25 20:11:20,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:20,803 INFO L470 AbstractCegarLoop]: Abstraction has 688 states and 888 transitions. [2021-08-25 20:11:20,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-08-25 20:11:20,803 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 888 transitions. [2021-08-25 20:11:20,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-25 20:11:20,804 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:20,804 INFO L512 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-08-25 20:11:20,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-25 20:11:20,804 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:20,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:20,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1516001350, now seen corresponding path program 1 times [2021-08-25 20:11:20,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:20,805 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709654058] [2021-08-25 20:11:20,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:20,805 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:20,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:20,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:20,827 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:20,827 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709654058] [2021-08-25 20:11:20,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709654058] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:20,827 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:20,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:11:20,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128955549] [2021-08-25 20:11:20,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:11:20,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:20,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:11:20,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:11:20,828 INFO L87 Difference]: Start difference. First operand 688 states and 888 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-08-25 20:11:20,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:20,941 INFO L93 Difference]: Finished difference Result 712 states and 912 transitions. [2021-08-25 20:11:20,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:11:20,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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) Word has length 33 [2021-08-25 20:11:20,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:20,943 INFO L225 Difference]: With dead ends: 712 [2021-08-25 20:11:20,943 INFO L226 Difference]: Without dead ends: 625 [2021-08-25 20:11:20,944 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:20,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2021-08-25 20:11:20,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 607. [2021-08-25 20:11:20,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 596 states have (on average 1.2969798657718121) internal successors, (773), 606 states have internal predecessors, (773), 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-08-25 20:11:20,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 773 transitions. [2021-08-25 20:11:20,967 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 773 transitions. Word has length 33 [2021-08-25 20:11:20,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:20,968 INFO L470 AbstractCegarLoop]: Abstraction has 607 states and 773 transitions. [2021-08-25 20:11:20,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-08-25 20:11:20,968 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 773 transitions. [2021-08-25 20:11:20,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-25 20:11:20,968 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:20,968 INFO L512 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-08-25 20:11:20,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-25 20:11:20,969 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:20,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:20,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1740926462, now seen corresponding path program 1 times [2021-08-25 20:11:20,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:20,969 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359514010] [2021-08-25 20:11:20,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:20,970 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:21,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:21,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:21,000 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359514010] [2021-08-25 20:11:21,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359514010] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:21,000 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:21,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-25 20:11:21,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556084748] [2021-08-25 20:11:21,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:11:21,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:21,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:11:21,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:11:21,001 INFO L87 Difference]: Start difference. First operand 607 states and 773 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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-08-25 20:11:21,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:21,148 INFO L93 Difference]: Finished difference Result 645 states and 809 transitions. [2021-08-25 20:11:21,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-25 20:11:21,148 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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) Word has length 34 [2021-08-25 20:11:21,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:21,150 INFO L225 Difference]: With dead ends: 645 [2021-08-25 20:11:21,150 INFO L226 Difference]: Without dead ends: 642 [2021-08-25 20:11:21,150 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.1ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-08-25 20:11:21,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2021-08-25 20:11:21,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 612. [2021-08-25 20:11:21,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 601 states have (on average 1.2945091514143094) internal successors, (778), 611 states have internal predecessors, (778), 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-08-25 20:11:21,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 778 transitions. [2021-08-25 20:11:21,175 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 778 transitions. Word has length 34 [2021-08-25 20:11:21,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:21,175 INFO L470 AbstractCegarLoop]: Abstraction has 612 states and 778 transitions. [2021-08-25 20:11:21,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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-08-25 20:11:21,175 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 778 transitions. [2021-08-25 20:11:21,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-25 20:11:21,176 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:21,176 INFO L512 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-08-25 20:11:21,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-25 20:11:21,176 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:21,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:21,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1740938378, now seen corresponding path program 1 times [2021-08-25 20:11:21,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:21,177 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405427322] [2021-08-25 20:11:21,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:21,177 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:21,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:21,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:21,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:21,209 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405427322] [2021-08-25 20:11:21,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405427322] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:21,210 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:21,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-25 20:11:21,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645147975] [2021-08-25 20:11:21,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:11:21,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:21,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:11:21,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:11:21,211 INFO L87 Difference]: Start difference. First operand 612 states and 778 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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-08-25 20:11:21,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:21,395 INFO L93 Difference]: Finished difference Result 895 states and 1122 transitions. [2021-08-25 20:11:21,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-25 20:11:21,395 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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) Word has length 34 [2021-08-25 20:11:21,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:21,397 INFO L225 Difference]: With dead ends: 895 [2021-08-25 20:11:21,398 INFO L226 Difference]: Without dead ends: 872 [2021-08-25 20:11:21,399 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 26.6ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-08-25 20:11:21,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2021-08-25 20:11:21,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 610. [2021-08-25 20:11:21,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 599 states have (on average 1.2921535893155258) internal successors, (774), 609 states have internal predecessors, (774), 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-08-25 20:11:21,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 774 transitions. [2021-08-25 20:11:21,434 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 774 transitions. Word has length 34 [2021-08-25 20:11:21,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:21,434 INFO L470 AbstractCegarLoop]: Abstraction has 610 states and 774 transitions. [2021-08-25 20:11:21,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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-08-25 20:11:21,435 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 774 transitions. [2021-08-25 20:11:21,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-25 20:11:21,436 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:21,436 INFO L512 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-08-25 20:11:21,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-25 20:11:21,437 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:21,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:21,437 INFO L82 PathProgramCache]: Analyzing trace with hash -935530627, now seen corresponding path program 1 times [2021-08-25 20:11:21,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:21,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401659318] [2021-08-25 20:11:21,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:21,438 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:21,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:21,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:21,480 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401659318] [2021-08-25 20:11:21,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401659318] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:21,481 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:21,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:11:21,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913418861] [2021-08-25 20:11:21,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:11:21,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:21,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:11:21,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:11:21,482 INFO L87 Difference]: Start difference. First operand 610 states and 774 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-08-25 20:11:21,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:21,594 INFO L93 Difference]: Finished difference Result 670 states and 852 transitions. [2021-08-25 20:11:21,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:11:21,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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) Word has length 35 [2021-08-25 20:11:21,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:21,597 INFO L225 Difference]: With dead ends: 670 [2021-08-25 20:11:21,597 INFO L226 Difference]: Without dead ends: 629 [2021-08-25 20:11:21,598 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:21,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2021-08-25 20:11:21,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 576. [2021-08-25 20:11:21,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 565 states have (on average 1.2991150442477877) internal successors, (734), 575 states have internal predecessors, (734), 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-08-25 20:11:21,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 734 transitions. [2021-08-25 20:11:21,634 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 734 transitions. Word has length 35 [2021-08-25 20:11:21,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:21,634 INFO L470 AbstractCegarLoop]: Abstraction has 576 states and 734 transitions. [2021-08-25 20:11:21,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-08-25 20:11:21,634 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 734 transitions. [2021-08-25 20:11:21,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-25 20:11:21,635 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:21,635 INFO L512 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-08-25 20:11:21,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-25 20:11:21,636 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:21,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:21,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1333490113, now seen corresponding path program 1 times [2021-08-25 20:11:21,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:21,636 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844073823] [2021-08-25 20:11:21,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:21,637 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:21,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:21,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:21,670 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844073823] [2021-08-25 20:11:21,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844073823] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:21,671 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:21,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:11:21,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877474811] [2021-08-25 20:11:21,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:11:21,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:21,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:11:21,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:21,672 INFO L87 Difference]: Start difference. First operand 576 states and 734 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-08-25 20:11:21,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:21,846 INFO L93 Difference]: Finished difference Result 1269 states and 1627 transitions. [2021-08-25 20:11:21,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-25 20:11:21,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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) Word has length 35 [2021-08-25 20:11:21,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:21,850 INFO L225 Difference]: With dead ends: 1269 [2021-08-25 20:11:21,850 INFO L226 Difference]: Without dead ends: 1083 [2021-08-25 20:11:21,850 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 18.5ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:11:21,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2021-08-25 20:11:21,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 583. [2021-08-25 20:11:21,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 572 states have (on average 1.2954545454545454) internal successors, (741), 582 states have internal predecessors, (741), 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-08-25 20:11:21,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 741 transitions. [2021-08-25 20:11:21,878 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 741 transitions. Word has length 35 [2021-08-25 20:11:21,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:21,879 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 741 transitions. [2021-08-25 20:11:21,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-08-25 20:11:21,879 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 741 transitions. [2021-08-25 20:11:21,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-25 20:11:21,879 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:21,880 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:11:21,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-08-25 20:11:21,880 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:21,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:21,880 INFO L82 PathProgramCache]: Analyzing trace with hash -901089383, now seen corresponding path program 1 times [2021-08-25 20:11:21,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:21,880 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086746652] [2021-08-25 20:11:21,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:21,881 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:21,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:21,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:21,908 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086746652] [2021-08-25 20:11:21,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086746652] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:21,908 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:21,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:11:21,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002318123] [2021-08-25 20:11:21,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:11:21,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:21,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:11:21,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:21,909 INFO L87 Difference]: Start difference. First operand 583 states and 741 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-08-25 20:11:22,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:22,085 INFO L93 Difference]: Finished difference Result 1334 states and 1716 transitions. [2021-08-25 20:11:22,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-25 20:11:22,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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) Word has length 36 [2021-08-25 20:11:22,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:22,088 INFO L225 Difference]: With dead ends: 1334 [2021-08-25 20:11:22,089 INFO L226 Difference]: Without dead ends: 1118 [2021-08-25 20:11:22,089 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 16.7ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:11:22,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2021-08-25 20:11:22,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 583. [2021-08-25 20:11:22,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 572 states have (on average 1.2954545454545454) internal successors, (741), 582 states have internal predecessors, (741), 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-08-25 20:11:22,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 741 transitions. [2021-08-25 20:11:22,118 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 741 transitions. Word has length 36 [2021-08-25 20:11:22,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:22,119 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 741 transitions. [2021-08-25 20:11:22,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-08-25 20:11:22,119 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 741 transitions. [2021-08-25 20:11:22,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-25 20:11:22,120 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:22,120 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:11:22,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-08-25 20:11:22,120 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:22,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:22,120 INFO L82 PathProgramCache]: Analyzing trace with hash -593051815, now seen corresponding path program 1 times [2021-08-25 20:11:22,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:22,121 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957101078] [2021-08-25 20:11:22,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:22,121 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:22,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:22,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:22,140 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957101078] [2021-08-25 20:11:22,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957101078] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:22,140 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:22,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:11:22,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654916930] [2021-08-25 20:11:22,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:11:22,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:22,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:11:22,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:22,141 INFO L87 Difference]: Start difference. First operand 583 states and 741 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-08-25 20:11:22,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:22,181 INFO L93 Difference]: Finished difference Result 843 states and 1076 transitions. [2021-08-25 20:11:22,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:11:22,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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) Word has length 36 [2021-08-25 20:11:22,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:22,183 INFO L225 Difference]: With dead ends: 843 [2021-08-25 20:11:22,183 INFO L226 Difference]: Without dead ends: 644 [2021-08-25 20:11:22,184 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:22,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2021-08-25 20:11:22,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 571. [2021-08-25 20:11:22,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 563 states have (on average 1.2841918294849024) internal successors, (723), 570 states have internal predecessors, (723), 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-08-25 20:11:22,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 723 transitions. [2021-08-25 20:11:22,212 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 723 transitions. Word has length 36 [2021-08-25 20:11:22,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:22,213 INFO L470 AbstractCegarLoop]: Abstraction has 571 states and 723 transitions. [2021-08-25 20:11:22,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-08-25 20:11:22,213 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 723 transitions. [2021-08-25 20:11:22,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-08-25 20:11:22,214 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:22,214 INFO L512 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-08-25 20:11:22,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-08-25 20:11:22,214 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:22,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:22,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1515937655, now seen corresponding path program 1 times [2021-08-25 20:11:22,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:22,215 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641080793] [2021-08-25 20:11:22,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:22,215 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:22,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:22,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:22,238 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641080793] [2021-08-25 20:11:22,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641080793] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:22,238 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:22,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:11:22,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276121206] [2021-08-25 20:11:22,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:11:22,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:22,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:11:22,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:22,239 INFO L87 Difference]: Start difference. First operand 571 states and 723 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-08-25 20:11:22,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:22,294 INFO L93 Difference]: Finished difference Result 600 states and 751 transitions. [2021-08-25 20:11:22,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 20:11:22,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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) Word has length 37 [2021-08-25 20:11:22,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:22,296 INFO L225 Difference]: With dead ends: 600 [2021-08-25 20:11:22,296 INFO L226 Difference]: Without dead ends: 581 [2021-08-25 20:11:22,297 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.3ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-25 20:11:22,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2021-08-25 20:11:22,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 568. [2021-08-25 20:11:22,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 560 states have (on average 1.2803571428571427) internal successors, (717), 567 states have internal predecessors, (717), 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-08-25 20:11:22,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 717 transitions. [2021-08-25 20:11:22,336 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 717 transitions. Word has length 37 [2021-08-25 20:11:22,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:22,336 INFO L470 AbstractCegarLoop]: Abstraction has 568 states and 717 transitions. [2021-08-25 20:11:22,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-08-25 20:11:22,336 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 717 transitions. [2021-08-25 20:11:22,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-08-25 20:11:22,337 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:22,337 INFO L512 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-08-25 20:11:22,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-08-25 20:11:22,337 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:22,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:22,337 INFO L82 PathProgramCache]: Analyzing trace with hash 48742328, now seen corresponding path program 1 times [2021-08-25 20:11:22,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:22,338 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072670221] [2021-08-25 20:11:22,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:22,338 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:22,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:22,404 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:22,404 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072670221] [2021-08-25 20:11:22,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072670221] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:22,405 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:22,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:11:22,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927495519] [2021-08-25 20:11:22,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:11:22,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:22,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:11:22,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:11:22,406 INFO L87 Difference]: Start difference. First operand 568 states and 717 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-08-25 20:11:22,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:22,488 INFO L93 Difference]: Finished difference Result 757 states and 959 transitions. [2021-08-25 20:11:22,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:11:22,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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) Word has length 37 [2021-08-25 20:11:22,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:22,490 INFO L225 Difference]: With dead ends: 757 [2021-08-25 20:11:22,490 INFO L226 Difference]: Without dead ends: 538 [2021-08-25 20:11:22,491 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:22,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2021-08-25 20:11:22,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 533. [2021-08-25 20:11:22,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 526 states have (on average 1.2661596958174905) internal successors, (666), 532 states have internal predecessors, (666), 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-08-25 20:11:22,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 666 transitions. [2021-08-25 20:11:22,535 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 666 transitions. Word has length 37 [2021-08-25 20:11:22,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:22,535 INFO L470 AbstractCegarLoop]: Abstraction has 533 states and 666 transitions. [2021-08-25 20:11:22,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-08-25 20:11:22,535 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 666 transitions. [2021-08-25 20:11:22,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-25 20:11:22,536 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:22,536 INFO L512 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-08-25 20:11:22,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-08-25 20:11:22,536 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:22,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:22,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1967560492, now seen corresponding path program 1 times [2021-08-25 20:11:22,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:22,537 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20639593] [2021-08-25 20:11:22,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:22,538 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:22,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:22,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:22,567 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20639593] [2021-08-25 20:11:22,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20639593] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:22,568 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:22,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:11:22,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534643090] [2021-08-25 20:11:22,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:11:22,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:22,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:11:22,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:11:22,569 INFO L87 Difference]: Start difference. First operand 533 states and 666 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-08-25 20:11:22,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:22,678 INFO L93 Difference]: Finished difference Result 714 states and 899 transitions. [2021-08-25 20:11:22,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:11:22,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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) Word has length 38 [2021-08-25 20:11:22,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:22,680 INFO L225 Difference]: With dead ends: 714 [2021-08-25 20:11:22,680 INFO L226 Difference]: Without dead ends: 530 [2021-08-25 20:11:22,681 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:22,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-08-25 20:11:22,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2021-08-25 20:11:22,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 523 states have (on average 1.2562141491395793) internal successors, (657), 529 states have internal predecessors, (657), 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-08-25 20:11:22,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 657 transitions. [2021-08-25 20:11:22,728 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 657 transitions. Word has length 38 [2021-08-25 20:11:22,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:22,728 INFO L470 AbstractCegarLoop]: Abstraction has 530 states and 657 transitions. [2021-08-25 20:11:22,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-08-25 20:11:22,729 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 657 transitions. [2021-08-25 20:11:22,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-25 20:11:22,731 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:22,731 INFO L512 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-08-25 20:11:22,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-08-25 20:11:22,732 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:22,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:22,732 INFO L82 PathProgramCache]: Analyzing trace with hash -2061375645, now seen corresponding path program 1 times [2021-08-25 20:11:22,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:22,732 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803127397] [2021-08-25 20:11:22,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:22,732 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:22,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:22,803 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:22,803 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803127397] [2021-08-25 20:11:22,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803127397] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:22,803 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:22,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-25 20:11:22,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551266889] [2021-08-25 20:11:22,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-25 20:11:22,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:22,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-25 20:11:22,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-25 20:11:22,807 INFO L87 Difference]: Start difference. First operand 530 states and 657 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-08-25 20:11:23,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:23,041 INFO L93 Difference]: Finished difference Result 775 states and 946 transitions. [2021-08-25 20:11:23,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-25 20:11:23,042 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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) Word has length 39 [2021-08-25 20:11:23,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:23,050 INFO L225 Difference]: With dead ends: 775 [2021-08-25 20:11:23,050 INFO L226 Difference]: Without dead ends: 758 [2021-08-25 20:11:23,050 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 51.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-25 20:11:23,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2021-08-25 20:11:23,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 529. [2021-08-25 20:11:23,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 522 states have (on average 1.2547892720306513) internal successors, (655), 528 states have internal predecessors, (655), 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-08-25 20:11:23,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 655 transitions. [2021-08-25 20:11:23,090 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 655 transitions. Word has length 39 [2021-08-25 20:11:23,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:23,091 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 655 transitions. [2021-08-25 20:11:23,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-08-25 20:11:23,091 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 655 transitions. [2021-08-25 20:11:23,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-25 20:11:23,096 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:23,097 INFO L512 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-08-25 20:11:23,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-08-25 20:11:23,097 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:23,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:23,097 INFO L82 PathProgramCache]: Analyzing trace with hash -917711350, now seen corresponding path program 1 times [2021-08-25 20:11:23,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:23,097 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055342738] [2021-08-25 20:11:23,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:23,097 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:23,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:23,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:23,140 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055342738] [2021-08-25 20:11:23,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055342738] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:23,140 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:23,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-25 20:11:23,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250794706] [2021-08-25 20:11:23,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:11:23,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:23,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:11:23,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:11:23,141 INFO L87 Difference]: Start difference. First operand 529 states and 655 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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-08-25 20:11:23,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:23,339 INFO L93 Difference]: Finished difference Result 554 states and 676 transitions. [2021-08-25 20:11:23,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-25 20:11:23,339 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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) Word has length 40 [2021-08-25 20:11:23,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:23,345 INFO L225 Difference]: With dead ends: 554 [2021-08-25 20:11:23,346 INFO L226 Difference]: Without dead ends: 530 [2021-08-25 20:11:23,346 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 55.0ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-08-25 20:11:23,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-08-25 20:11:23,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 516. [2021-08-25 20:11:23,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 509 states have (on average 1.2573673870333988) internal successors, (640), 515 states have internal predecessors, (640), 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-08-25 20:11:23,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 640 transitions. [2021-08-25 20:11:23,393 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 640 transitions. Word has length 40 [2021-08-25 20:11:23,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:23,394 INFO L470 AbstractCegarLoop]: Abstraction has 516 states and 640 transitions. [2021-08-25 20:11:23,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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-08-25 20:11:23,394 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 640 transitions. [2021-08-25 20:11:23,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-08-25 20:11:23,395 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:23,395 INFO L512 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-08-25 20:11:23,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-08-25 20:11:23,395 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:23,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:23,396 INFO L82 PathProgramCache]: Analyzing trace with hash -436735014, now seen corresponding path program 1 times [2021-08-25 20:11:23,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:23,396 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786719671] [2021-08-25 20:11:23,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:23,396 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:23,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:23,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:23,442 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786719671] [2021-08-25 20:11:23,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786719671] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:23,442 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:23,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:11:23,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014895525] [2021-08-25 20:11:23,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:11:23,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:23,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:11:23,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:23,443 INFO L87 Difference]: Start difference. First operand 516 states and 640 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-08-25 20:11:23,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:23,503 INFO L93 Difference]: Finished difference Result 539 states and 660 transitions. [2021-08-25 20:11:23,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:11:23,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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) Word has length 41 [2021-08-25 20:11:23,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:23,508 INFO L225 Difference]: With dead ends: 539 [2021-08-25 20:11:23,508 INFO L226 Difference]: Without dead ends: 518 [2021-08-25 20:11:23,509 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.2ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-25 20:11:23,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2021-08-25 20:11:23,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 508. [2021-08-25 20:11:23,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 501 states have (on average 1.2574850299401197) internal successors, (630), 507 states have internal predecessors, (630), 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-08-25 20:11:23,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 630 transitions. [2021-08-25 20:11:23,542 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 630 transitions. Word has length 41 [2021-08-25 20:11:23,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:23,542 INFO L470 AbstractCegarLoop]: Abstraction has 508 states and 630 transitions. [2021-08-25 20:11:23,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-08-25 20:11:23,542 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 630 transitions. [2021-08-25 20:11:23,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-08-25 20:11:23,543 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:23,543 INFO L512 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-08-25 20:11:23,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-08-25 20:11:23,544 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:23,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:23,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1643790660, now seen corresponding path program 1 times [2021-08-25 20:11:23,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:23,544 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649085620] [2021-08-25 20:11:23,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:23,544 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:23,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:23,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:23,575 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649085620] [2021-08-25 20:11:23,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649085620] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:23,575 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:23,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:11:23,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382226644] [2021-08-25 20:11:23,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:11:23,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:23,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:11:23,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:11:23,578 INFO L87 Difference]: Start difference. First operand 508 states and 630 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-08-25 20:11:23,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:23,623 INFO L93 Difference]: Finished difference Result 526 states and 647 transitions. [2021-08-25 20:11:23,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 20:11:23,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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) Word has length 41 [2021-08-25 20:11:23,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:23,625 INFO L225 Difference]: With dead ends: 526 [2021-08-25 20:11:23,625 INFO L226 Difference]: Without dead ends: 508 [2021-08-25 20:11:23,625 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:23,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2021-08-25 20:11:23,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 494. [2021-08-25 20:11:23,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 487 states have (on average 1.2607802874743326) internal successors, (614), 493 states have internal predecessors, (614), 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-08-25 20:11:23,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 614 transitions. [2021-08-25 20:11:23,657 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 614 transitions. Word has length 41 [2021-08-25 20:11:23,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:23,658 INFO L470 AbstractCegarLoop]: Abstraction has 494 states and 614 transitions. [2021-08-25 20:11:23,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-08-25 20:11:23,658 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 614 transitions. [2021-08-25 20:11:23,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-08-25 20:11:23,658 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:23,659 INFO L512 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-08-25 20:11:23,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-08-25 20:11:23,659 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:23,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:23,659 INFO L82 PathProgramCache]: Analyzing trace with hash 160458813, now seen corresponding path program 1 times [2021-08-25 20:11:23,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:23,659 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036874353] [2021-08-25 20:11:23,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:23,660 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:23,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:23,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:23,710 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036874353] [2021-08-25 20:11:23,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036874353] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:23,711 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:23,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:11:23,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180996456] [2021-08-25 20:11:23,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:11:23,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:23,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:11:23,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:23,712 INFO L87 Difference]: Start difference. First operand 494 states and 614 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-08-25 20:11:23,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:23,853 INFO L93 Difference]: Finished difference Result 815 states and 998 transitions. [2021-08-25 20:11:23,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:11:23,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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) Word has length 41 [2021-08-25 20:11:23,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:23,855 INFO L225 Difference]: With dead ends: 815 [2021-08-25 20:11:23,855 INFO L226 Difference]: Without dead ends: 659 [2021-08-25 20:11:23,855 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.7ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-25 20:11:23,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2021-08-25 20:11:23,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 488. [2021-08-25 20:11:23,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 481 states have (on average 1.2515592515592515) internal successors, (602), 487 states have internal predecessors, (602), 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-08-25 20:11:23,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 602 transitions. [2021-08-25 20:11:23,889 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 602 transitions. Word has length 41 [2021-08-25 20:11:23,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:23,889 INFO L470 AbstractCegarLoop]: Abstraction has 488 states and 602 transitions. [2021-08-25 20:11:23,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-08-25 20:11:23,889 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 602 transitions. [2021-08-25 20:11:23,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-08-25 20:11:23,890 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:23,890 INFO L512 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-08-25 20:11:23,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-08-25 20:11:23,890 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:23,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:23,890 INFO L82 PathProgramCache]: Analyzing trace with hash -693628121, now seen corresponding path program 1 times [2021-08-25 20:11:23,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:23,891 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963473802] [2021-08-25 20:11:23,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:23,891 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:23,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:23,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:23,933 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963473802] [2021-08-25 20:11:23,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963473802] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:23,933 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:23,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:11:23,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429556477] [2021-08-25 20:11:23,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:11:23,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:23,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:11:23,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:11:23,934 INFO L87 Difference]: Start difference. First operand 488 states and 602 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-08-25 20:11:23,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:23,991 INFO L93 Difference]: Finished difference Result 644 states and 779 transitions. [2021-08-25 20:11:23,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:11:23,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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) Word has length 42 [2021-08-25 20:11:23,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:23,993 INFO L225 Difference]: With dead ends: 644 [2021-08-25 20:11:23,993 INFO L226 Difference]: Without dead ends: 579 [2021-08-25 20:11:23,993 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:23,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2021-08-25 20:11:24,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 492. [2021-08-25 20:11:24,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 485 states have (on average 1.2494845360824742) internal successors, (606), 491 states have internal predecessors, (606), 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-08-25 20:11:24,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 606 transitions. [2021-08-25 20:11:24,027 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 606 transitions. Word has length 42 [2021-08-25 20:11:24,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:24,027 INFO L470 AbstractCegarLoop]: Abstraction has 492 states and 606 transitions. [2021-08-25 20:11:24,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-08-25 20:11:24,028 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 606 transitions. [2021-08-25 20:11:24,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-08-25 20:11:24,030 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:24,030 INFO L512 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-08-25 20:11:24,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-08-25 20:11:24,030 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:24,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:24,031 INFO L82 PathProgramCache]: Analyzing trace with hash -81749273, now seen corresponding path program 1 times [2021-08-25 20:11:24,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:24,031 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565944300] [2021-08-25 20:11:24,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:24,031 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:24,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:24,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:24,063 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565944300] [2021-08-25 20:11:24,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565944300] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:24,063 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:24,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-25 20:11:24,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262409671] [2021-08-25 20:11:24,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:11:24,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:24,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:11:24,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:11:24,065 INFO L87 Difference]: Start difference. First operand 492 states and 606 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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-08-25 20:11:24,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:24,137 INFO L93 Difference]: Finished difference Result 516 states and 628 transitions. [2021-08-25 20:11:24,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:11:24,138 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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) Word has length 42 [2021-08-25 20:11:24,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:24,139 INFO L225 Difference]: With dead ends: 516 [2021-08-25 20:11:24,139 INFO L226 Difference]: Without dead ends: 444 [2021-08-25 20:11:24,140 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.1ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-08-25 20:11:24,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2021-08-25 20:11:24,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 430. [2021-08-25 20:11:24,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 424 states have (on average 1.2382075471698113) internal successors, (525), 429 states have internal predecessors, (525), 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-08-25 20:11:24,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 525 transitions. [2021-08-25 20:11:24,171 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 525 transitions. Word has length 42 [2021-08-25 20:11:24,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:24,172 INFO L470 AbstractCegarLoop]: Abstraction has 430 states and 525 transitions. [2021-08-25 20:11:24,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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-08-25 20:11:24,172 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 525 transitions. [2021-08-25 20:11:24,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-25 20:11:24,173 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:24,173 INFO L512 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-08-25 20:11:24,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-08-25 20:11:24,174 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:24,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:24,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1579373080, now seen corresponding path program 1 times [2021-08-25 20:11:24,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:24,174 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456228032] [2021-08-25 20:11:24,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:24,174 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:24,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-08-25 20:11:24,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:24,233 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456228032] [2021-08-25 20:11:24,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456228032] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:24,234 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:24,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-25 20:11:24,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679800636] [2021-08-25 20:11:24,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-25 20:11:24,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:24,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-25 20:11:24,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-25 20:11:24,235 INFO L87 Difference]: Start difference. First operand 430 states and 525 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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-08-25 20:11:24,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:24,394 INFO L93 Difference]: Finished difference Result 448 states and 543 transitions. [2021-08-25 20:11:24,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-25 20:11:24,395 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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) Word has length 44 [2021-08-25 20:11:24,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:24,395 INFO L225 Difference]: With dead ends: 448 [2021-08-25 20:11:24,395 INFO L226 Difference]: Without dead ends: 335 [2021-08-25 20:11:24,396 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.4ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-08-25 20:11:24,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2021-08-25 20:11:24,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 315. [2021-08-25 20:11:24,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 310 states have (on average 1.2483870967741935) internal successors, (387), 314 states have internal predecessors, (387), 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-08-25 20:11:24,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 387 transitions. [2021-08-25 20:11:24,422 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 387 transitions. Word has length 44 [2021-08-25 20:11:24,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:24,422 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 387 transitions. [2021-08-25 20:11:24,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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-08-25 20:11:24,422 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 387 transitions. [2021-08-25 20:11:24,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-25 20:11:24,423 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:24,423 INFO L512 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-08-25 20:11:24,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-08-25 20:11:24,423 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:24,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:24,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1536215993, now seen corresponding path program 1 times [2021-08-25 20:11:24,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:24,424 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441497321] [2021-08-25 20:11:24,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:24,424 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:24,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:24,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:24,471 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441497321] [2021-08-25 20:11:24,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441497321] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:24,471 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:24,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:11:24,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41684537] [2021-08-25 20:11:24,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:11:24,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:24,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:11:24,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:24,472 INFO L87 Difference]: Start difference. First operand 315 states and 387 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-08-25 20:11:24,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:24,586 INFO L93 Difference]: Finished difference Result 708 states and 883 transitions. [2021-08-25 20:11:24,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-25 20:11:24,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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) Word has length 44 [2021-08-25 20:11:24,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:24,587 INFO L225 Difference]: With dead ends: 708 [2021-08-25 20:11:24,587 INFO L226 Difference]: Without dead ends: 578 [2021-08-25 20:11:24,588 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 21.8ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:11:24,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2021-08-25 20:11:24,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 315. [2021-08-25 20:11:24,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 310 states have (on average 1.2451612903225806) internal successors, (386), 314 states have internal predecessors, (386), 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-08-25 20:11:24,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 386 transitions. [2021-08-25 20:11:24,618 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 386 transitions. Word has length 44 [2021-08-25 20:11:24,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:24,618 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 386 transitions. [2021-08-25 20:11:24,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-08-25 20:11:24,618 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 386 transitions. [2021-08-25 20:11:24,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-25 20:11:24,619 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:24,619 INFO L512 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-08-25 20:11:24,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-08-25 20:11:24,619 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:24,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:24,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1259536918, now seen corresponding path program 1 times [2021-08-25 20:11:24,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:24,620 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298374014] [2021-08-25 20:11:24,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:24,620 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:24,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:24,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:24,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:24,639 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298374014] [2021-08-25 20:11:24,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298374014] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:24,640 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:24,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:11:24,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089839938] [2021-08-25 20:11:24,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:11:24,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:24,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:11:24,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:24,641 INFO L87 Difference]: Start difference. First operand 315 states and 386 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-08-25 20:11:24,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:24,695 INFO L93 Difference]: Finished difference Result 448 states and 556 transitions. [2021-08-25 20:11:24,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:11:24,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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) Word has length 48 [2021-08-25 20:11:24,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:24,697 INFO L225 Difference]: With dead ends: 448 [2021-08-25 20:11:24,697 INFO L226 Difference]: Without dead ends: 277 [2021-08-25 20:11:24,697 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:24,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-08-25 20:11:24,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2021-08-25 20:11:24,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 274 states have (on average 1.22992700729927) internal successors, (337), 276 states have internal predecessors, (337), 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-08-25 20:11:24,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 337 transitions. [2021-08-25 20:11:24,723 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 337 transitions. Word has length 48 [2021-08-25 20:11:24,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:24,723 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 337 transitions. [2021-08-25 20:11:24,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-08-25 20:11:24,724 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 337 transitions. [2021-08-25 20:11:24,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-08-25 20:11:24,724 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:24,724 INFO L512 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-08-25 20:11:24,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-08-25 20:11:24,725 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:24,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:24,725 INFO L82 PathProgramCache]: Analyzing trace with hash -624384568, now seen corresponding path program 1 times [2021-08-25 20:11:24,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:24,725 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012371640] [2021-08-25 20:11:24,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:24,725 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:24,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:24,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:24,764 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012371640] [2021-08-25 20:11:24,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012371640] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:24,764 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:24,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-25 20:11:24,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383907294] [2021-08-25 20:11:24,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-25 20:11:24,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:24,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-25 20:11:24,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-25 20:11:24,766 INFO L87 Difference]: Start difference. First operand 277 states and 337 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-08-25 20:11:24,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:24,896 INFO L93 Difference]: Finished difference Result 382 states and 459 transitions. [2021-08-25 20:11:24,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-25 20:11:24,897 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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) Word has length 54 [2021-08-25 20:11:24,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:24,897 INFO L225 Difference]: With dead ends: 382 [2021-08-25 20:11:24,897 INFO L226 Difference]: Without dead ends: 364 [2021-08-25 20:11:24,898 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 47.1ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-08-25 20:11:24,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-08-25 20:11:24,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 277. [2021-08-25 20:11:24,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 274 states have (on average 1.2262773722627738) internal successors, (336), 276 states have internal predecessors, (336), 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-08-25 20:11:24,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 336 transitions. [2021-08-25 20:11:24,920 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 336 transitions. Word has length 54 [2021-08-25 20:11:24,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:24,920 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 336 transitions. [2021-08-25 20:11:24,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-08-25 20:11:24,921 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 336 transitions. [2021-08-25 20:11:24,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-08-25 20:11:24,921 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:24,921 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:11:24,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-08-25 20:11:24,921 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:24,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:24,922 INFO L82 PathProgramCache]: Analyzing trace with hash -2021036311, now seen corresponding path program 1 times [2021-08-25 20:11:24,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:24,922 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15509323] [2021-08-25 20:11:24,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:24,922 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:24,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:24,944 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:24,944 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15509323] [2021-08-25 20:11:24,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15509323] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:24,944 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:24,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:11:24,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10088277] [2021-08-25 20:11:24,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:11:24,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:24,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:11:24,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:24,945 INFO L87 Difference]: Start difference. First operand 277 states and 336 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-08-25 20:11:24,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:24,981 INFO L93 Difference]: Finished difference Result 390 states and 468 transitions. [2021-08-25 20:11:24,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:11:24,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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) Word has length 57 [2021-08-25 20:11:24,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:24,982 INFO L225 Difference]: With dead ends: 390 [2021-08-25 20:11:24,982 INFO L226 Difference]: Without dead ends: 331 [2021-08-25 20:11:24,983 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:24,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2021-08-25 20:11:25,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 277. [2021-08-25 20:11:25,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 274 states have (on average 1.218978102189781) internal successors, (334), 276 states have internal predecessors, (334), 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-08-25 20:11:25,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 334 transitions. [2021-08-25 20:11:25,006 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 334 transitions. Word has length 57 [2021-08-25 20:11:25,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:25,006 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 334 transitions. [2021-08-25 20:11:25,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-08-25 20:11:25,006 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 334 transitions. [2021-08-25 20:11:25,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-08-25 20:11:25,007 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:25,007 INFO L512 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] [2021-08-25 20:11:25,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-08-25 20:11:25,007 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 51 more)] === [2021-08-25 20:11:25,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:25,008 INFO L82 PathProgramCache]: Analyzing trace with hash -576201386, now seen corresponding path program 1 times [2021-08-25 20:11:25,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:25,008 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184815459] [2021-08-25 20:11:25,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:25,008 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:11:25,027 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-25 20:11:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:11:25,076 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-25 20:11:25,076 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-25 20:11:25,077 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,078 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,079 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,079 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,079 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,079 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,079 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,079 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,079 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,079 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,080 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,080 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,080 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,080 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,080 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,080 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,080 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,081 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,081 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,081 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,081 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,081 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,081 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,081 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,081 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,082 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,082 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,082 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,082 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,082 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,082 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,082 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,082 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,083 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,083 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,083 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,083 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,083 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,083 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,083 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,083 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,084 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,084 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,084 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,084 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,084 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,084 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,084 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,084 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,085 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,085 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,085 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,085 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,085 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:25,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-08-25 20:11:25,091 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:11:25,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:11:25 BoogieIcfgContainer [2021-08-25 20:11:25,187 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:11:25,188 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:11:25,188 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:11:25,188 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:11:25,188 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:11:16" (3/4) ... [2021-08-25 20:11:25,197 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-25 20:11:25,279 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-25 20:11:25,280 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:11:25,281 INFO L168 Benchmark]: Toolchain (without parser) took 10663.38 ms. Allocated memory was 58.7 MB in the beginning and 541.1 MB in the end (delta: 482.3 MB). Free memory was 36.2 MB in the beginning and 482.1 MB in the end (delta: -446.0 MB). Peak memory consumption was 37.3 MB. Max. memory is 16.1 GB. [2021-08-25 20:11:25,281 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 58.7 MB. Free memory was 40.3 MB in the beginning and 40.3 MB in the end (delta: 44.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:11:25,281 INFO L168 Benchmark]: CACSL2BoogieTranslator took 365.74 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 35.9 MB in the beginning and 46.3 MB in the end (delta: -10.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-25 20:11:25,281 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.44 ms. Allocated memory is still 71.3 MB. Free memory was 46.1 MB in the beginning and 35.7 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-25 20:11:25,282 INFO L168 Benchmark]: Boogie Preprocessor took 90.80 ms. Allocated memory is still 71.3 MB. Free memory was 35.7 MB in the beginning and 44.4 MB in the end (delta: -8.7 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2021-08-25 20:11:25,282 INFO L168 Benchmark]: RCFGBuilder took 1304.90 ms. Allocated memory was 71.3 MB in the beginning and 107.0 MB in the end (delta: 35.7 MB). Free memory was 44.4 MB in the beginning and 74.3 MB in the end (delta: -29.9 MB). Peak memory consumption was 38.7 MB. Max. memory is 16.1 GB. [2021-08-25 20:11:25,282 INFO L168 Benchmark]: TraceAbstraction took 8705.06 ms. Allocated memory was 107.0 MB in the beginning and 541.1 MB in the end (delta: 434.1 MB). Free memory was 74.3 MB in the beginning and 498.9 MB in the end (delta: -424.6 MB). Peak memory consumption was 271.7 MB. Max. memory is 16.1 GB. [2021-08-25 20:11:25,282 INFO L168 Benchmark]: Witness Printer took 92.00 ms. Allocated memory is still 541.1 MB. Free memory was 498.9 MB in the beginning and 482.1 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-08-25 20:11:25,283 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 58.7 MB. Free memory was 40.3 MB in the beginning and 40.3 MB in the end (delta: 44.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 365.74 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 35.9 MB in the beginning and 46.3 MB in the end (delta: -10.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 98.44 ms. Allocated memory is still 71.3 MB. Free memory was 46.1 MB in the beginning and 35.7 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 90.80 ms. Allocated memory is still 71.3 MB. Free memory was 35.7 MB in the beginning and 44.4 MB in the end (delta: -8.7 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1304.90 ms. Allocated memory was 71.3 MB in the beginning and 107.0 MB in the end (delta: 35.7 MB). Free memory was 44.4 MB in the beginning and 74.3 MB in the end (delta: -29.9 MB). Peak memory consumption was 38.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 8705.06 ms. Allocated memory was 107.0 MB in the beginning and 541.1 MB in the end (delta: 434.1 MB). Free memory was 74.3 MB in the beginning and 498.9 MB in the end (delta: -424.6 MB). Peak memory consumption was 271.7 MB. Max. memory is 16.1 GB. * Witness Printer took 92.00 ms. Allocated memory is still 541.1 MB. Free memory was 498.9 MB in the beginning and 482.1 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1627]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L42] int FloppyThread ; [L43] int KernelMode ; [L44] int Suspended ; [L45] int Executive ; [L46] int DiskController ; [L47] int FloppyDiskPeripheral ; [L48] int FlConfigCallBack ; [L49] int MaximumInterfaceType ; [L50] int MOUNTDEV_MOUNTED_DEVICE_GUID ; [L51] int myStatus ; [L52] int s ; [L53] int UNLOADED ; [L54] int NP ; [L55] int DC ; [L56] int SKIP1 ; [L57] int SKIP2 ; [L58] int MPR1 ; [L59] int MPR3 ; [L60] int IPC ; [L61] int pended ; [L62] int compRegistered ; [L63] int lowerDriverReturn ; [L64] int setEventCalled ; [L65] int customIrp ; [L88] int PagingReferenceCount = 0; [L89] int PagingMutex = 0; VAL [compRegistered=0, customIrp=0, DC=0, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=0, MPR3=0, myStatus=0, NP=0, PagingMutex=0, PagingReferenceCount=0, pended=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, Suspended=0, UNLOADED=0] [L668] int status ; [L669] int irp = __VERIFIER_nondet_int() ; [L670] int pirp ; [L671] int pirp__IoStatus__Status ; [L672] int irp_choice = __VERIFIER_nondet_int() ; [L673] int devobj = __VERIFIER_nondet_int() ; [L674] int __cil_tmp8 ; [L676] FloppyThread = 0 [L677] KernelMode = 0 [L678] Suspended = 0 [L679] Executive = 0 [L680] DiskController = 0 [L681] FloppyDiskPeripheral = 0 [L682] FlConfigCallBack = 0 [L683] MaximumInterfaceType = 0 [L684] MOUNTDEV_MOUNTED_DEVICE_GUID = 0 [L685] myStatus = 0 [L686] s = 0 [L687] UNLOADED = 0 [L688] NP = 0 [L689] DC = 0 [L690] SKIP1 = 0 [L691] SKIP2 = 0 [L692] MPR1 = 0 [L693] MPR3 = 0 [L694] IPC = 0 [L695] pended = 0 [L696] compRegistered = 0 [L697] lowerDriverReturn = 0 [L698] setEventCalled = 0 [L699] customIrp = 0 [L703] status = 0 [L704] pirp = irp [L71] UNLOADED = 0 [L72] NP = 1 [L73] DC = 2 [L74] SKIP1 = 3 [L75] SKIP2 = 4 [L76] MPR1 = 5 [L77] MPR3 = 6 [L78] IPC = 7 [L79] s = UNLOADED [L80] pended = 0 [L81] compRegistered = 0 [L82] lowerDriverReturn = 0 [L83] setEventCalled = 0 [L84] customIrp = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L707] COND TRUE status >= 0 [L708] s = NP [L709] customIrp = 0 [L710] setEventCalled = customIrp [L711] lowerDriverReturn = setEventCalled [L712] compRegistered = lowerDriverReturn [L713] pended = compRegistered [L714] pirp__IoStatus__Status = 0 [L715] myStatus = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L716] COND TRUE irp_choice == 0 [L717] pirp__IoStatus__Status = -1073741637 [L718] myStatus = -1073741637 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L658] s = NP [L659] pended = 0 [L660] compRegistered = 0 [L661] lowerDriverReturn = 0 [L662] setEventCalled = 0 [L663] customIrp = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L724] COND FALSE !(status < 0) [L728] int tmp_ndt_1; [L729] tmp_ndt_1 = __VERIFIER_nondet_int() [L730] COND FALSE !(tmp_ndt_1 == 0) [L733] int tmp_ndt_2; [L734] tmp_ndt_2 = __VERIFIER_nondet_int() [L735] COND FALSE !(tmp_ndt_2 == 1) [L738] int tmp_ndt_3; [L739] tmp_ndt_3 = __VERIFIER_nondet_int() [L740] COND FALSE !(tmp_ndt_3 == 2) [L743] int tmp_ndt_4; [L744] tmp_ndt_4 = __VERIFIER_nondet_int() [L745] COND TRUE tmp_ndt_4 == 3 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L161] int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ; [L162] int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ; [L163] int Irp__IoStatus__Information ; [L164] int Irp__IoStatus__Status ; [L165] int Irp__CurrentLocation = __VERIFIER_nondet_int() ; [L166] int disketteExtension__IsRemoved = __VERIFIER_nondet_int() ; [L167] int disketteExtension__IsStarted = __VERIFIER_nondet_int() ; [L168] int disketteExtension__TargetObject = __VERIFIER_nondet_int() ; [L169] int disketteExtension__HoldNewRequests ; [L170] int disketteExtension__FloppyThread = __VERIFIER_nondet_int() ; [L171] int disketteExtension__InterfaceString__Buffer = __VERIFIER_nondet_int() ; [L172] int disketteExtension__InterfaceString = __VERIFIER_nondet_int() ; [L173] int disketteExtension__ArcName__Length = __VERIFIER_nondet_int() ; [L174] int disketteExtension__ArcName = __VERIFIER_nondet_int() ; [L175] int irpSp__MinorFunction = __VERIFIER_nondet_int() ; [L176] int IoGetConfigurationInformation__FloppyCount = __VERIFIER_nondet_int() ; [L177] int irpSp ; [L178] int disketteExtension ; [L179] int ntStatus ; [L180] int doneEvent = __VERIFIER_nondet_int() ; [L181] int irpSp___0 ; [L182] int nextIrpSp ; [L183] int nextIrpSp__Control ; [L184] int irpSp___1 ; [L185] int irpSp__Context ; [L186] int irpSp__Control ; [L187] long __cil_tmp29 ; [L188] long __cil_tmp30 ; [L191] ntStatus = 0 [L192] PagingReferenceCount ++ VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L193] COND TRUE PagingReferenceCount == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L196] disketteExtension = DeviceObject__DeviceExtension [L197] irpSp = Irp__Tail__Overlay__CurrentStackLocation VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L198] COND FALSE !(\read(disketteExtension__IsRemoved)) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L207] COND FALSE !(irpSp__MinorFunction == 0) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L210] COND TRUE irpSp__MinorFunction == 5 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L236] COND TRUE irpSp__MinorFunction == 5 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L239] COND FALSE !(! disketteExtension__IsStarted) [L255] disketteExtension__HoldNewRequests = 1 [L98] int status ; [L99] int threadHandle = __VERIFIER_nondet_int() ; [L100] int DisketteExtension__PoweringDown = __VERIFIER_nondet_int() ; [L101] int DisketteExtension__ThreadReferenceCount = __VERIFIER_nondet_int() ; [L102] int DisketteExtension__FloppyThread = __VERIFIER_nondet_int() ; [L103] int Irp__IoStatus__Status ; [L104] int Irp__IoStatus__Information ; [L105] int Irp__Tail__Overlay__CurrentStackLocation__Control ; [L106] int ObjAttributes = __VERIFIER_nondet_int() ; [L107] int __cil_tmp12 ; [L108] int __cil_tmp13 ; VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L111] COND FALSE !(DisketteExtension__PoweringDown == 1) [L117] DisketteExtension__ThreadReferenceCount ++ VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L118] COND FALSE !(DisketteExtension__ThreadReferenceCount == 0) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L150] COND TRUE pended == 0 [L151] pended = 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L157] return (259); VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L256] ntStatus = FlQueueIrpToThread(Irp, disketteExtension) [L259] __cil_tmp29 = (long )ntStatus VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L260] COND TRUE __cil_tmp29 == 259L [L1066] COND FALSE !(s == MPR3) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1075] COND FALSE !(customIrp == 1) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1079] COND FALSE !(s == MPR3) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1086] int tmp_ndt_12; [L1087] tmp_ndt_12 = __VERIFIER_nondet_int() [L1088] COND TRUE tmp_ndt_12 == 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1094] return (0); VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L265] COND TRUE disketteExtension__FloppyThread != 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L268] disketteExtension__FloppyThread = 0 [L269] Irp__IoStatus__Status = 0 [L270] myStatus = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L271] COND TRUE s == NP [L272] s = SKIP1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L279] Irp__CurrentLocation ++ [L280] Irp__Tail__Overlay__CurrentStackLocation ++ [L968] int returnVal2 ; [L969] int compRetStatus1 ; [L970] int lcontext = __VERIFIER_nondet_int() ; [L971] unsigned long __cil_tmp7 ; VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L974] COND FALSE !(\read(compRegistered)) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L987] int tmp_ndt_10; [L988] tmp_ndt_10 = __VERIFIER_nondet_int() [L989] COND TRUE tmp_ndt_10 == 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1000] returnVal2 = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1013] COND FALSE !(s == NP) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1017] COND FALSE !(s == MPR1) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1026] COND TRUE s == SKIP1 [L1027] s = SKIP2 [L1028] lowerDriverReturn = returnVal2 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1036] return (returnVal2); VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L281] ntStatus = IofCallDriver(disketteExtension__TargetObject, Irp) [L427] PagingReferenceCount -- VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L428] COND TRUE PagingReferenceCount == 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L431] return (ntStatus); VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L767] status = FloppyPnp(devobj, pirp) [L780] COND TRUE pended == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L781] COND FALSE !(s == NP) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L788] COND TRUE pended == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L789] COND FALSE !(s == MPR3) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L796] COND TRUE s != UNLOADED VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L797] COND TRUE status != -1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L798] COND FALSE !(s != SKIP2) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L812] COND TRUE pended == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L813] COND TRUE status != 259 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1627] reach_error() VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1627]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 572 locations, 54 error locations. Started 1 CEGAR loops. OverallTime: 8564.9ms, OverallIterations: 49, TraceHistogramMax: 1, EmptinessCheckTime: 47.8ms, AutomataDifference: 5037.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 13.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 26574 SDtfs, 17457 SDslu, 42437 SDs, 0 SdLazy, 4280 SolverSat, 632 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2121.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 282 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 616.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=715occurred in iteration=4, InterpolantAutomatonStates: 227, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1352.2ms AutomataMinimizationTime, 48 MinimizatonAttempts, 3445 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 93.5ms SsaConstructionTime, 367.4ms SatisfiabilityAnalysisTime, 1197.4ms InterpolantComputationTime, 1613 NumberOfCodeBlocks, 1613 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 1507 ConstructedInterpolants, 0 QuantifiedInterpolants, 3463 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 48 InterpolantComputations, 48 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-25 20:11:25,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...