./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.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_simpl3.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 80f2ff50c19fe4a3b45780d8d11b89e9a2800d57 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:10:17,642 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:10:17,644 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:10:17,671 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:10:17,673 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:10:17,675 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:10:17,676 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:10:17,677 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:10:17,686 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:10:17,690 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:10:17,691 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:10:17,695 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:10:17,695 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:10:17,697 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:10:17,699 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:10:17,701 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:10:17,703 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:10:17,703 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:10:17,705 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:10:17,706 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:10:17,707 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:10:17,708 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:10:17,713 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:10:17,714 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:10:17,715 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:10:17,716 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:10:17,716 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:10:17,716 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:10:17,717 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:10:17,717 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:10:17,717 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:10:17,718 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:10:17,718 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:10:17,719 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:10:17,719 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:10:17,719 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:10:17,720 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:10:17,720 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:10:17,720 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:10:17,721 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:10:17,721 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:10:17,722 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:10:17,745 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:10:17,745 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:10:17,746 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:10:17,746 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:10:17,747 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:10:17,747 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:10:17,747 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:10:17,747 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:10:17,747 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:10:17,747 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-25 20:10:17,747 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:10:17,748 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:10:17,748 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:10:17,748 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:10:17,748 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:10:17,748 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:10:17,748 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:10:17,748 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:10:17,749 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:10:17,749 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:10:17,749 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:10:17,749 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:10:17,749 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:10:17,749 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:10:17,749 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:10:17,750 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:10:17,750 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-25 20:10:17,750 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-25 20:10:17,750 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:10:17,750 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:10:17,750 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 -> 80f2ff50c19fe4a3b45780d8d11b89e9a2800d57 [2021-08-25 20:10:18,008 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:10:18,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:10:18,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:10:18,032 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:10:18,035 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:10:18,035 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-1.c [2021-08-25 20:10:18,080 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8662881b8/547ce8fb857d441d86a009fe612a91e1/FLAGd3fad25f7 [2021-08-25 20:10:18,466 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:10:18,466 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-1.c [2021-08-25 20:10:18,475 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8662881b8/547ce8fb857d441d86a009fe612a91e1/FLAGd3fad25f7 [2021-08-25 20:10:18,831 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8662881b8/547ce8fb857d441d86a009fe612a91e1 [2021-08-25 20:10:18,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:10:18,835 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:10:18,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:10:18,836 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:10:18,842 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:10:18,843 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:10:18" (1/1) ... [2021-08-25 20:10:18,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fd3727d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:10:18, skipping insertion in model container [2021-08-25 20:10:18,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:10:18" (1/1) ... [2021-08-25 20:10:18,850 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:10:18,899 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:10:18,997 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_simpl3.cil-1.c[2713,2726] [2021-08-25 20:10:19,069 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:10:19,075 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:10:19,100 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_simpl3.cil-1.c[2713,2726] [2021-08-25 20:10:19,150 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:10:19,161 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:10:19,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:10:19 WrapperNode [2021-08-25 20:10:19,161 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:10:19,162 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:10:19,162 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:10:19,162 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:10:19,167 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:10:19" (1/1) ... [2021-08-25 20:10:19,176 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:10:19" (1/1) ... [2021-08-25 20:10:19,245 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:10:19,245 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:10:19,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:10:19,246 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:10:19,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:10:19" (1/1) ... [2021-08-25 20:10:19,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:10:19" (1/1) ... [2021-08-25 20:10:19,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:10:19" (1/1) ... [2021-08-25 20:10:19,258 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:10:19" (1/1) ... [2021-08-25 20:10:19,276 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:10:19" (1/1) ... [2021-08-25 20:10:19,323 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:10:19" (1/1) ... [2021-08-25 20:10:19,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:10:19" (1/1) ... [2021-08-25 20:10:19,338 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:10:19,339 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:10:19,339 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:10:19,339 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:10:19,340 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:10:19" (1/1) ... [2021-08-25 20:10:19,347 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:10:19,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:10:19,366 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:10:19,387 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:10:19,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:10:19,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-25 20:10:19,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:10:19,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:10:19,626 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:10:19,633 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:10:19,636 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:10:19,638 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:10:19,639 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:10:19,641 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:10:19,642 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:10:19,645 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:10:19,646 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:10:19,646 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:10:19,656 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:10:19,660 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:10:19,662 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:10:19,663 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:10:19,668 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:10:19,669 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:10:19,673 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:10:19,675 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:10:19,676 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:10:19,676 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:10:19,677 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:10:19,678 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:10:19,678 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:10:19,679 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:10:20,328 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##416: assume !false; [2021-08-25 20:10:20,329 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##415: assume false; [2021-08-25 20:10:20,329 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##445: assume false; [2021-08-25 20:10:20,329 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##290: assume false; [2021-08-25 20:10:20,330 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##291: assume !false; [2021-08-25 20:10:20,330 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##490: assume !false; [2021-08-25 20:10:20,330 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##269: assume false; [2021-08-25 20:10:20,330 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##270: assume !false; [2021-08-25 20:10:20,330 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##446: assume !false; [2021-08-25 20:10:20,330 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##209: assume false; [2021-08-25 20:10:20,330 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##210: assume !false; [2021-08-25 20:10:20,330 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##463: assume false; [2021-08-25 20:10:20,331 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##464: assume !false; [2021-08-25 20:10:20,331 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##470: assume false; [2021-08-25 20:10:20,331 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##232: assume false; [2021-08-25 20:10:20,331 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##471: assume !false; [2021-08-25 20:10:20,331 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##233: assume !false; [2021-08-25 20:10:20,331 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##242: assume !false; [2021-08-25 20:10:20,331 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##241: assume false; [2021-08-25 20:10:20,331 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##489: assume false; [2021-08-25 20:10:20,331 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##246: assume !false; [2021-08-25 20:10:20,332 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##245: assume false; [2021-08-25 20:10:20,332 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-08-25 20:10:20,332 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-08-25 20:10:20,332 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume !false; [2021-08-25 20:10:20,332 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume false; [2021-08-25 20:10:20,332 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##175: assume !false; [2021-08-25 20:10:20,333 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##174: assume false; [2021-08-25 20:10:20,333 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##180: assume false; [2021-08-25 20:10:20,333 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##181: assume !false; [2021-08-25 20:10:20,333 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !false; [2021-08-25 20:10:20,333 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume false; [2021-08-25 20:10:20,334 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##137: assume false; [2021-08-25 20:10:20,334 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##35: assume !false; [2021-08-25 20:10:20,334 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##34: assume false; [2021-08-25 20:10:20,334 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##138: assume !false; [2021-08-25 20:10:20,334 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##393: assume false; [2021-08-25 20:10:20,335 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2021-08-25 20:10:20,335 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##394: assume !false; [2021-08-25 20:10:20,335 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2021-08-25 20:10:20,336 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##164: assume !false; [2021-08-25 20:10:20,336 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##163: assume false; [2021-08-25 20:10:20,336 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##329: assume false; [2021-08-25 20:10:20,336 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##330: assume !false; [2021-08-25 20:10:20,336 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##108: assume !false; [2021-08-25 20:10:20,336 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##107: assume false; [2021-08-25 20:10:20,336 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##364: assume !false; [2021-08-25 20:10:20,336 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##363: assume false; [2021-08-25 20:10:20,349 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:10:20,350 INFO L299 CfgBuilder]: Removed 207 assume(true) statements. [2021-08-25 20:10:20,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:10:20 BoogieIcfgContainer [2021-08-25 20:10:20,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:10:20,353 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:10:20,353 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:10:20,355 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:10:20,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:10:18" (1/3) ... [2021-08-25 20:10:20,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d69152b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:10:20, skipping insertion in model container [2021-08-25 20:10:20,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:10:19" (2/3) ... [2021-08-25 20:10:20,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d69152b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:10:20, skipping insertion in model container [2021-08-25 20:10:20,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:10:20" (3/3) ... [2021-08-25 20:10:20,358 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl3.cil-1.c [2021-08-25 20:10:20,364 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:10:20,364 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2021-08-25 20:10:20,413 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:10:20,417 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:10:20,418 INFO L340 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2021-08-25 20:10:20,433 INFO L276 IsEmpty]: Start isEmpty. Operand has 421 states, 379 states have (on average 1.5910290237467017) internal successors, (603), 420 states have internal predecessors, (603), 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:10:20,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-25 20:10:20,437 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:10:20,437 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:10:20,438 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-08-25 20:10:20,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:10:20,441 INFO L82 PathProgramCache]: Analyzing trace with hash 660910296, now seen corresponding path program 1 times [2021-08-25 20:10:20,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:10:20,447 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029950047] [2021-08-25 20:10:20,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:10:20,448 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:10:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:10:20,569 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:10:20,570 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:10:20,571 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029950047] [2021-08-25 20:10:20,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029950047] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:10:20,571 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:10:20,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:10:20,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232919077] [2021-08-25 20:10:20,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:10:20,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:10:20,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:10:20,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:10:20,599 INFO L87 Difference]: Start difference. First operand has 421 states, 379 states have (on average 1.5910290237467017) internal successors, (603), 420 states have internal predecessors, (603), 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.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:10:20,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:10:20,670 INFO L93 Difference]: Finished difference Result 763 states and 1090 transitions. [2021-08-25 20:10:20,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:10:20,675 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:10:20,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:10:20,688 INFO L225 Difference]: With dead ends: 763 [2021-08-25 20:10:20,688 INFO L226 Difference]: Without dead ends: 416 [2021-08-25 20:10:20,690 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:10:20,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2021-08-25 20:10:20,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2021-08-25 20:10:20,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 375 states have (on average 1.456) internal successors, (546), 415 states have internal predecessors, (546), 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:10:20,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 546 transitions. [2021-08-25 20:10:20,751 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 546 transitions. Word has length 11 [2021-08-25 20:10:20,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:10:20,751 INFO L470 AbstractCegarLoop]: Abstraction has 416 states and 546 transitions. [2021-08-25 20:10:20,751 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:10:20,751 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 546 transitions. [2021-08-25 20:10:20,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-25 20:10:20,752 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:10:20,752 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:10:20,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-25 20:10:20,752 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-08-25 20:10:20,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:10:20,753 INFO L82 PathProgramCache]: Analyzing trace with hash -32433196, now seen corresponding path program 1 times [2021-08-25 20:10:20,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:10:20,753 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792572604] [2021-08-25 20:10:20,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:10:20,753 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:10:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:10:20,843 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:10:20,843 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:10:20,843 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792572604] [2021-08-25 20:10:20,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792572604] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:10:20,844 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:10:20,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:10:20,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88280034] [2021-08-25 20:10:20,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:10:20,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:10:20,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:10:20,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:10:20,846 INFO L87 Difference]: Start difference. First operand 416 states and 546 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:10:21,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:10:21,056 INFO L93 Difference]: Finished difference Result 714 states and 941 transitions. [2021-08-25 20:10:21,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:10:21,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2021-08-25 20:10:21,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:10:21,060 INFO L225 Difference]: With dead ends: 714 [2021-08-25 20:10:21,060 INFO L226 Difference]: Without dead ends: 547 [2021-08-25 20:10:21,064 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:10:21,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2021-08-25 20:10:21,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 521. [2021-08-25 20:10:21,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 492 states have (on average 1.4166666666666667) internal successors, (697), 520 states have internal predecessors, (697), 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:10:21,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 697 transitions. [2021-08-25 20:10:21,096 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 697 transitions. Word has length 13 [2021-08-25 20:10:21,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:10:21,096 INFO L470 AbstractCegarLoop]: Abstraction has 521 states and 697 transitions. [2021-08-25 20:10:21,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:10:21,096 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 697 transitions. [2021-08-25 20:10:21,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-25 20:10:21,097 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:10:21,097 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:10:21,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-25 20:10:21,097 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-08-25 20:10:21,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:10:21,098 INFO L82 PathProgramCache]: Analyzing trace with hash 563627937, now seen corresponding path program 1 times [2021-08-25 20:10:21,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:10:21,098 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630332710] [2021-08-25 20:10:21,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:10:21,098 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:10:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:10:21,145 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:10:21,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:10:21,145 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630332710] [2021-08-25 20:10:21,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630332710] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:10:21,146 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:10:21,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:10:21,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886360375] [2021-08-25 20:10:21,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:10:21,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:10:21,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:10:21,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:10:21,147 INFO L87 Difference]: Start difference. First operand 521 states and 697 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:10:21,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:10:21,190 INFO L93 Difference]: Finished difference Result 1000 states and 1335 transitions. [2021-08-25 20:10:21,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:10:21,191 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:10:21,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:10:21,193 INFO L225 Difference]: With dead ends: 1000 [2021-08-25 20:10:21,193 INFO L226 Difference]: Without dead ends: 690 [2021-08-25 20:10:21,194 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:10:21,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2021-08-25 20:10:21,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 519. [2021-08-25 20:10:21,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 498 states have (on average 1.3975903614457832) internal successors, (696), 518 states have internal predecessors, (696), 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:10:21,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 696 transitions. [2021-08-25 20:10:21,214 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 696 transitions. Word has length 16 [2021-08-25 20:10:21,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:10:21,214 INFO L470 AbstractCegarLoop]: Abstraction has 519 states and 696 transitions. [2021-08-25 20:10:21,215 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:10:21,215 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 696 transitions. [2021-08-25 20:10:21,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-25 20:10:21,216 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:10:21,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] [2021-08-25 20:10:21,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-25 20:10:21,216 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-08-25 20:10:21,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:10:21,217 INFO L82 PathProgramCache]: Analyzing trace with hash 6806604, now seen corresponding path program 1 times [2021-08-25 20:10:21,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:10:21,217 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797921134] [2021-08-25 20:10:21,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:10:21,217 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:10:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:10:21,248 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:10:21,248 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:10:21,248 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797921134] [2021-08-25 20:10:21,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797921134] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:10:21,248 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:10:21,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:10:21,249 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961943559] [2021-08-25 20:10:21,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:10:21,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:10:21,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:10:21,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:10:21,250 INFO L87 Difference]: Start difference. First operand 519 states and 696 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:10:21,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:10:21,285 INFO L93 Difference]: Finished difference Result 601 states and 797 transitions. [2021-08-25 20:10:21,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:10:21,286 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:10:21,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:10:21,288 INFO L225 Difference]: With dead ends: 601 [2021-08-25 20:10:21,289 INFO L226 Difference]: Without dead ends: 578 [2021-08-25 20:10:21,290 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:10:21,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2021-08-25 20:10:21,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 537. [2021-08-25 20:10:21,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 517 states have (on average 1.4061895551257253) internal successors, (727), 536 states have internal predecessors, (727), 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:10:21,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 727 transitions. [2021-08-25 20:10:21,308 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 727 transitions. Word has length 19 [2021-08-25 20:10:21,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:10:21,309 INFO L470 AbstractCegarLoop]: Abstraction has 537 states and 727 transitions. [2021-08-25 20:10:21,309 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:10:21,309 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 727 transitions. [2021-08-25 20:10:21,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-25 20:10:21,310 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:10:21,310 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:10:21,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-25 20:10:21,310 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-08-25 20:10:21,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:10:21,311 INFO L82 PathProgramCache]: Analyzing trace with hash -450647822, now seen corresponding path program 1 times [2021-08-25 20:10:21,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:10:21,311 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511160663] [2021-08-25 20:10:21,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:10:21,311 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:10:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:10:21,385 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:10:21,385 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:10:21,385 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511160663] [2021-08-25 20:10:21,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511160663] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:10:21,386 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:10:21,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:10:21,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015563632] [2021-08-25 20:10:21,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:10:21,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:10:21,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:10:21,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:10:21,387 INFO L87 Difference]: Start difference. First operand 537 states and 727 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:10:21,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:10:21,426 INFO L93 Difference]: Finished difference Result 650 states and 863 transitions. [2021-08-25 20:10:21,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 20:10:21,427 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:10:21,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:10:21,429 INFO L225 Difference]: With dead ends: 650 [2021-08-25 20:10:21,429 INFO L226 Difference]: Without dead ends: 599 [2021-08-25 20:10:21,430 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:10:21,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2021-08-25 20:10:21,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 539. [2021-08-25 20:10:21,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 519 states have (on average 1.4046242774566473) internal successors, (729), 538 states have internal predecessors, (729), 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:10:21,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 729 transitions. [2021-08-25 20:10:21,445 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 729 transitions. Word has length 22 [2021-08-25 20:10:21,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:10:21,445 INFO L470 AbstractCegarLoop]: Abstraction has 539 states and 729 transitions. [2021-08-25 20:10:21,446 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:10:21,446 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 729 transitions. [2021-08-25 20:10:21,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-25 20:10:21,447 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:10:21,447 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:10:21,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-25 20:10:21,447 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-08-25 20:10:21,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:10:21,447 INFO L82 PathProgramCache]: Analyzing trace with hash 364241657, now seen corresponding path program 1 times [2021-08-25 20:10:21,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:10:21,447 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293853706] [2021-08-25 20:10:21,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:10:21,448 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:10:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:10:21,473 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:10:21,473 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:10:21,474 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293853706] [2021-08-25 20:10:21,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293853706] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:10:21,474 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:10:21,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:10:21,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825929361] [2021-08-25 20:10:21,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:10:21,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:10:21,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:10:21,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:10:21,477 INFO L87 Difference]: Start difference. First operand 539 states and 729 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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:10:21,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:10:21,594 INFO L93 Difference]: Finished difference Result 574 states and 773 transitions. [2021-08-25 20:10:21,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:10:21,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:10:21,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:10:21,596 INFO L225 Difference]: With dead ends: 574 [2021-08-25 20:10:21,597 INFO L226 Difference]: Without dead ends: 569 [2021-08-25 20:10:21,597 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:10:21,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2021-08-25 20:10:21,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 566. [2021-08-25 20:10:21,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 546 states have (on average 1.401098901098901) internal successors, (765), 565 states have internal predecessors, (765), 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:10:21,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 765 transitions. [2021-08-25 20:10:21,618 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 765 transitions. Word has length 22 [2021-08-25 20:10:21,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:10:21,619 INFO L470 AbstractCegarLoop]: Abstraction has 566 states and 765 transitions. [2021-08-25 20:10:21,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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:10:21,619 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 765 transitions. [2021-08-25 20:10:21,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-25 20:10:21,622 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:10:21,622 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:10:21,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-25 20:10:21,623 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-08-25 20:10:21,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:10:21,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1575831316, now seen corresponding path program 1 times [2021-08-25 20:10:21,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:10:21,626 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130897267] [2021-08-25 20:10:21,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:10:21,626 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:10:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:10:21,700 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:10:21,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:10:21,700 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130897267] [2021-08-25 20:10:21,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130897267] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:10:21,701 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:10:21,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:10:21,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35914883] [2021-08-25 20:10:21,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:10:21,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:10:21,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:10:21,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:10:21,702 INFO L87 Difference]: Start difference. First operand 566 states and 765 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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:10:21,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:10:21,831 INFO L93 Difference]: Finished difference Result 578 states and 775 transitions. [2021-08-25 20:10:21,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:10:21,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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:10:21,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:10:21,833 INFO L225 Difference]: With dead ends: 578 [2021-08-25 20:10:21,834 INFO L226 Difference]: Without dead ends: 569 [2021-08-25 20:10:21,834 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:10:21,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2021-08-25 20:10:21,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 566. [2021-08-25 20:10:21,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 546 states have (on average 1.3974358974358974) internal successors, (763), 565 states have internal predecessors, (763), 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:10:21,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 763 transitions. [2021-08-25 20:10:21,852 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 763 transitions. Word has length 23 [2021-08-25 20:10:21,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:10:21,852 INFO L470 AbstractCegarLoop]: Abstraction has 566 states and 763 transitions. [2021-08-25 20:10:21,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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:10:21,853 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 763 transitions. [2021-08-25 20:10:21,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-25 20:10:21,853 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:10:21,853 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] [2021-08-25 20:10:21,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-25 20:10:21,854 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-08-25 20:10:21,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:10:21,854 INFO L82 PathProgramCache]: Analyzing trace with hash -2139092952, now seen corresponding path program 1 times [2021-08-25 20:10:21,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:10:21,854 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350266807] [2021-08-25 20:10:21,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:10:21,854 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:10:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:10:21,888 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:10:21,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:10:21,888 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350266807] [2021-08-25 20:10:21,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350266807] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:10:21,889 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:10:21,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:10:21,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811645114] [2021-08-25 20:10:21,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:10:21,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:10:21,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:10:21,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:10:21,890 INFO L87 Difference]: Start difference. First operand 566 states and 763 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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:10:22,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:10:22,030 INFO L93 Difference]: Finished difference Result 578 states and 773 transitions. [2021-08-25 20:10:22,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:10:22,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 24 [2021-08-25 20:10:22,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:10:22,032 INFO L225 Difference]: With dead ends: 578 [2021-08-25 20:10:22,032 INFO L226 Difference]: Without dead ends: 569 [2021-08-25 20:10:22,032 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:10:22,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2021-08-25 20:10:22,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 566. [2021-08-25 20:10:22,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 546 states have (on average 1.3937728937728937) internal successors, (761), 565 states have internal predecessors, (761), 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:10:22,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 761 transitions. [2021-08-25 20:10:22,051 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 761 transitions. Word has length 24 [2021-08-25 20:10:22,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:10:22,052 INFO L470 AbstractCegarLoop]: Abstraction has 566 states and 761 transitions. [2021-08-25 20:10:22,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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:10:22,053 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 761 transitions. [2021-08-25 20:10:22,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-25 20:10:22,053 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:10:22,053 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:10:22,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-25 20:10:22,054 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-08-25 20:10:22,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:10:22,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1167485085, now seen corresponding path program 1 times [2021-08-25 20:10:22,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:10:22,054 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956212057] [2021-08-25 20:10:22,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:10:22,055 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:10:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:10:22,083 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:10:22,083 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:10:22,083 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956212057] [2021-08-25 20:10:22,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956212057] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:10:22,084 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:10:22,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:10:22,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222745209] [2021-08-25 20:10:22,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:10:22,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:10:22,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:10:22,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:10:22,088 INFO L87 Difference]: Start difference. First operand 566 states and 761 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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:10:22,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:10:22,219 INFO L93 Difference]: Finished difference Result 768 states and 1029 transitions. [2021-08-25 20:10:22,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:10:22,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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:10:22,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:10:22,223 INFO L225 Difference]: With dead ends: 768 [2021-08-25 20:10:22,223 INFO L226 Difference]: Without dead ends: 760 [2021-08-25 20:10:22,223 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:10:22,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2021-08-25 20:10:22,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 584. [2021-08-25 20:10:22,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 564 states have (on average 1.3971631205673758) internal successors, (788), 583 states have internal predecessors, (788), 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:10:22,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 788 transitions. [2021-08-25 20:10:22,243 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 788 transitions. Word has length 25 [2021-08-25 20:10:22,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:10:22,244 INFO L470 AbstractCegarLoop]: Abstraction has 584 states and 788 transitions. [2021-08-25 20:10:22,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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:10:22,244 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 788 transitions. [2021-08-25 20:10:22,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-25 20:10:22,244 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:10:22,244 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:10:22,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-25 20:10:22,244 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-08-25 20:10:22,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:10:22,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1184010678, now seen corresponding path program 1 times [2021-08-25 20:10:22,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:10:22,245 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892421902] [2021-08-25 20:10:22,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:10:22,245 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:10:22,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:10:22,263 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:10:22,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:10:22,263 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892421902] [2021-08-25 20:10:22,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892421902] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:10:22,263 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:10:22,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:10:22,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275839696] [2021-08-25 20:10:22,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:10:22,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:10:22,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:10:22,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:10:22,264 INFO L87 Difference]: Start difference. First operand 584 states and 788 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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:10:22,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:10:22,367 INFO L93 Difference]: Finished difference Result 584 states and 788 transitions. [2021-08-25 20:10:22,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:10:22,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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:10:22,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:10:22,369 INFO L225 Difference]: With dead ends: 584 [2021-08-25 20:10:22,369 INFO L226 Difference]: Without dead ends: 572 [2021-08-25 20:10:22,370 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:10:22,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2021-08-25 20:10:22,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2021-08-25 20:10:22,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 558 states have (on average 1.3888888888888888) internal successors, (775), 571 states have internal predecessors, (775), 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:10:22,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 775 transitions. [2021-08-25 20:10:22,391 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 775 transitions. Word has length 25 [2021-08-25 20:10:22,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:10:22,391 INFO L470 AbstractCegarLoop]: Abstraction has 572 states and 775 transitions. [2021-08-25 20:10:22,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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:10:22,391 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 775 transitions. [2021-08-25 20:10:22,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-25 20:10:22,393 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:10:22,393 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:10:22,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-25 20:10:22,393 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-08-25 20:10:22,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:10:22,394 INFO L82 PathProgramCache]: Analyzing trace with hash 2043637155, now seen corresponding path program 1 times [2021-08-25 20:10:22,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:10:22,395 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949044759] [2021-08-25 20:10:22,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:10:22,396 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:10:22,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:10:22,421 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:10:22,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:10:22,422 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949044759] [2021-08-25 20:10:22,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949044759] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:10:22,423 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:10:22,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:10:22,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017664764] [2021-08-25 20:10:22,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:10:22,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:10:22,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:10:22,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:10:22,424 INFO L87 Difference]: Start difference. First operand 572 states and 775 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:10:22,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:10:22,455 INFO L93 Difference]: Finished difference Result 585 states and 787 transitions. [2021-08-25 20:10:22,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:10:22,455 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:10:22,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:10:22,457 INFO L225 Difference]: With dead ends: 585 [2021-08-25 20:10:22,457 INFO L226 Difference]: Without dead ends: 570 [2021-08-25 20:10:22,457 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:10:22,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2021-08-25 20:10:22,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2021-08-25 20:10:22,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 556 states have (on average 1.3884892086330936) internal successors, (772), 569 states have internal predecessors, (772), 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:10:22,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 772 transitions. [2021-08-25 20:10:22,474 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 772 transitions. Word has length 25 [2021-08-25 20:10:22,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:10:22,476 INFO L470 AbstractCegarLoop]: Abstraction has 570 states and 772 transitions. [2021-08-25 20:10:22,476 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:10:22,476 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 772 transitions. [2021-08-25 20:10:22,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-25 20:10:22,476 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:10:22,476 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:10:22,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-25 20:10:22,478 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-08-25 20:10:22,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:10:22,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1824640765, now seen corresponding path program 1 times [2021-08-25 20:10:22,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:10:22,478 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226353017] [2021-08-25 20:10:22,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:10:22,478 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:10:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:10:22,532 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:10:22,532 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:10:22,532 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226353017] [2021-08-25 20:10:22,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226353017] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:10:22,532 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:10:22,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:10:22,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437039922] [2021-08-25 20:10:22,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:10:22,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:10:22,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:10:22,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:10:22,534 INFO L87 Difference]: Start difference. First operand 570 states and 772 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:10:22,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:10:22,694 INFO L93 Difference]: Finished difference Result 870 states and 1155 transitions. [2021-08-25 20:10:22,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:10:22,694 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:10:22,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:10:22,696 INFO L225 Difference]: With dead ends: 870 [2021-08-25 20:10:22,696 INFO L226 Difference]: Without dead ends: 611 [2021-08-25 20:10:22,697 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:10:22,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2021-08-25 20:10:22,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 553. [2021-08-25 20:10:22,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 540 states have (on average 1.362962962962963) internal successors, (736), 552 states have internal predecessors, (736), 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:10:22,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 736 transitions. [2021-08-25 20:10:22,717 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 736 transitions. Word has length 26 [2021-08-25 20:10:22,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:10:22,717 INFO L470 AbstractCegarLoop]: Abstraction has 553 states and 736 transitions. [2021-08-25 20:10:22,717 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:10:22,717 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 736 transitions. [2021-08-25 20:10:22,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-25 20:10:22,718 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:10:22,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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:10:22,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-25 20:10:22,719 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-08-25 20:10:22,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:10:22,719 INFO L82 PathProgramCache]: Analyzing trace with hash -944626100, now seen corresponding path program 1 times [2021-08-25 20:10:22,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:10:22,719 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946431918] [2021-08-25 20:10:22,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:10:22,720 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:10:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:10:22,757 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:10:22,757 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:10:22,757 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946431918] [2021-08-25 20:10:22,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946431918] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:10:22,758 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:10:22,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:10:22,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459904648] [2021-08-25 20:10:22,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:10:22,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:10:22,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:10:22,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:10:22,760 INFO L87 Difference]: Start difference. First operand 553 states and 736 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:10:22,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:10:22,859 INFO L93 Difference]: Finished difference Result 761 states and 1012 transitions. [2021-08-25 20:10:22,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:10:22,860 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:10:22,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:10:22,862 INFO L225 Difference]: With dead ends: 761 [2021-08-25 20:10:22,862 INFO L226 Difference]: Without dead ends: 555 [2021-08-25 20:10:22,863 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:10:22,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2021-08-25 20:10:22,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2021-08-25 20:10:22,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 544 states have (on average 1.3584558823529411) internal successors, (739), 554 states have internal predecessors, (739), 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:10:22,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 739 transitions. [2021-08-25 20:10:22,881 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 739 transitions. Word has length 28 [2021-08-25 20:10:22,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:10:22,882 INFO L470 AbstractCegarLoop]: Abstraction has 555 states and 739 transitions. [2021-08-25 20:10:22,882 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:10:22,882 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 739 transitions. [2021-08-25 20:10:22,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-25 20:10:22,882 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:10:22,883 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:10:22,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-25 20:10:22,883 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-08-25 20:10:22,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:10:22,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1312752221, now seen corresponding path program 1 times [2021-08-25 20:10:22,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:10:22,883 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937301320] [2021-08-25 20:10:22,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:10:22,884 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:10:22,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:10:22,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:10:22,907 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:10:22,907 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937301320] [2021-08-25 20:10:22,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937301320] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:10:22,908 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:10:22,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:10:22,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328697653] [2021-08-25 20:10:22,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:10:22,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:10:22,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:10:22,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:10:22,909 INFO L87 Difference]: Start difference. First operand 555 states and 739 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 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:10:22,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:10:22,941 INFO L93 Difference]: Finished difference Result 735 states and 969 transitions. [2021-08-25 20:10:22,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:10:22,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:10:22,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:10:22,943 INFO L225 Difference]: With dead ends: 735 [2021-08-25 20:10:22,943 INFO L226 Difference]: Without dead ends: 531 [2021-08-25 20:10:22,944 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:10:22,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2021-08-25 20:10:22,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 515. [2021-08-25 20:10:22,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 504 states have (on average 1.3511904761904763) internal successors, (681), 514 states have internal predecessors, (681), 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:10:22,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 681 transitions. [2021-08-25 20:10:22,960 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 681 transitions. Word has length 29 [2021-08-25 20:10:22,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:10:22,961 INFO L470 AbstractCegarLoop]: Abstraction has 515 states and 681 transitions. [2021-08-25 20:10:22,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:10:22,961 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 681 transitions. [2021-08-25 20:10:22,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-25 20:10:22,962 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:10:22,962 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:10:22,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-25 20:10:22,962 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-08-25 20:10:22,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:10:22,963 INFO L82 PathProgramCache]: Analyzing trace with hash 259846608, now seen corresponding path program 1 times [2021-08-25 20:10:22,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:10:22,963 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029212074] [2021-08-25 20:10:22,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:10:22,963 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:10:22,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:10:22,992 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:10:22,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:10:22,992 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029212074] [2021-08-25 20:10:22,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029212074] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:10:22,992 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:10:22,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:10:22,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593223108] [2021-08-25 20:10:22,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:10:22,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:10:22,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:10:22,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:10:22,993 INFO L87 Difference]: Start difference. First operand 515 states and 681 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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:10:23,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:10:23,186 INFO L93 Difference]: Finished difference Result 1326 states and 1752 transitions. [2021-08-25 20:10:23,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-25 20:10:23,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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:10:23,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:10:23,190 INFO L225 Difference]: With dead ends: 1326 [2021-08-25 20:10:23,190 INFO L226 Difference]: Without dead ends: 1054 [2021-08-25 20:10:23,192 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 16.1ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:10:23,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2021-08-25 20:10:23,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 554. [2021-08-25 20:10:23,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 543 states have (on average 1.3609576427255985) internal successors, (739), 553 states have internal predecessors, (739), 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:10:23,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 739 transitions. [2021-08-25 20:10:23,215 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 739 transitions. Word has length 32 [2021-08-25 20:10:23,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:10:23,215 INFO L470 AbstractCegarLoop]: Abstraction has 554 states and 739 transitions. [2021-08-25 20:10:23,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 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:10:23,216 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 739 transitions. [2021-08-25 20:10:23,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-25 20:10:23,216 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:10:23,217 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:10:23,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-25 20:10:23,217 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-08-25 20:10:23,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:10:23,217 INFO L82 PathProgramCache]: Analyzing trace with hash 175699761, now seen corresponding path program 1 times [2021-08-25 20:10:23,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:10:23,218 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77686800] [2021-08-25 20:10:23,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:10:23,218 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:10:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:10:23,257 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:10:23,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:10:23,258 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77686800] [2021-08-25 20:10:23,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77686800] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:10:23,260 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:10:23,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:10:23,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522952537] [2021-08-25 20:10:23,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:10:23,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:10:23,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:10:23,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:10:23,261 INFO L87 Difference]: Start difference. First operand 554 states and 739 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:10:23,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:10:23,297 INFO L93 Difference]: Finished difference Result 814 states and 1074 transitions. [2021-08-25 20:10:23,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:10:23,298 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:10:23,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:10:23,299 INFO L225 Difference]: With dead ends: 814 [2021-08-25 20:10:23,299 INFO L226 Difference]: Without dead ends: 615 [2021-08-25 20:10:23,300 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:10:23,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2021-08-25 20:10:23,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 542. [2021-08-25 20:10:23,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 534 states have (on average 1.350187265917603) internal successors, (721), 541 states have internal predecessors, (721), 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:10:23,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 721 transitions. [2021-08-25 20:10:23,320 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 721 transitions. Word has length 33 [2021-08-25 20:10:23,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:10:23,321 INFO L470 AbstractCegarLoop]: Abstraction has 542 states and 721 transitions. [2021-08-25 20:10:23,321 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:10:23,321 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 721 transitions. [2021-08-25 20:10:23,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-25 20:10:23,322 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:10:23,322 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:10:23,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-25 20:10:23,322 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-08-25 20:10:23,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:10:23,322 INFO L82 PathProgramCache]: Analyzing trace with hash -744399452, now seen corresponding path program 1 times [2021-08-25 20:10:23,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:10:23,323 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363138609] [2021-08-25 20:10:23,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:10:23,323 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:10:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:10:23,361 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:10:23,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:10:23,362 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363138609] [2021-08-25 20:10:23,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363138609] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:10:23,362 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:10:23,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:10:23,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625356308] [2021-08-25 20:10:23,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:10:23,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:10:23,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:10:23,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:10:23,364 INFO L87 Difference]: Start difference. First operand 542 states and 721 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:10:23,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:10:23,485 INFO L93 Difference]: Finished difference Result 637 states and 833 transitions. [2021-08-25 20:10:23,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:10:23,486 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:10:23,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:10:23,487 INFO L225 Difference]: With dead ends: 637 [2021-08-25 20:10:23,487 INFO L226 Difference]: Without dead ends: 571 [2021-08-25 20:10:23,488 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:10:23,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2021-08-25 20:10:23,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 542. [2021-08-25 20:10:23,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 534 states have (on average 1.3239700374531835) internal successors, (707), 541 states have internal predecessors, (707), 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:10:23,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 707 transitions. [2021-08-25 20:10:23,517 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 707 transitions. Word has length 33 [2021-08-25 20:10:23,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:10:23,517 INFO L470 AbstractCegarLoop]: Abstraction has 542 states and 707 transitions. [2021-08-25 20:10:23,517 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:10:23,517 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 707 transitions. [2021-08-25 20:10:23,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-25 20:10:23,518 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:10:23,518 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:10:23,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-25 20:10:23,518 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-08-25 20:10:23,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:10:23,519 INFO L82 PathProgramCache]: Analyzing trace with hash 536662182, now seen corresponding path program 1 times [2021-08-25 20:10:23,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:10:23,519 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856626346] [2021-08-25 20:10:23,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:10:23,519 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:10:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:10:23,544 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:10:23,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:10:23,545 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856626346] [2021-08-25 20:10:23,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856626346] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:10:23,545 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:10:23,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:10:23,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734604168] [2021-08-25 20:10:23,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:10:23,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:10:23,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:10:23,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:10:23,546 INFO L87 Difference]: Start difference. First operand 542 states and 707 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 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:10:23,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:10:23,593 INFO L93 Difference]: Finished difference Result 562 states and 727 transitions. [2021-08-25 20:10:23,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 20:10:23,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 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:10:23,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:10:23,595 INFO L225 Difference]: With dead ends: 562 [2021-08-25 20:10:23,596 INFO L226 Difference]: Without dead ends: 543 [2021-08-25 20:10:23,596 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-25 20:10:23,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2021-08-25 20:10:23,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 540. [2021-08-25 20:10:23,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 532 states have (on average 1.3195488721804511) internal successors, (702), 539 states have internal predecessors, (702), 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:10:23,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 702 transitions. [2021-08-25 20:10:23,616 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 702 transitions. Word has length 34 [2021-08-25 20:10:23,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:10:23,616 INFO L470 AbstractCegarLoop]: Abstraction has 540 states and 702 transitions. [2021-08-25 20:10:23,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 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:10:23,617 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 702 transitions. [2021-08-25 20:10:23,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-25 20:10:23,617 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:10:23,617 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:10:23,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-25 20:10:23,618 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-08-25 20:10:23,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:10:23,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1675490409, now seen corresponding path program 1 times [2021-08-25 20:10:23,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:10:23,618 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601532038] [2021-08-25 20:10:23,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:10:23,619 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:10:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:10:23,634 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:10:23,634 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:10:23,634 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601532038] [2021-08-25 20:10:23,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601532038] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:10:23,635 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:10:23,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:10:23,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070721530] [2021-08-25 20:10:23,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:10:23,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:10:23,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:10:23,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:10:23,636 INFO L87 Difference]: Start difference. First operand 540 states and 702 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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:10:23,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:10:23,678 INFO L93 Difference]: Finished difference Result 759 states and 970 transitions. [2021-08-25 20:10:23,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:10:23,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:10:23,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:10:23,681 INFO L225 Difference]: With dead ends: 759 [2021-08-25 20:10:23,681 INFO L226 Difference]: Without dead ends: 650 [2021-08-25 20:10:23,681 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:10:23,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2021-08-25 20:10:23,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 541. [2021-08-25 20:10:23,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 533 states have (on average 1.3189493433395871) internal successors, (703), 540 states have internal predecessors, (703), 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:10:23,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 703 transitions. [2021-08-25 20:10:23,701 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 703 transitions. Word has length 34 [2021-08-25 20:10:23,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:10:23,702 INFO L470 AbstractCegarLoop]: Abstraction has 541 states and 703 transitions. [2021-08-25 20:10:23,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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:10:23,702 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 703 transitions. [2021-08-25 20:10:23,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-25 20:10:23,702 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:10:23,702 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:10:23,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-25 20:10:23,703 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-08-25 20:10:23,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:10:23,703 INFO L82 PathProgramCache]: Analyzing trace with hash -930533145, now seen corresponding path program 1 times [2021-08-25 20:10:23,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:10:23,703 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961247435] [2021-08-25 20:10:23,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:10:23,704 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:10:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:10:23,729 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:10:23,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:10:23,730 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961247435] [2021-08-25 20:10:23,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961247435] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:10:23,730 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:10:23,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:10:23,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421183606] [2021-08-25 20:10:23,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:10:23,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:10:23,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:10:23,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:10:23,731 INFO L87 Difference]: Start difference. First operand 541 states and 703 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 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:10:23,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:10:23,781 INFO L93 Difference]: Finished difference Result 1236 states and 1594 transitions. [2021-08-25 20:10:23,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:10:23,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 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:10:23,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:10:23,783 INFO L225 Difference]: With dead ends: 1236 [2021-08-25 20:10:23,784 INFO L226 Difference]: Without dead ends: 704 [2021-08-25 20:10:23,784 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:10:23,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2021-08-25 20:10:23,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 600. [2021-08-25 20:10:23,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 592 states have (on average 1.3057432432432432) internal successors, (773), 599 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:10:23,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 773 transitions. [2021-08-25 20:10:23,810 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 773 transitions. Word has length 34 [2021-08-25 20:10:23,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:10:23,811 INFO L470 AbstractCegarLoop]: Abstraction has 600 states and 773 transitions. [2021-08-25 20:10:23,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 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:10:23,811 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 773 transitions. [2021-08-25 20:10:23,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-25 20:10:23,811 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:10:23,812 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:10:23,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-25 20:10:23,812 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-08-25 20:10:23,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:10:23,812 INFO L82 PathProgramCache]: Analyzing trace with hash -992572759, now seen corresponding path program 1 times [2021-08-25 20:10:23,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:10:23,813 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500527663] [2021-08-25 20:10:23,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:10:23,813 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:10:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:10:23,908 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:10:23,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:10:23,909 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500527663] [2021-08-25 20:10:23,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500527663] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:10:23,909 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:10:23,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:10:23,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479164468] [2021-08-25 20:10:23,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:10:23,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:10:23,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:10:23,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:10:23,910 INFO L87 Difference]: Start difference. First operand 600 states and 773 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 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:10:23,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:10:23,993 INFO L93 Difference]: Finished difference Result 789 states and 1014 transitions. [2021-08-25 20:10:23,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:10:23,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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:10:23,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:10:23,995 INFO L225 Difference]: With dead ends: 789 [2021-08-25 20:10:23,995 INFO L226 Difference]: Without dead ends: 570 [2021-08-25 20:10:23,996 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:10:23,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2021-08-25 20:10:24,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 565. [2021-08-25 20:10:24,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 558 states have (on average 1.2939068100358424) internal successors, (722), 564 states have internal predecessors, (722), 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:10:24,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 722 transitions. [2021-08-25 20:10:24,028 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 722 transitions. Word has length 34 [2021-08-25 20:10:24,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:10:24,028 INFO L470 AbstractCegarLoop]: Abstraction has 565 states and 722 transitions. [2021-08-25 20:10:24,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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:10:24,028 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 722 transitions. [2021-08-25 20:10:24,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-25 20:10:24,029 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:10:24,029 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:10:24,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-25 20:10:24,029 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-08-25 20:10:24,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:10:24,030 INFO L82 PathProgramCache]: Analyzing trace with hash 813687739, now seen corresponding path program 1 times [2021-08-25 20:10:24,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:10:24,030 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974824894] [2021-08-25 20:10:24,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:10:24,030 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:10:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:10:24,054 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:10:24,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:10:24,055 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974824894] [2021-08-25 20:10:24,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974824894] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:10:24,055 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:10:24,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:10:24,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248399382] [2021-08-25 20:10:24,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:10:24,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:10:24,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:10:24,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:10:24,056 INFO L87 Difference]: Start difference. First operand 565 states and 722 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:10:24,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:10:24,166 INFO L93 Difference]: Finished difference Result 637 states and 807 transitions. [2021-08-25 20:10:24,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:10:24,168 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:10:24,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:10:24,169 INFO L225 Difference]: With dead ends: 637 [2021-08-25 20:10:24,169 INFO L226 Difference]: Without dead ends: 538 [2021-08-25 20:10:24,170 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:10:24,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2021-08-25 20:10:24,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 522. [2021-08-25 20:10:24,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 515 states have (on average 1.2699029126213592) internal successors, (654), 521 states have internal predecessors, (654), 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:10:24,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 654 transitions. [2021-08-25 20:10:24,201 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 654 transitions. Word has length 35 [2021-08-25 20:10:24,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:10:24,201 INFO L470 AbstractCegarLoop]: Abstraction has 522 states and 654 transitions. [2021-08-25 20:10:24,201 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:10:24,201 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 654 transitions. [2021-08-25 20:10:24,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-25 20:10:24,202 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:10:24,202 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:10:24,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-25 20:10:24,202 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-08-25 20:10:24,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:10:24,202 INFO L82 PathProgramCache]: Analyzing trace with hash -759040003, now seen corresponding path program 1 times [2021-08-25 20:10:24,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:10:24,203 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956786012] [2021-08-25 20:10:24,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:10:24,203 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:10:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:10:24,218 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:10:24,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:10:24,219 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956786012] [2021-08-25 20:10:24,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956786012] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:10:24,219 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:10:24,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:10:24,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555731966] [2021-08-25 20:10:24,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:10:24,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:10:24,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:10:24,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:10:24,220 INFO L87 Difference]: Start difference. First operand 522 states and 654 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 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:10:24,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:10:24,303 INFO L93 Difference]: Finished difference Result 542 states and 671 transitions. [2021-08-25 20:10:24,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:10:24,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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:10:24,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:10:24,305 INFO L225 Difference]: With dead ends: 542 [2021-08-25 20:10:24,305 INFO L226 Difference]: Without dead ends: 521 [2021-08-25 20:10:24,305 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:10:24,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2021-08-25 20:10:24,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 515. [2021-08-25 20:10:24,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 509 states have (on average 1.2593320235756384) internal successors, (641), 514 states have internal predecessors, (641), 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:10:24,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 641 transitions. [2021-08-25 20:10:24,336 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 641 transitions. Word has length 35 [2021-08-25 20:10:24,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:10:24,337 INFO L470 AbstractCegarLoop]: Abstraction has 515 states and 641 transitions. [2021-08-25 20:10:24,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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:10:24,337 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 641 transitions. [2021-08-25 20:10:24,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-25 20:10:24,337 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:10:24,338 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:10:24,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-25 20:10:24,338 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-08-25 20:10:24,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:10:24,338 INFO L82 PathProgramCache]: Analyzing trace with hash 111409610, now seen corresponding path program 1 times [2021-08-25 20:10:24,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:10:24,339 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738601721] [2021-08-25 20:10:24,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:10:24,339 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:10:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:10:24,373 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:10:24,374 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:10:24,374 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738601721] [2021-08-25 20:10:24,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738601721] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:10:24,374 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:10:24,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:10:24,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528118500] [2021-08-25 20:10:24,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:10:24,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:10:24,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:10:24,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:10:24,375 INFO L87 Difference]: Start difference. First operand 515 states and 641 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:10:24,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:10:24,491 INFO L93 Difference]: Finished difference Result 720 states and 898 transitions. [2021-08-25 20:10:24,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:10:24,491 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:10:24,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:10:24,493 INFO L225 Difference]: With dead ends: 720 [2021-08-25 20:10:24,493 INFO L226 Difference]: Without dead ends: 536 [2021-08-25 20:10:24,494 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:10:24,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2021-08-25 20:10:24,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 512. [2021-08-25 20:10:24,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 506 states have (on average 1.2490118577075098) internal successors, (632), 511 states have internal predecessors, (632), 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:10:24,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 632 transitions. [2021-08-25 20:10:24,527 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 632 transitions. Word has length 35 [2021-08-25 20:10:24,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:10:24,527 INFO L470 AbstractCegarLoop]: Abstraction has 512 states and 632 transitions. [2021-08-25 20:10:24,527 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:10:24,527 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 632 transitions. [2021-08-25 20:10:24,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-25 20:10:24,528 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:10:24,528 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:10:24,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-25 20:10:24,528 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-08-25 20:10:24,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:10:24,529 INFO L82 PathProgramCache]: Analyzing trace with hash -949179113, now seen corresponding path program 1 times [2021-08-25 20:10:24,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:10:24,529 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129670689] [2021-08-25 20:10:24,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:10:24,529 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:10:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:10:24,545 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:10:24,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:10:24,545 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129670689] [2021-08-25 20:10:24,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129670689] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:10:24,545 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:10:24,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:10:24,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092801024] [2021-08-25 20:10:24,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:10:24,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:10:24,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:10:24,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:10:24,547 INFO L87 Difference]: Start difference. First operand 512 states and 632 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:10:24,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:10:24,587 INFO L93 Difference]: Finished difference Result 536 states and 657 transitions. [2021-08-25 20:10:24,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:10:24,588 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:10:24,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:10:24,589 INFO L225 Difference]: With dead ends: 536 [2021-08-25 20:10:24,590 INFO L226 Difference]: Without dead ends: 512 [2021-08-25 20:10:24,590 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:10:24,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2021-08-25 20:10:24,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 511. [2021-08-25 20:10:24,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 505 states have (on average 1.2396039603960396) internal successors, (626), 510 states have internal predecessors, (626), 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:10:24,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 626 transitions. [2021-08-25 20:10:24,632 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 626 transitions. Word has length 36 [2021-08-25 20:10:24,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:10:24,632 INFO L470 AbstractCegarLoop]: Abstraction has 511 states and 626 transitions. [2021-08-25 20:10:24,632 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:10:24,633 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 626 transitions. [2021-08-25 20:10:24,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-25 20:10:24,633 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:10:24,633 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:10:24,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-25 20:10:24,634 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-08-25 20:10:24,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:10:24,634 INFO L82 PathProgramCache]: Analyzing trace with hash -2037812492, now seen corresponding path program 1 times [2021-08-25 20:10:24,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:10:24,634 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122793215] [2021-08-25 20:10:24,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:10:24,634 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:10:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:10:24,662 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:10:24,662 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:10:24,662 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122793215] [2021-08-25 20:10:24,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122793215] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:10:24,662 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:10:24,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-25 20:10:24,663 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530040269] [2021-08-25 20:10:24,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:10:24,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:10:24,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:10:24,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:10:24,664 INFO L87 Difference]: Start difference. First operand 511 states and 626 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 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:10:24,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:10:24,804 INFO L93 Difference]: Finished difference Result 529 states and 642 transitions. [2021-08-25 20:10:24,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-25 20:10:24,805 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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:10:24,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:10:24,806 INFO L225 Difference]: With dead ends: 529 [2021-08-25 20:10:24,806 INFO L226 Difference]: Without dead ends: 526 [2021-08-25 20:10:24,807 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.1ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-08-25 20:10:24,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2021-08-25 20:10:24,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 517. [2021-08-25 20:10:24,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 511 states have (on average 1.2367906066536203) internal successors, (632), 516 states have internal predecessors, (632), 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:10:24,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 632 transitions. [2021-08-25 20:10:24,848 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 632 transitions. Word has length 36 [2021-08-25 20:10:24,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:10:24,848 INFO L470 AbstractCegarLoop]: Abstraction has 517 states and 632 transitions. [2021-08-25 20:10:24,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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:10:24,849 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 632 transitions. [2021-08-25 20:10:24,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-25 20:10:24,849 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:10:24,849 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:10:24,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-25 20:10:24,850 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-08-25 20:10:24,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:10:24,850 INFO L82 PathProgramCache]: Analyzing trace with hash -2037824408, now seen corresponding path program 1 times [2021-08-25 20:10:24,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:10:24,850 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450930333] [2021-08-25 20:10:24,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:10:24,851 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:10:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:10:24,883 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:10:24,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:10:24,884 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450930333] [2021-08-25 20:10:24,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450930333] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:10:24,884 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:10:24,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:10:24,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112969713] [2021-08-25 20:10:24,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:10:24,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:10:24,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:10:24,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:10:24,886 INFO L87 Difference]: Start difference. First operand 517 states and 632 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 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:10:25,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:10:25,003 INFO L93 Difference]: Finished difference Result 526 states and 639 transitions. [2021-08-25 20:10:25,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:10:25,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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:10:25,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:10:25,005 INFO L225 Difference]: With dead ends: 526 [2021-08-25 20:10:25,005 INFO L226 Difference]: Without dead ends: 501 [2021-08-25 20:10:25,005 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:10:25,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2021-08-25 20:10:25,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 497. [2021-08-25 20:10:25,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 491 states have (on average 1.2382892057026476) internal successors, (608), 496 states have internal predecessors, (608), 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:10:25,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 608 transitions. [2021-08-25 20:10:25,037 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 608 transitions. Word has length 36 [2021-08-25 20:10:25,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:10:25,038 INFO L470 AbstractCegarLoop]: Abstraction has 497 states and 608 transitions. [2021-08-25 20:10:25,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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:10:25,038 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 608 transitions. [2021-08-25 20:10:25,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-25 20:10:25,038 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:10:25,039 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:10:25,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-25 20:10:25,039 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-08-25 20:10:25,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:10:25,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1481841291, now seen corresponding path program 1 times [2021-08-25 20:10:25,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:10:25,040 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072050724] [2021-08-25 20:10:25,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:10:25,040 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:10:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:10:25,061 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:10:25,061 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:10:25,061 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072050724] [2021-08-25 20:10:25,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072050724] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:10:25,062 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:10:25,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:10:25,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012749742] [2021-08-25 20:10:25,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:10:25,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:10:25,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:10:25,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:10:25,063 INFO L87 Difference]: Start difference. First operand 497 states and 608 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:10:25,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:10:25,104 INFO L93 Difference]: Finished difference Result 513 states and 622 transitions. [2021-08-25 20:10:25,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 20:10:25,105 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:10:25,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:10:25,106 INFO L225 Difference]: With dead ends: 513 [2021-08-25 20:10:25,106 INFO L226 Difference]: Without dead ends: 492 [2021-08-25 20:10:25,107 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:10:25,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2021-08-25 20:10:25,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 480. [2021-08-25 20:10:25,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 474 states have (on average 1.240506329113924) internal successors, (588), 479 states have internal predecessors, (588), 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:10:25,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 588 transitions. [2021-08-25 20:10:25,142 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 588 transitions. Word has length 38 [2021-08-25 20:10:25,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:10:25,142 INFO L470 AbstractCegarLoop]: Abstraction has 480 states and 588 transitions. [2021-08-25 20:10:25,142 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:10:25,143 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 588 transitions. [2021-08-25 20:10:25,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-25 20:10:25,143 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:10:25,143 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:10:25,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-25 20:10:25,144 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-08-25 20:10:25,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:10:25,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1021756590, now seen corresponding path program 1 times [2021-08-25 20:10:25,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:10:25,145 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312360899] [2021-08-25 20:10:25,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:10:25,145 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:10:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:10:25,166 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:10:25,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:10:25,166 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312360899] [2021-08-25 20:10:25,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312360899] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:10:25,167 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:10:25,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:10:25,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783563230] [2021-08-25 20:10:25,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:10:25,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:10:25,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:10:25,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:10:25,168 INFO L87 Difference]: Start difference. First operand 480 states and 588 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 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:10:25,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:10:25,255 INFO L93 Difference]: Finished difference Result 839 states and 1026 transitions. [2021-08-25 20:10:25,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:10:25,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 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:10:25,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:10:25,258 INFO L225 Difference]: With dead ends: 839 [2021-08-25 20:10:25,258 INFO L226 Difference]: Without dead ends: 658 [2021-08-25 20:10:25,258 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:10:25,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2021-08-25 20:10:25,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 483. [2021-08-25 20:10:25,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 477 states have (on average 1.2389937106918238) internal successors, (591), 482 states have internal predecessors, (591), 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:10:25,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 591 transitions. [2021-08-25 20:10:25,290 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 591 transitions. Word has length 38 [2021-08-25 20:10:25,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:10:25,290 INFO L470 AbstractCegarLoop]: Abstraction has 483 states and 591 transitions. [2021-08-25 20:10:25,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 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:10:25,290 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 591 transitions. [2021-08-25 20:10:25,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-25 20:10:25,291 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:10:25,291 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:10:25,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-25 20:10:25,291 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-08-25 20:10:25,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:10:25,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1329794158, now seen corresponding path program 1 times [2021-08-25 20:10:25,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:10:25,292 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235857095] [2021-08-25 20:10:25,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:10:25,292 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:10:25,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:10:25,329 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:10:25,329 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:10:25,330 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235857095] [2021-08-25 20:10:25,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235857095] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:10:25,330 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:10:25,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:10:25,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956812511] [2021-08-25 20:10:25,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:10:25,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:10:25,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:10:25,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:10:25,331 INFO L87 Difference]: Start difference. First operand 483 states and 591 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 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:10:25,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:10:25,476 INFO L93 Difference]: Finished difference Result 824 states and 994 transitions. [2021-08-25 20:10:25,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:10:25,477 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 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:10:25,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:10:25,479 INFO L225 Difference]: With dead ends: 824 [2021-08-25 20:10:25,479 INFO L226 Difference]: Without dead ends: 668 [2021-08-25 20:10:25,479 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.8ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-25 20:10:25,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2021-08-25 20:10:25,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 483. [2021-08-25 20:10:25,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 477 states have (on average 1.230607966457023) internal successors, (587), 482 states have internal predecessors, (587), 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:10:25,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 587 transitions. [2021-08-25 20:10:25,512 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 587 transitions. Word has length 38 [2021-08-25 20:10:25,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:10:25,512 INFO L470 AbstractCegarLoop]: Abstraction has 483 states and 587 transitions. [2021-08-25 20:10:25,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 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:10:25,512 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 587 transitions. [2021-08-25 20:10:25,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-08-25 20:10:25,513 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:10:25,513 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:10:25,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-25 20:10:25,513 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-08-25 20:10:25,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:10:25,514 INFO L82 PathProgramCache]: Analyzing trace with hash 595887759, now seen corresponding path program 1 times [2021-08-25 20:10:25,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:10:25,514 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761096096] [2021-08-25 20:10:25,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:10:25,514 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:10:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:10:25,560 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:10:25,561 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:10:25,561 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761096096] [2021-08-25 20:10:25,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761096096] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:10:25,561 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:10:25,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:10:25,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909768832] [2021-08-25 20:10:25,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:10:25,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:10:25,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:10:25,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:10:25,562 INFO L87 Difference]: Start difference. First operand 483 states and 587 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:10:25,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:10:25,733 INFO L93 Difference]: Finished difference Result 946 states and 1156 transitions. [2021-08-25 20:10:25,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-25 20:10:25,733 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:10:25,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:10:25,735 INFO L225 Difference]: With dead ends: 946 [2021-08-25 20:10:25,736 INFO L226 Difference]: Without dead ends: 816 [2021-08-25 20:10:25,736 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 28.0ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:10:25,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2021-08-25 20:10:25,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 483. [2021-08-25 20:10:25,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 477 states have (on average 1.228511530398323) internal successors, (586), 482 states have internal predecessors, (586), 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:10:25,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 586 transitions. [2021-08-25 20:10:25,776 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 586 transitions. Word has length 41 [2021-08-25 20:10:25,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:10:25,776 INFO L470 AbstractCegarLoop]: Abstraction has 483 states and 586 transitions. [2021-08-25 20:10:25,777 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:10:25,777 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 586 transitions. [2021-08-25 20:10:25,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-08-25 20:10:25,778 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:10:25,778 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:10:25,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-08-25 20:10:25,778 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-08-25 20:10:25,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:10:25,779 INFO L82 PathProgramCache]: Analyzing trace with hash 768333102, now seen corresponding path program 1 times [2021-08-25 20:10:25,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:10:25,779 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157532456] [2021-08-25 20:10:25,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:10:25,779 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:10:25,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:10:25,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:10:25,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:10:25,816 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157532456] [2021-08-25 20:10:25,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157532456] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:10:25,816 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:10:25,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-25 20:10:25,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511049564] [2021-08-25 20:10:25,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-25 20:10:25,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:10:25,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-25 20:10:25,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-25 20:10:25,818 INFO L87 Difference]: Start difference. First operand 483 states and 586 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 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:10:25,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:10:25,968 INFO L93 Difference]: Finished difference Result 501 states and 603 transitions. [2021-08-25 20:10:25,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-25 20:10:25,968 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 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:10:25,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:10:25,970 INFO L225 Difference]: With dead ends: 501 [2021-08-25 20:10:25,970 INFO L226 Difference]: Without dead ends: 385 [2021-08-25 20:10:25,971 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.6ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-08-25 20:10:25,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2021-08-25 20:10:25,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 367. [2021-08-25 20:10:25,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 362 states have (on average 1.2320441988950277) internal successors, (446), 366 states have internal predecessors, (446), 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:10:25,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 446 transitions. [2021-08-25 20:10:25,998 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 446 transitions. Word has length 41 [2021-08-25 20:10:25,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:10:25,999 INFO L470 AbstractCegarLoop]: Abstraction has 367 states and 446 transitions. [2021-08-25 20:10:25,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 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:10:25,999 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 446 transitions. [2021-08-25 20:10:26,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-08-25 20:10:26,001 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:10:26,001 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] [2021-08-25 20:10:26,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-08-25 20:10:26,001 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-08-25 20:10:26,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:10:26,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1022149612, now seen corresponding path program 1 times [2021-08-25 20:10:26,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:10:26,002 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382126944] [2021-08-25 20:10:26,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:10:26,002 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:10:26,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:10:26,024 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:10:26,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:10:26,024 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382126944] [2021-08-25 20:10:26,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382126944] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:10:26,024 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:10:26,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:10:26,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369741309] [2021-08-25 20:10:26,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:10:26,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:10:26,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:10:26,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:10:26,025 INFO L87 Difference]: Start difference. First operand 367 states and 446 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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:10:26,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:10:26,100 INFO L93 Difference]: Finished difference Result 500 states and 615 transitions. [2021-08-25 20:10:26,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:10:26,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 45 [2021-08-25 20:10:26,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:10:26,101 INFO L225 Difference]: With dead ends: 500 [2021-08-25 20:10:26,101 INFO L226 Difference]: Without dead ends: 329 [2021-08-25 20:10:26,102 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:10:26,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2021-08-25 20:10:26,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2021-08-25 20:10:26,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 326 states have (on average 1.2177914110429449) internal successors, (397), 328 states have internal predecessors, (397), 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:10:26,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 397 transitions. [2021-08-25 20:10:26,133 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 397 transitions. Word has length 45 [2021-08-25 20:10:26,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:10:26,133 INFO L470 AbstractCegarLoop]: Abstraction has 329 states and 397 transitions. [2021-08-25 20:10:26,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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:10:26,134 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 397 transitions. [2021-08-25 20:10:26,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-08-25 20:10:26,134 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:10:26,135 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] [2021-08-25 20:10:26,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-08-25 20:10:26,135 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-08-25 20:10:26,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:10:26,135 INFO L82 PathProgramCache]: Analyzing trace with hash 632304062, now seen corresponding path program 1 times [2021-08-25 20:10:26,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:10:26,136 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072847661] [2021-08-25 20:10:26,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:10:26,136 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:10:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:10:26,177 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:10:26,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:10:26,178 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072847661] [2021-08-25 20:10:26,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072847661] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:10:26,178 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:10:26,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-25 20:10:26,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000428979] [2021-08-25 20:10:26,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-25 20:10:26,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:10:26,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-25 20:10:26,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-25 20:10:26,179 INFO L87 Difference]: Start difference. First operand 329 states and 397 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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:10:26,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:10:26,315 INFO L93 Difference]: Finished difference Result 459 states and 546 transitions. [2021-08-25 20:10:26,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-25 20:10:26,315 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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 51 [2021-08-25 20:10:26,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:10:26,317 INFO L225 Difference]: With dead ends: 459 [2021-08-25 20:10:26,317 INFO L226 Difference]: Without dead ends: 441 [2021-08-25 20:10:26,317 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 49.5ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-08-25 20:10:26,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2021-08-25 20:10:26,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 335. [2021-08-25 20:10:26,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 332 states have (on average 1.213855421686747) internal successors, (403), 334 states have internal predecessors, (403), 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:10:26,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 403 transitions. [2021-08-25 20:10:26,342 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 403 transitions. Word has length 51 [2021-08-25 20:10:26,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:10:26,342 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 403 transitions. [2021-08-25 20:10:26,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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:10:26,342 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 403 transitions. [2021-08-25 20:10:26,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-08-25 20:10:26,343 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:10:26,343 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] [2021-08-25 20:10:26,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-08-25 20:10:26,343 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-08-25 20:10:26,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:10:26,343 INFO L82 PathProgramCache]: Analyzing trace with hash -605199811, now seen corresponding path program 1 times [2021-08-25 20:10:26,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:10:26,344 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925914980] [2021-08-25 20:10:26,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:10:26,344 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:10:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:10:26,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:10:26,381 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:10:26,381 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925914980] [2021-08-25 20:10:26,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925914980] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:10:26,381 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:10:26,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-25 20:10:26,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995197546] [2021-08-25 20:10:26,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-25 20:10:26,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:10:26,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-25 20:10:26,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-25 20:10:26,383 INFO L87 Difference]: Start difference. First operand 335 states and 403 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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:10:26,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:10:26,517 INFO L93 Difference]: Finished difference Result 464 states and 551 transitions. [2021-08-25 20:10:26,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-25 20:10:26,518 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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 52 [2021-08-25 20:10:26,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:10:26,519 INFO L225 Difference]: With dead ends: 464 [2021-08-25 20:10:26,519 INFO L226 Difference]: Without dead ends: 446 [2021-08-25 20:10:26,520 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.5ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-08-25 20:10:26,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2021-08-25 20:10:26,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 329. [2021-08-25 20:10:26,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 326 states have (on average 1.2147239263803682) internal successors, (396), 328 states have internal predecessors, (396), 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:10:26,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 396 transitions. [2021-08-25 20:10:26,544 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 396 transitions. Word has length 52 [2021-08-25 20:10:26,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:10:26,544 INFO L470 AbstractCegarLoop]: Abstraction has 329 states and 396 transitions. [2021-08-25 20:10:26,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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:10:26,544 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 396 transitions. [2021-08-25 20:10:26,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-08-25 20:10:26,545 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:10:26,545 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:10:26,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-08-25 20:10:26,545 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-08-25 20:10:26,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:10:26,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1054423066, now seen corresponding path program 1 times [2021-08-25 20:10:26,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:10:26,546 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551753039] [2021-08-25 20:10:26,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:10:26,546 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:10:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:10:26,563 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:10:26,564 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:10:26,564 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551753039] [2021-08-25 20:10:26,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551753039] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:10:26,564 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:10:26,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:10:26,564 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103915955] [2021-08-25 20:10:26,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:10:26,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:10:26,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:10:26,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:10:26,565 INFO L87 Difference]: Start difference. First operand 329 states and 396 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:10:26,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:10:26,605 INFO L93 Difference]: Finished difference Result 575 states and 698 transitions. [2021-08-25 20:10:26,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:10:26,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:10:26,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:10:26,606 INFO L225 Difference]: With dead ends: 575 [2021-08-25 20:10:26,606 INFO L226 Difference]: Without dead ends: 383 [2021-08-25 20:10:26,607 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:10:26,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2021-08-25 20:10:26,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 329. [2021-08-25 20:10:26,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 326 states have (on average 1.2024539877300613) internal successors, (392), 328 states have internal predecessors, (392), 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:10:26,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 392 transitions. [2021-08-25 20:10:26,631 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 392 transitions. Word has length 54 [2021-08-25 20:10:26,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:10:26,631 INFO L470 AbstractCegarLoop]: Abstraction has 329 states and 392 transitions. [2021-08-25 20:10:26,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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:10:26,632 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 392 transitions. [2021-08-25 20:10:26,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-08-25 20:10:26,632 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:10:26,632 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] [2021-08-25 20:10:26,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-08-25 20:10:26,633 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-08-25 20:10:26,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:10:26,633 INFO L82 PathProgramCache]: Analyzing trace with hash 273758220, now seen corresponding path program 1 times [2021-08-25 20:10:26,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:10:26,633 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796682812] [2021-08-25 20:10:26,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:10:26,634 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:10:26,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:10:26,644 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-25 20:10:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:10:26,695 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-25 20:10:26,696 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-25 20:10:26,697 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,698 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,698 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,699 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,699 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,699 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,700 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,700 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,700 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,700 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,700 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,700 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,700 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,700 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,701 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,701 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,701 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,701 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,701 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,701 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,701 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,701 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,702 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,702 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,702 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,703 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,703 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,703 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,703 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,703 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,703 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,703 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,703 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,704 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,704 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,704 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,704 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,704 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,704 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,704 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,704 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:10:26,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-08-25 20:10:26,710 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:10:26,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:10:26 BoogieIcfgContainer [2021-08-25 20:10:26,812 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:10:26,813 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:10:26,813 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:10:26,813 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:10:26,814 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:10:20" (3/4) ... [2021-08-25 20:10:26,815 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-25 20:10:26,890 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-25 20:10:26,891 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:10:26,892 INFO L168 Benchmark]: Toolchain (without parser) took 8057.22 ms. Allocated memory was 54.5 MB in the beginning and 325.1 MB in the end (delta: 270.5 MB). Free memory was 31.1 MB in the beginning and 137.6 MB in the end (delta: -106.6 MB). Peak memory consumption was 162.6 MB. Max. memory is 16.1 GB. [2021-08-25 20:10:26,893 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 54.5 MB. Free memory was 36.9 MB in the beginning and 36.9 MB in the end (delta: 26.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:10:26,893 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.85 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 30.8 MB in the beginning and 44.6 MB in the end (delta: -13.7 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.1 GB. [2021-08-25 20:10:26,894 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.65 ms. Allocated memory is still 67.1 MB. Free memory was 44.4 MB in the beginning and 36.7 MB in the end (delta: 7.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-08-25 20:10:26,894 INFO L168 Benchmark]: Boogie Preprocessor took 93.31 ms. Allocated memory is still 67.1 MB. Free memory was 36.7 MB in the beginning and 45.5 MB in the end (delta: -8.8 MB). Peak memory consumption was 9.6 MB. Max. memory is 16.1 GB. [2021-08-25 20:10:26,894 INFO L168 Benchmark]: RCFGBuilder took 1012.79 ms. Allocated memory was 67.1 MB in the beginning and 83.9 MB in the end (delta: 16.8 MB). Free memory was 45.2 MB in the beginning and 37.4 MB in the end (delta: 7.8 MB). Peak memory consumption was 30.9 MB. Max. memory is 16.1 GB. [2021-08-25 20:10:26,894 INFO L168 Benchmark]: TraceAbstraction took 6459.55 ms. Allocated memory was 83.9 MB in the beginning and 325.1 MB in the end (delta: 241.2 MB). Free memory was 36.9 MB in the beginning and 155.5 MB in the end (delta: -118.6 MB). Peak memory consumption was 123.0 MB. Max. memory is 16.1 GB. [2021-08-25 20:10:26,895 INFO L168 Benchmark]: Witness Printer took 78.13 ms. Allocated memory is still 325.1 MB. Free memory was 154.4 MB in the beginning and 137.6 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:10:26,896 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.11 ms. Allocated memory is still 54.5 MB. Free memory was 36.9 MB in the beginning and 36.9 MB in the end (delta: 26.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 325.85 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 30.8 MB in the beginning and 44.6 MB in the end (delta: -13.7 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 82.65 ms. Allocated memory is still 67.1 MB. Free memory was 44.4 MB in the beginning and 36.7 MB in the end (delta: 7.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 93.31 ms. Allocated memory is still 67.1 MB. Free memory was 36.7 MB in the beginning and 45.5 MB in the end (delta: -8.8 MB). Peak memory consumption was 9.6 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1012.79 ms. Allocated memory was 67.1 MB in the beginning and 83.9 MB in the end (delta: 16.8 MB). Free memory was 45.2 MB in the beginning and 37.4 MB in the end (delta: 7.8 MB). Peak memory consumption was 30.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 6459.55 ms. Allocated memory was 83.9 MB in the beginning and 325.1 MB in the end (delta: 241.2 MB). Free memory was 36.9 MB in the beginning and 155.5 MB in the end (delta: -118.6 MB). Peak memory consumption was 123.0 MB. Max. memory is 16.1 GB. * Witness Printer took 78.13 ms. Allocated memory is still 325.1 MB. Free memory was 154.4 MB in the beginning and 137.6 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: 65]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L36] int FloppyThread ; [L37] int KernelMode ; [L38] int Suspended ; [L39] int Executive ; [L40] int DiskController ; [L41] int FloppyDiskPeripheral ; [L42] int FlConfigCallBack ; [L43] int MaximumInterfaceType ; [L44] int MOUNTDEV_MOUNTED_DEVICE_GUID ; [L45] int myStatus ; [L46] int s ; [L47] int UNLOADED ; [L48] int NP ; [L49] int DC ; [L50] int SKIP1 ; [L51] int SKIP2 ; [L52] int MPR1 ; [L53] int MPR3 ; [L54] int IPC ; [L55] int pended ; [L56] int compRegistered ; [L57] int lowerDriverReturn ; [L58] int setEventCalled ; [L59] int customIrp ; [L91] int PagingReferenceCount = 0; [L92] 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] [L671] int status ; [L672] int irp = __VERIFIER_nondet_int() ; [L673] int pirp ; [L674] int pirp__IoStatus__Status ; [L675] int irp_choice = __VERIFIER_nondet_int() ; [L676] int devobj = __VERIFIER_nondet_int() ; [L677] int __cil_tmp8 ; [L679] FloppyThread = 0 [L680] KernelMode = 0 [L681] Suspended = 0 [L682] Executive = 0 [L683] DiskController = 0 [L684] FloppyDiskPeripheral = 0 [L685] FlConfigCallBack = 0 [L686] MaximumInterfaceType = 0 [L687] MOUNTDEV_MOUNTED_DEVICE_GUID = 0 [L688] myStatus = 0 [L689] s = 0 [L690] UNLOADED = 0 [L691] NP = 0 [L692] DC = 0 [L693] SKIP1 = 0 [L694] SKIP2 = 0 [L695] MPR1 = 0 [L696] MPR3 = 0 [L697] IPC = 0 [L698] pended = 0 [L699] compRegistered = 0 [L700] lowerDriverReturn = 0 [L701] setEventCalled = 0 [L702] customIrp = 0 [L706] status = 0 [L707] pirp = irp [L74] UNLOADED = 0 [L75] NP = 1 [L76] DC = 2 [L77] SKIP1 = 3 [L78] SKIP2 = 4 [L79] MPR1 = 5 [L80] MPR3 = 6 [L81] IPC = 7 [L82] s = UNLOADED [L83] pended = 0 [L84] compRegistered = 0 [L85] lowerDriverReturn = 0 [L86] setEventCalled = 0 [L87] 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] [L710] COND TRUE status >= 0 [L711] s = NP [L712] customIrp = 0 [L713] setEventCalled = customIrp [L714] lowerDriverReturn = setEventCalled [L715] compRegistered = lowerDriverReturn [L716] pended = compRegistered [L717] pirp__IoStatus__Status = 0 [L718] 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] [L719] COND TRUE irp_choice == 0 [L720] pirp__IoStatus__Status = -1073741637 [L721] 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] [L661] s = NP [L662] pended = 0 [L663] compRegistered = 0 [L664] lowerDriverReturn = 0 [L665] setEventCalled = 0 [L666] 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] [L727] COND FALSE !(status < 0) [L731] int tmp_ndt_1; [L732] tmp_ndt_1 = __VERIFIER_nondet_int() [L733] COND TRUE tmp_ndt_1 == 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] [L164] int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ; [L165] int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ; [L166] int Irp__IoStatus__Information ; [L167] int Irp__IoStatus__Status ; [L168] int Irp__CurrentLocation = __VERIFIER_nondet_int() ; [L169] int disketteExtension__IsRemoved = __VERIFIER_nondet_int() ; [L170] int disketteExtension__IsStarted = __VERIFIER_nondet_int() ; [L171] int disketteExtension__TargetObject = __VERIFIER_nondet_int() ; [L172] int disketteExtension__HoldNewRequests ; [L173] int disketteExtension__FloppyThread = __VERIFIER_nondet_int() ; [L174] int disketteExtension__InterfaceString__Buffer = __VERIFIER_nondet_int() ; [L175] int disketteExtension__InterfaceString = __VERIFIER_nondet_int() ; [L176] int disketteExtension__ArcName__Length = __VERIFIER_nondet_int() ; [L177] int disketteExtension__ArcName = __VERIFIER_nondet_int() ; [L178] int irpSp__MinorFunction = __VERIFIER_nondet_int() ; [L179] int IoGetConfigurationInformation__FloppyCount = __VERIFIER_nondet_int() ; [L180] int irpSp ; [L181] int disketteExtension ; [L182] int ntStatus ; [L183] int doneEvent = __VERIFIER_nondet_int() ; [L184] int irpSp___0 ; [L185] int nextIrpSp ; [L186] int nextIrpSp__Control ; [L187] int irpSp___1 ; [L188] int irpSp__Context ; [L189] int irpSp__Control ; [L190] long __cil_tmp29 ; [L191] long __cil_tmp30 ; [L194] ntStatus = 0 [L195] 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] [L196] 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] [L199] disketteExtension = DeviceObject__DeviceExtension [L200] 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] [L201] 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] [L210] 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] [L213] 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 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] [L242] COND FALSE !(! disketteExtension__IsStarted) [L258] disketteExtension__HoldNewRequests = 1 [L101] int status ; [L102] int threadHandle = __VERIFIER_nondet_int() ; [L103] int DisketteExtension__PoweringDown = __VERIFIER_nondet_int() ; [L104] int DisketteExtension__ThreadReferenceCount = __VERIFIER_nondet_int() ; [L105] int DisketteExtension__FloppyThread = __VERIFIER_nondet_int() ; [L106] int Irp__IoStatus__Status ; [L107] int Irp__IoStatus__Information ; [L108] int Irp__Tail__Overlay__CurrentStackLocation__Control ; [L109] int ObjAttributes = __VERIFIER_nondet_int() ; [L110] int __cil_tmp12 ; [L111] 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] [L114] COND FALSE !(DisketteExtension__PoweringDown == 1) [L120] 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] [L121] 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] [L153] COND TRUE pended == 0 [L154] 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] [L160] 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] [L259] ntStatus = FlQueueIrpToThread(Irp, disketteExtension) [L262] __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] [L263] COND TRUE __cil_tmp29 == 259L [L1036] 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] [L1045] 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] [L1049] 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] [L1056] int tmp_ndt_8; [L1057] tmp_ndt_8 = __VERIFIER_nondet_int() [L1058] COND TRUE tmp_ndt_8 == 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] [L1064] 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] [L268] 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] [L271] disketteExtension__FloppyThread = 0 [L272] Irp__IoStatus__Status = 0 [L273] 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] [L274] COND TRUE s == NP [L275] 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] [L282] Irp__CurrentLocation ++ [L283] Irp__Tail__Overlay__CurrentStackLocation ++ [L938] int returnVal2 ; [L939] int compRetStatus1 ; [L940] int lcontext = __VERIFIER_nondet_int() ; [L941] 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] [L944] 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] [L957] int tmp_ndt_12; [L958] tmp_ndt_12 = __VERIFIER_nondet_int() [L959] 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=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L970] 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] [L983] 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] [L987] 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] [L996] COND TRUE s == SKIP1 [L997] s = SKIP2 [L998] 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] [L1006] 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] [L284] ntStatus = IofCallDriver(disketteExtension__TargetObject, Irp) [L430] 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] [L431] 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] [L434] 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] [L740] status = FloppyPnp(devobj, pirp) [L750] 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] [L751] 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] [L758] 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] [L759] 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] [L766] 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] [L767] 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] [L768] 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] [L782] 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] [L783] 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] [L65] 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: 65]: 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: 65]: 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: 65]: 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: 65]: 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: 65]: 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: 65]: 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: 65]: 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: 65]: 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: 65]: 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: 65]: 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: 65]: 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: 65]: 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: 65]: 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: 65]: 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: 65]: 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: 65]: 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: 65]: 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: 65]: 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: 65]: 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: 65]: 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: 65]: 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: 65]: 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: 65]: 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: 65]: 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: 65]: 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: 65]: 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: 65]: 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: 65]: 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: 65]: 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: 65]: 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: 65]: 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: 65]: 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: 65]: 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: 65]: 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: 65]: 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: 65]: 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: 65]: 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: 65]: 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: 65]: 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: 65]: 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, 421 locations, 41 error locations. Started 1 CEGAR loops. OverallTime: 6296.9ms, OverallIterations: 37, TraceHistogramMax: 1, EmptinessCheckTime: 34.9ms, AutomataDifference: 3667.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 11.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 15759 SDtfs, 11084 SDslu, 19554 SDs, 0 SdLazy, 3079 SolverSat, 405 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1553.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 184 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 367.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=600occurred in iteration=20, InterpolantAutomatonStates: 155, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 950.4ms AutomataMinimizationTime, 36 MinimizatonAttempts, 2440 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 83.8ms SsaConstructionTime, 271.7ms SatisfiabilityAnalysisTime, 921.4ms InterpolantComputationTime, 1208 NumberOfCodeBlocks, 1208 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1117 ConstructedInterpolants, 0 QuantifiedInterpolants, 2752 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 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:10:26,933 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...