./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff8f36a2-359c-4cee-a1bd-36a2449c7615/bin/uautomizer-GMMbpWq8iD/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff8f36a2-359c-4cee-a1bd-36a2449c7615/bin/uautomizer-GMMbpWq8iD/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff8f36a2-359c-4cee-a1bd-36a2449c7615/bin/uautomizer-GMMbpWq8iD/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff8f36a2-359c-4cee-a1bd-36a2449c7615/bin/uautomizer-GMMbpWq8iD/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff8f36a2-359c-4cee-a1bd-36a2449c7615/bin/uautomizer-GMMbpWq8iD/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff8f36a2-359c-4cee-a1bd-36a2449c7615/bin/uautomizer-GMMbpWq8iD --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 bfc29f03d3be9b41eb07ac14f0f7eac45bf3a60a4a6601e3132f720b72534d53 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-b2eff8b [2021-10-28 23:20:31,585 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 23:20:31,589 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 23:20:31,626 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 23:20:31,626 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 23:20:31,628 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 23:20:31,630 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 23:20:31,632 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 23:20:31,635 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 23:20:31,636 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 23:20:31,637 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 23:20:31,639 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 23:20:31,640 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 23:20:31,641 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 23:20:31,643 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 23:20:31,644 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 23:20:31,646 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 23:20:31,647 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 23:20:31,650 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 23:20:31,652 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 23:20:31,654 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 23:20:31,658 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 23:20:31,660 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 23:20:31,661 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 23:20:31,665 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 23:20:31,671 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 23:20:31,672 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 23:20:31,673 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 23:20:31,674 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 23:20:31,675 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 23:20:31,676 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 23:20:31,677 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 23:20:31,678 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 23:20:31,679 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 23:20:31,680 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 23:20:31,681 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 23:20:31,682 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 23:20:31,682 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 23:20:31,683 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 23:20:31,684 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 23:20:31,685 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 23:20:31,687 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff8f36a2-359c-4cee-a1bd-36a2449c7615/bin/uautomizer-GMMbpWq8iD/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-28 23:20:31,715 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 23:20:31,715 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 23:20:31,716 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 23:20:31,716 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 23:20:31,718 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 23:20:31,718 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 23:20:31,718 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 23:20:31,719 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 23:20:31,719 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 23:20:31,719 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 23:20:31,720 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 23:20:31,720 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 23:20:31,720 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-28 23:20:31,720 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 23:20:31,721 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-28 23:20:31,721 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 23:20:31,721 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 23:20:31,722 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 23:20:31,722 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-28 23:20:31,722 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 23:20:31,723 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 23:20:31,723 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 23:20:31,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 23:20:31,723 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 23:20:31,724 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 23:20:31,724 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-28 23:20:31,724 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 23:20:31,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 23:20:31,725 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-28 23:20:31,725 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-28 23:20:31,726 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-28 23:20:31,726 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 23:20:31,726 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff8f36a2-359c-4cee-a1bd-36a2449c7615/bin/uautomizer-GMMbpWq8iD/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff8f36a2-359c-4cee-a1bd-36a2449c7615/bin/uautomizer-GMMbpWq8iD 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 -> bfc29f03d3be9b41eb07ac14f0f7eac45bf3a60a4a6601e3132f720b72534d53 [2021-10-28 23:20:31,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 23:20:32,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 23:20:32,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 23:20:32,041 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 23:20:32,042 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 23:20:32,043 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff8f36a2-359c-4cee-a1bd-36a2449c7615/bin/uautomizer-GMMbpWq8iD/../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2021-10-28 23:20:32,146 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff8f36a2-359c-4cee-a1bd-36a2449c7615/bin/uautomizer-GMMbpWq8iD/data/d1f0a76a2/964fb39ec9524d98b72178c72e2313eb/FLAGb24b46483 [2021-10-28 23:20:32,739 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 23:20:32,740 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff8f36a2-359c-4cee-a1bd-36a2449c7615/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2021-10-28 23:20:32,770 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff8f36a2-359c-4cee-a1bd-36a2449c7615/bin/uautomizer-GMMbpWq8iD/data/d1f0a76a2/964fb39ec9524d98b72178c72e2313eb/FLAGb24b46483 [2021-10-28 23:20:33,008 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff8f36a2-359c-4cee-a1bd-36a2449c7615/bin/uautomizer-GMMbpWq8iD/data/d1f0a76a2/964fb39ec9524d98b72178c72e2313eb [2021-10-28 23:20:33,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 23:20:33,012 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 23:20:33,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 23:20:33,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 23:20:33,028 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 23:20:33,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 11:20:33" (1/1) ... [2021-10-28 23:20:33,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1958b564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:20:33, skipping insertion in model container [2021-10-28 23:20:33,033 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 11:20:33" (1/1) ... [2021-10-28 23:20:33,041 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 23:20:33,125 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 23:20:33,334 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff8f36a2-359c-4cee-a1bd-36a2449c7615/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c[2074,2087] [2021-10-28 23:20:33,545 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 23:20:33,567 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 23:20:33,595 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff8f36a2-359c-4cee-a1bd-36a2449c7615/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c[2074,2087] [2021-10-28 23:20:33,765 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 23:20:33,782 INFO L208 MainTranslator]: Completed translation [2021-10-28 23:20:33,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:20:33 WrapperNode [2021-10-28 23:20:33,783 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 23:20:33,784 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 23:20:33,784 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 23:20:33,784 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 23:20:33,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:20:33" (1/1) ... [2021-10-28 23:20:33,831 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:20:33" (1/1) ... [2021-10-28 23:20:34,021 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 23:20:34,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 23:20:34,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 23:20:34,023 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 23:20:34,032 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:20:33" (1/1) ... [2021-10-28 23:20:34,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:20:33" (1/1) ... [2021-10-28 23:20:34,046 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:20:33" (1/1) ... [2021-10-28 23:20:34,047 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:20:33" (1/1) ... [2021-10-28 23:20:34,101 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:20:33" (1/1) ... [2021-10-28 23:20:34,130 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:20:33" (1/1) ... [2021-10-28 23:20:34,138 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:20:33" (1/1) ... [2021-10-28 23:20:34,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 23:20:34,155 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 23:20:34,156 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 23:20:34,156 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 23:20:34,157 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:20:33" (1/1) ... [2021-10-28 23:20:34,164 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 23:20:34,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff8f36a2-359c-4cee-a1bd-36a2449c7615/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:20:34,196 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff8f36a2-359c-4cee-a1bd-36a2449c7615/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 23:20:34,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff8f36a2-359c-4cee-a1bd-36a2449c7615/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 23:20:34,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 23:20:34,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 23:20:34,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 23:20:34,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 23:20:34,643 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,644 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,654 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,658 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,663 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,668 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,674 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,680 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,684 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,687 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,689 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,692 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,696 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,703 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,705 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,708 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,743 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,746 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,748 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,751 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,753 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,756 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,758 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,760 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,761 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,764 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,767 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,770 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,772 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,775 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,778 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,781 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,782 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,784 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,786 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,789 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,790 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,792 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,794 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,796 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,797 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,800 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:34,803 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 23:20:36,983 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1271: assume false; [2021-10-28 23:20:36,983 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1272: assume !false; [2021-10-28 23:20:36,984 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2021-10-28 23:20:36,984 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2021-10-28 23:20:36,984 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1230: assume !false; [2021-10-28 23:20:36,984 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##287: assume false; [2021-10-28 23:20:36,984 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##288: assume !false; [2021-10-28 23:20:36,985 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1229: assume false; [2021-10-28 23:20:36,985 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1210: assume false; [2021-10-28 23:20:36,985 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1211: assume !false; [2021-10-28 23:20:36,985 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##319: assume false; [2021-10-28 23:20:36,985 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##320: assume !false; [2021-10-28 23:20:36,986 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1160: assume !false; [2021-10-28 23:20:36,986 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1159: assume false; [2021-10-28 23:20:36,986 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##371: assume false; [2021-10-28 23:20:36,986 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##372: assume !false; [2021-10-28 23:20:36,986 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1108: assume false; [2021-10-28 23:20:36,986 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1109: assume !false; [2021-10-28 23:20:36,987 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##346: assume false; [2021-10-28 23:20:36,987 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##347: assume !false; [2021-10-28 23:20:36,987 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##416: assume false; [2021-10-28 23:20:36,987 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##417: assume !false; [2021-10-28 23:20:36,987 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1050: assume !false; [2021-10-28 23:20:36,988 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: CdAudioPnp_#res := 0; [2021-10-28 23:20:36,988 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1049: assume false; [2021-10-28 23:20:36,988 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1003: assume false; [2021-10-28 23:20:36,988 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1004: assume !false; [2021-10-28 23:20:36,988 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##461: assume !false; [2021-10-28 23:20:36,989 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##460: assume false; [2021-10-28 23:20:36,989 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##487: assume !false; [2021-10-28 23:20:36,989 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##486: assume false; [2021-10-28 23:20:36,989 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##526: assume !false; [2021-10-28 23:20:36,989 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##525: assume false; [2021-10-28 23:20:36,989 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##71: assume !false; [2021-10-28 23:20:36,990 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##70: assume false; [2021-10-28 23:20:36,990 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume !false; [2021-10-28 23:20:36,990 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume false; [2021-10-28 23:20:36,990 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume !false; [2021-10-28 23:20:36,990 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume false; [2021-10-28 23:20:36,990 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2021-10-28 23:20:36,991 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2021-10-28 23:20:36,991 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##573: assume !false; [2021-10-28 23:20:36,991 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##572: assume false; [2021-10-28 23:20:36,991 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##685: assume !false; [2021-10-28 23:20:36,991 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##684: assume false; [2021-10-28 23:20:36,992 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##609: assume false; [2021-10-28 23:20:36,992 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##610: assume !false; [2021-10-28 23:20:36,992 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##639: assume !false; [2021-10-28 23:20:36,992 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##638: assume false; [2021-10-28 23:20:36,992 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1612: assume false; [2021-10-28 23:20:36,992 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1613: assume !false; [2021-10-28 23:20:36,993 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##757: assume !false; [2021-10-28 23:20:36,993 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##756: assume false; [2021-10-28 23:20:36,993 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##717: assume !false; [2021-10-28 23:20:36,993 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##716: assume false; [2021-10-28 23:20:36,993 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1506: assume false; [2021-10-28 23:20:36,994 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1507: assume !false; [2021-10-28 23:20:36,994 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1564: assume false; [2021-10-28 23:20:36,994 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1565: assume !false; [2021-10-28 23:20:36,994 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##856: assume false; [2021-10-28 23:20:36,994 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##857: assume !false; [2021-10-28 23:20:36,995 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##801: assume false; [2021-10-28 23:20:36,995 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##802: assume !false; [2021-10-28 23:20:36,995 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##832: assume !false; [2021-10-28 23:20:36,995 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##831: assume false; [2021-10-28 23:20:36,995 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1426: assume false; [2021-10-28 23:20:36,995 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1427: assume !false; [2021-10-28 23:20:36,996 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1476: assume false; [2021-10-28 23:20:36,996 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1477: assume !false; [2021-10-28 23:20:36,996 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1398: assume false; [2021-10-28 23:20:36,996 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1399: assume !false; [2021-10-28 23:20:36,996 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##961: assume !false; [2021-10-28 23:20:36,997 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##960: assume false; [2021-10-28 23:20:36,997 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##909: assume false; [2021-10-28 23:20:36,997 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##910: assume !false; [2021-10-28 23:20:36,997 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1301: assume false; [2021-10-28 23:20:36,997 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1302: assume !false; [2021-10-28 23:20:36,998 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##188: assume !false; [2021-10-28 23:20:36,998 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##187: assume false; [2021-10-28 23:20:36,998 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##148: assume false; [2021-10-28 23:20:36,998 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##149: assume !false; [2021-10-28 23:20:36,998 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1354: assume false; [2021-10-28 23:20:36,998 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1355: assume !false; [2021-10-28 23:20:36,999 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1341: assume false; [2021-10-28 23:20:36,999 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1342: assume !false; [2021-10-28 23:20:36,999 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##111: assume false; [2021-10-28 23:20:36,999 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##112: assume !false; [2021-10-28 23:20:37,017 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 23:20:37,017 INFO L299 CfgBuilder]: Removed 555 assume(true) statements. [2021-10-28 23:20:37,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:20:37 BoogieIcfgContainer [2021-10-28 23:20:37,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 23:20:37,023 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 23:20:37,023 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 23:20:37,027 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 23:20:37,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 11:20:33" (1/3) ... [2021-10-28 23:20:37,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51521d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 11:20:37, skipping insertion in model container [2021-10-28 23:20:37,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:20:33" (2/3) ... [2021-10-28 23:20:37,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51521d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 11:20:37, skipping insertion in model container [2021-10-28 23:20:37,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:20:37" (3/3) ... [2021-10-28 23:20:37,031 INFO L111 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-1.c [2021-10-28 23:20:37,037 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 23:20:37,037 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 103 error locations. [2021-10-28 23:20:37,095 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 23:20:37,101 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-28 23:20:37,102 INFO L340 AbstractCegarLoop]: Starting to check reachability of 103 error locations. [2021-10-28 23:20:37,143 INFO L276 IsEmpty]: Start isEmpty. Operand has 1185 states, 1081 states have (on average 1.6327474560592043) internal successors, (1765), 1184 states have internal predecessors, (1765), 0 states have call successors, (0), 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-10-28 23:20:37,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-28 23:20:37,149 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:37,150 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:20:37,150 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:37,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:37,156 INFO L85 PathProgramCache]: Analyzing trace with hash -630605601, now seen corresponding path program 1 times [2021-10-28 23:20:37,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:37,166 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649310994] [2021-10-28 23:20:37,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:37,168 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:37,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:37,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:37,381 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649310994] [2021-10-28 23:20:37,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649310994] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:37,382 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:37,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:20:37,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409171392] [2021-10-28 23:20:37,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:20:37,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:37,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:20:37,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:37,426 INFO L87 Difference]: Start difference. First operand has 1185 states, 1081 states have (on average 1.6327474560592043) internal successors, (1765), 1184 states have internal predecessors, (1765), 0 states have call successors, (0), 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-10-28 23:20:37,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:37,998 INFO L93 Difference]: Finished difference Result 2072 states and 3036 transitions. [2021-10-28 23:20:37,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:20:38,000 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-10-28 23:20:38,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:38,021 INFO L225 Difference]: With dead ends: 2072 [2021-10-28 23:20:38,022 INFO L226 Difference]: Without dead ends: 1180 [2021-10-28 23:20:38,028 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:38,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2021-10-28 23:20:38,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1180. [2021-10-28 23:20:38,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 1077 states have (on average 1.5273909006499535) internal successors, (1645), 1179 states have internal predecessors, (1645), 0 states have call successors, (0), 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-10-28 23:20:38,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1645 transitions. [2021-10-28 23:20:38,126 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1645 transitions. Word has length 11 [2021-10-28 23:20:38,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:38,127 INFO L470 AbstractCegarLoop]: Abstraction has 1180 states and 1645 transitions. [2021-10-28 23:20:38,127 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-10-28 23:20:38,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1645 transitions. [2021-10-28 23:20:38,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-28 23:20:38,128 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:38,129 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:20:38,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 23:20:38,129 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr95ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:38,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:38,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1724813645, now seen corresponding path program 1 times [2021-10-28 23:20:38,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:38,131 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707574677] [2021-10-28 23:20:38,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:38,131 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:38,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:38,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:38,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:38,207 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707574677] [2021-10-28 23:20:38,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707574677] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:38,208 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:38,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:20:38,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649626714] [2021-10-28 23:20:38,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:20:38,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:38,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:20:38,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:38,213 INFO L87 Difference]: Start difference. First operand 1180 states and 1645 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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-10-28 23:20:38,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:38,639 INFO L93 Difference]: Finished difference Result 1458 states and 2013 transitions. [2021-10-28 23:20:38,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:20:38,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-10-28 23:20:38,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:38,648 INFO L225 Difference]: With dead ends: 1458 [2021-10-28 23:20:38,648 INFO L226 Difference]: Without dead ends: 1261 [2021-10-28 23:20:38,649 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:38,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2021-10-28 23:20:38,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1235. [2021-10-28 23:20:38,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 1168 states have (on average 1.4931506849315068) internal successors, (1744), 1234 states have internal predecessors, (1744), 0 states have call successors, (0), 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-10-28 23:20:38,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1744 transitions. [2021-10-28 23:20:38,724 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1744 transitions. Word has length 12 [2021-10-28 23:20:38,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:38,725 INFO L470 AbstractCegarLoop]: Abstraction has 1235 states and 1744 transitions. [2021-10-28 23:20:38,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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-10-28 23:20:38,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1744 transitions. [2021-10-28 23:20:38,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-28 23:20:38,728 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:38,729 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:20:38,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 23:20:38,730 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr72ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:38,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:38,731 INFO L85 PathProgramCache]: Analyzing trace with hash 375851837, now seen corresponding path program 1 times [2021-10-28 23:20:38,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:38,731 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238550470] [2021-10-28 23:20:38,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:38,733 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:38,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:38,857 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:38,857 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238550470] [2021-10-28 23:20:38,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238550470] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:38,859 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:38,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:20:38,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097132927] [2021-10-28 23:20:38,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:20:38,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:38,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:20:38,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:38,866 INFO L87 Difference]: Start difference. First operand 1235 states and 1744 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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-10-28 23:20:38,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:38,938 INFO L93 Difference]: Finished difference Result 1625 states and 2261 transitions. [2021-10-28 23:20:38,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:20:38,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2021-10-28 23:20:38,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:38,947 INFO L225 Difference]: With dead ends: 1625 [2021-10-28 23:20:38,947 INFO L226 Difference]: Without dead ends: 1265 [2021-10-28 23:20:38,948 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:38,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2021-10-28 23:20:38,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1076. [2021-10-28 23:20:38,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1076 states, 1030 states have (on average 1.4776699029126215) internal successors, (1522), 1075 states have internal predecessors, (1522), 0 states have call successors, (0), 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-10-28 23:20:38,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1522 transitions. [2021-10-28 23:20:38,996 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1522 transitions. Word has length 14 [2021-10-28 23:20:38,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:38,996 INFO L470 AbstractCegarLoop]: Abstraction has 1076 states and 1522 transitions. [2021-10-28 23:20:38,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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-10-28 23:20:38,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1522 transitions. [2021-10-28 23:20:39,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-28 23:20:39,003 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:39,003 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:20:39,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-28 23:20:39,004 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:39,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:39,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1788319990, now seen corresponding path program 1 times [2021-10-28 23:20:39,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:39,006 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814878978] [2021-10-28 23:20:39,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:39,006 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:39,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:39,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:39,089 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814878978] [2021-10-28 23:20:39,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814878978] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:39,093 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:39,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:20:39,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957690368] [2021-10-28 23:20:39,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:20:39,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:39,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:20:39,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:39,096 INFO L87 Difference]: Start difference. First operand 1076 states and 1522 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-10-28 23:20:39,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:39,519 INFO L93 Difference]: Finished difference Result 1775 states and 2478 transitions. [2021-10-28 23:20:39,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:20:39,519 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-10-28 23:20:39,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:39,529 INFO L225 Difference]: With dead ends: 1775 [2021-10-28 23:20:39,529 INFO L226 Difference]: Without dead ends: 1539 [2021-10-28 23:20:39,530 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:39,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2021-10-28 23:20:39,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1245. [2021-10-28 23:20:39,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1245 states, 1199 states have (on average 1.4795663052543786) internal successors, (1774), 1244 states have internal predecessors, (1774), 0 states have call successors, (0), 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-10-28 23:20:39,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1774 transitions. [2021-10-28 23:20:39,594 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1774 transitions. Word has length 16 [2021-10-28 23:20:39,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:39,595 INFO L470 AbstractCegarLoop]: Abstraction has 1245 states and 1774 transitions. [2021-10-28 23:20:39,595 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-10-28 23:20:39,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1774 transitions. [2021-10-28 23:20:39,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-28 23:20:39,597 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:39,597 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:20:39,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-28 23:20:39,597 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:39,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:39,598 INFO L85 PathProgramCache]: Analyzing trace with hash 388999750, now seen corresponding path program 1 times [2021-10-28 23:20:39,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:39,599 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403389583] [2021-10-28 23:20:39,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:39,599 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:39,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:39,688 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:39,688 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403389583] [2021-10-28 23:20:39,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403389583] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:39,689 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:39,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 23:20:39,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827681814] [2021-10-28 23:20:39,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:20:39,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:39,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:20:39,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:20:39,691 INFO L87 Difference]: Start difference. First operand 1245 states and 1774 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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-10-28 23:20:40,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:40,146 INFO L93 Difference]: Finished difference Result 1870 states and 2623 transitions. [2021-10-28 23:20:40,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 23:20:40,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-10-28 23:20:40,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:40,154 INFO L225 Difference]: With dead ends: 1870 [2021-10-28 23:20:40,155 INFO L226 Difference]: Without dead ends: 1146 [2021-10-28 23:20:40,156 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:20:40,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2021-10-28 23:20:40,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1028. [2021-10-28 23:20:40,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 1004 states have (on average 1.4262948207171315) internal successors, (1432), 1027 states have internal predecessors, (1432), 0 states have call successors, (0), 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-10-28 23:20:40,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1432 transitions. [2021-10-28 23:20:40,220 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1432 transitions. Word has length 17 [2021-10-28 23:20:40,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:40,220 INFO L470 AbstractCegarLoop]: Abstraction has 1028 states and 1432 transitions. [2021-10-28 23:20:40,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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-10-28 23:20:40,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1432 transitions. [2021-10-28 23:20:40,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-28 23:20:40,223 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:40,223 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:20:40,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-28 23:20:40,224 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr73ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:40,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:40,225 INFO L85 PathProgramCache]: Analyzing trace with hash 79997488, now seen corresponding path program 1 times [2021-10-28 23:20:40,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:40,225 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115831966] [2021-10-28 23:20:40,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:40,226 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:40,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:40,278 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:40,278 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115831966] [2021-10-28 23:20:40,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115831966] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:40,279 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:40,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 23:20:40,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052832602] [2021-10-28 23:20:40,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:20:40,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:40,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:20:40,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:20:40,281 INFO L87 Difference]: Start difference. First operand 1028 states and 1432 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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-10-28 23:20:40,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:40,407 INFO L93 Difference]: Finished difference Result 1343 states and 1857 transitions. [2021-10-28 23:20:40,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 23:20:40,408 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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-10-28 23:20:40,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:40,416 INFO L225 Difference]: With dead ends: 1343 [2021-10-28 23:20:40,417 INFO L226 Difference]: Without dead ends: 1093 [2021-10-28 23:20:40,418 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:20:40,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2021-10-28 23:20:40,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1012. [2021-10-28 23:20:40,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 990 states have (on average 1.4202020202020202) internal successors, (1406), 1011 states have internal predecessors, (1406), 0 states have call successors, (0), 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-10-28 23:20:40,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1406 transitions. [2021-10-28 23:20:40,487 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1406 transitions. Word has length 19 [2021-10-28 23:20:40,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:40,488 INFO L470 AbstractCegarLoop]: Abstraction has 1012 states and 1406 transitions. [2021-10-28 23:20:40,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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-10-28 23:20:40,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1406 transitions. [2021-10-28 23:20:40,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-28 23:20:40,491 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:40,491 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:20:40,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-28 23:20:40,492 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:40,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:40,492 INFO L85 PathProgramCache]: Analyzing trace with hash 2053267823, now seen corresponding path program 1 times [2021-10-28 23:20:40,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:40,493 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64022512] [2021-10-28 23:20:40,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:40,493 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:40,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:40,560 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:40,560 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64022512] [2021-10-28 23:20:40,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64022512] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:40,561 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:40,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:20:40,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728602539] [2021-10-28 23:20:40,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:20:40,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:40,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:20:40,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:40,563 INFO L87 Difference]: Start difference. First operand 1012 states and 1406 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:40,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:40,886 INFO L93 Difference]: Finished difference Result 1012 states and 1406 transitions. [2021-10-28 23:20:40,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:20:40,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-10-28 23:20:40,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:40,894 INFO L225 Difference]: With dead ends: 1012 [2021-10-28 23:20:40,895 INFO L226 Difference]: Without dead ends: 994 [2021-10-28 23:20:40,896 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:40,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2021-10-28 23:20:40,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 994. [2021-10-28 23:20:40,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 981 states have (on average 1.4148827726809379) internal successors, (1388), 993 states have internal predecessors, (1388), 0 states have call successors, (0), 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-10-28 23:20:40,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1388 transitions. [2021-10-28 23:20:40,965 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1388 transitions. Word has length 20 [2021-10-28 23:20:40,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:40,966 INFO L470 AbstractCegarLoop]: Abstraction has 994 states and 1388 transitions. [2021-10-28 23:20:40,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:40,966 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1388 transitions. [2021-10-28 23:20:40,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-28 23:20:40,968 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:40,968 INFO L513 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-10-28 23:20:40,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-28 23:20:40,969 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:40,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:40,970 INFO L85 PathProgramCache]: Analyzing trace with hash -99023241, now seen corresponding path program 1 times [2021-10-28 23:20:40,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:40,970 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537173941] [2021-10-28 23:20:40,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:40,970 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:41,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:41,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:41,012 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537173941] [2021-10-28 23:20:41,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537173941] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:41,013 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:41,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:20:41,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472313031] [2021-10-28 23:20:41,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:20:41,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:41,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:20:41,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:41,015 INFO L87 Difference]: Start difference. First operand 994 states and 1388 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-10-28 23:20:41,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:41,104 INFO L93 Difference]: Finished difference Result 1071 states and 1485 transitions. [2021-10-28 23:20:41,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:20:41,105 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-10-28 23:20:41,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:41,112 INFO L225 Difference]: With dead ends: 1071 [2021-10-28 23:20:41,112 INFO L226 Difference]: Without dead ends: 1048 [2021-10-28 23:20:41,113 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:41,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2021-10-28 23:20:41,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 999. [2021-10-28 23:20:41,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 987 states have (on average 1.4285714285714286) internal successors, (1410), 998 states have internal predecessors, (1410), 0 states have call successors, (0), 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-10-28 23:20:41,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1410 transitions. [2021-10-28 23:20:41,176 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1410 transitions. Word has length 22 [2021-10-28 23:20:41,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:41,176 INFO L470 AbstractCegarLoop]: Abstraction has 999 states and 1410 transitions. [2021-10-28 23:20:41,176 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-10-28 23:20:41,177 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1410 transitions. [2021-10-28 23:20:41,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-28 23:20:41,179 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:41,179 INFO L513 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-10-28 23:20:41,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-28 23:20:41,179 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:41,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:41,180 INFO L85 PathProgramCache]: Analyzing trace with hash 85424501, now seen corresponding path program 1 times [2021-10-28 23:20:41,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:41,180 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268082261] [2021-10-28 23:20:41,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:41,180 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:41,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:41,212 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:41,212 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268082261] [2021-10-28 23:20:41,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268082261] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:41,213 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:41,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:20:41,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468065090] [2021-10-28 23:20:41,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:20:41,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:41,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:20:41,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:41,214 INFO L87 Difference]: Start difference. First operand 999 states and 1410 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-10-28 23:20:41,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:41,291 INFO L93 Difference]: Finished difference Result 1274 states and 1786 transitions. [2021-10-28 23:20:41,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:20:41,292 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-10-28 23:20:41,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:41,298 INFO L225 Difference]: With dead ends: 1274 [2021-10-28 23:20:41,299 INFO L226 Difference]: Without dead ends: 1045 [2021-10-28 23:20:41,300 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:41,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2021-10-28 23:20:41,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 999. [2021-10-28 23:20:41,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 987 states have (on average 1.426545086119554) internal successors, (1408), 998 states have internal predecessors, (1408), 0 states have call successors, (0), 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-10-28 23:20:41,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1408 transitions. [2021-10-28 23:20:41,361 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1408 transitions. Word has length 25 [2021-10-28 23:20:41,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:41,361 INFO L470 AbstractCegarLoop]: Abstraction has 999 states and 1408 transitions. [2021-10-28 23:20:41,362 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-10-28 23:20:41,362 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1408 transitions. [2021-10-28 23:20:41,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-28 23:20:41,364 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:41,364 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:20:41,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-28 23:20:41,365 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:41,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:41,365 INFO L85 PathProgramCache]: Analyzing trace with hash -105580495, now seen corresponding path program 1 times [2021-10-28 23:20:41,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:41,366 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373496474] [2021-10-28 23:20:41,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:41,366 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:41,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:41,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:41,406 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373496474] [2021-10-28 23:20:41,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373496474] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:41,406 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:41,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:20:41,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501490616] [2021-10-28 23:20:41,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:20:41,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:41,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:20:41,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:41,408 INFO L87 Difference]: Start difference. First operand 999 states and 1408 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:41,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:41,650 INFO L93 Difference]: Finished difference Result 1196 states and 1676 transitions. [2021-10-28 23:20:41,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:20:41,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-10-28 23:20:41,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:41,656 INFO L225 Difference]: With dead ends: 1196 [2021-10-28 23:20:41,656 INFO L226 Difference]: Without dead ends: 989 [2021-10-28 23:20:41,657 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:41,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2021-10-28 23:20:41,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 989. [2021-10-28 23:20:41,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 980 states have (on average 1.4214285714285715) internal successors, (1393), 988 states have internal predecessors, (1393), 0 states have call successors, (0), 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-10-28 23:20:41,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1393 transitions. [2021-10-28 23:20:41,714 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1393 transitions. Word has length 27 [2021-10-28 23:20:41,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:41,714 INFO L470 AbstractCegarLoop]: Abstraction has 989 states and 1393 transitions. [2021-10-28 23:20:41,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:41,715 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1393 transitions. [2021-10-28 23:20:41,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-28 23:20:41,717 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:41,718 INFO L513 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-10-28 23:20:41,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-28 23:20:41,718 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:41,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:41,719 INFO L85 PathProgramCache]: Analyzing trace with hash 333752835, now seen corresponding path program 1 times [2021-10-28 23:20:41,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:41,719 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520005528] [2021-10-28 23:20:41,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:41,720 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:41,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:41,777 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:41,777 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520005528] [2021-10-28 23:20:41,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520005528] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:41,777 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:41,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 23:20:41,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536647890] [2021-10-28 23:20:41,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:20:41,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:41,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:20:41,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:20:41,780 INFO L87 Difference]: Start difference. First operand 989 states and 1393 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:42,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:42,100 INFO L93 Difference]: Finished difference Result 1061 states and 1469 transitions. [2021-10-28 23:20:42,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 23:20:42,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-28 23:20:42,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:42,107 INFO L225 Difference]: With dead ends: 1061 [2021-10-28 23:20:42,107 INFO L226 Difference]: Without dead ends: 1009 [2021-10-28 23:20:42,108 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:20:42,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2021-10-28 23:20:42,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 989. [2021-10-28 23:20:42,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 980 states have (on average 1.4122448979591837) internal successors, (1384), 988 states have internal predecessors, (1384), 0 states have call successors, (0), 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-10-28 23:20:42,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1384 transitions. [2021-10-28 23:20:42,169 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1384 transitions. Word has length 29 [2021-10-28 23:20:42,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:42,169 INFO L470 AbstractCegarLoop]: Abstraction has 989 states and 1384 transitions. [2021-10-28 23:20:42,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:42,170 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1384 transitions. [2021-10-28 23:20:42,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-28 23:20:42,172 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:42,172 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:20:42,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-28 23:20:42,173 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:42,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:42,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1053614682, now seen corresponding path program 1 times [2021-10-28 23:20:42,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:42,174 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130565715] [2021-10-28 23:20:42,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:42,174 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:42,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:42,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:42,207 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130565715] [2021-10-28 23:20:42,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130565715] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:42,208 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:42,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:20:42,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876201550] [2021-10-28 23:20:42,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:20:42,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:42,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:20:42,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:42,210 INFO L87 Difference]: Start difference. First operand 989 states and 1384 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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-10-28 23:20:42,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:42,455 INFO L93 Difference]: Finished difference Result 1014 states and 1412 transitions. [2021-10-28 23:20:42,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:20:42,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2021-10-28 23:20:42,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:42,462 INFO L225 Difference]: With dead ends: 1014 [2021-10-28 23:20:42,462 INFO L226 Difference]: Without dead ends: 1009 [2021-10-28 23:20:42,463 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:42,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2021-10-28 23:20:42,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1006. [2021-10-28 23:20:42,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 997 states have (on average 1.4092276830491475) internal successors, (1405), 1005 states have internal predecessors, (1405), 0 states have call successors, (0), 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-10-28 23:20:42,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1405 transitions. [2021-10-28 23:20:42,526 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1405 transitions. Word has length 30 [2021-10-28 23:20:42,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:42,527 INFO L470 AbstractCegarLoop]: Abstraction has 1006 states and 1405 transitions. [2021-10-28 23:20:42,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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-10-28 23:20:42,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1405 transitions. [2021-10-28 23:20:42,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-28 23:20:42,530 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:42,530 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:20:42,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-28 23:20:42,531 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:42,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:42,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1714895974, now seen corresponding path program 1 times [2021-10-28 23:20:42,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:42,532 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43517590] [2021-10-28 23:20:42,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:42,532 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:42,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:42,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:42,591 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43517590] [2021-10-28 23:20:42,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43517590] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:42,592 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:42,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 23:20:42,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450141954] [2021-10-28 23:20:42,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:20:42,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:42,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:20:42,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:20:42,594 INFO L87 Difference]: Start difference. First operand 1006 states and 1405 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:42,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:42,889 INFO L93 Difference]: Finished difference Result 1014 states and 1411 transitions. [2021-10-28 23:20:42,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 23:20:42,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-10-28 23:20:42,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:42,895 INFO L225 Difference]: With dead ends: 1014 [2021-10-28 23:20:42,896 INFO L226 Difference]: Without dead ends: 1009 [2021-10-28 23:20:42,897 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:20:42,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2021-10-28 23:20:42,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1006. [2021-10-28 23:20:42,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 997 states have (on average 1.4082246740220663) internal successors, (1404), 1005 states have internal predecessors, (1404), 0 states have call successors, (0), 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-10-28 23:20:42,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1404 transitions. [2021-10-28 23:20:42,964 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1404 transitions. Word has length 31 [2021-10-28 23:20:42,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:42,964 INFO L470 AbstractCegarLoop]: Abstraction has 1006 states and 1404 transitions. [2021-10-28 23:20:42,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:42,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1404 transitions. [2021-10-28 23:20:42,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-28 23:20:42,967 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:42,967 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:20:42,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-28 23:20:42,968 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:42,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:42,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1557214583, now seen corresponding path program 1 times [2021-10-28 23:20:42,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:42,969 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587274748] [2021-10-28 23:20:42,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:42,969 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:42,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:43,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:43,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:43,003 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587274748] [2021-10-28 23:20:43,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587274748] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:43,004 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:43,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:20:43,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216287439] [2021-10-28 23:20:43,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:20:43,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:43,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:20:43,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:43,006 INFO L87 Difference]: Start difference. First operand 1006 states and 1404 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:43,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:43,098 INFO L93 Difference]: Finished difference Result 1237 states and 1712 transitions. [2021-10-28 23:20:43,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:20:43,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-10-28 23:20:43,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:43,105 INFO L225 Difference]: With dead ends: 1237 [2021-10-28 23:20:43,105 INFO L226 Difference]: Without dead ends: 1099 [2021-10-28 23:20:43,106 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:43,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2021-10-28 23:20:43,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 994. [2021-10-28 23:20:43,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 988 states have (on average 1.402834008097166) internal successors, (1386), 993 states have internal predecessors, (1386), 0 states have call successors, (0), 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-10-28 23:20:43,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1386 transitions. [2021-10-28 23:20:43,171 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1386 transitions. Word has length 31 [2021-10-28 23:20:43,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:43,172 INFO L470 AbstractCegarLoop]: Abstraction has 994 states and 1386 transitions. [2021-10-28 23:20:43,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:43,172 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1386 transitions. [2021-10-28 23:20:43,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-28 23:20:43,175 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:43,175 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:20:43,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-28 23:20:43,175 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:43,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:43,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1095917288, now seen corresponding path program 1 times [2021-10-28 23:20:43,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:43,176 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813763147] [2021-10-28 23:20:43,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:43,177 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:43,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:43,206 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:43,207 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813763147] [2021-10-28 23:20:43,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813763147] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:43,207 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:43,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:20:43,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687118785] [2021-10-28 23:20:43,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:20:43,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:43,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:20:43,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:43,209 INFO L87 Difference]: Start difference. First operand 994 states and 1386 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:43,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:43,434 INFO L93 Difference]: Finished difference Result 1060 states and 1453 transitions. [2021-10-28 23:20:43,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:20:43,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-10-28 23:20:43,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:43,440 INFO L225 Difference]: With dead ends: 1060 [2021-10-28 23:20:43,441 INFO L226 Difference]: Without dead ends: 1046 [2021-10-28 23:20:43,443 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:43,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2021-10-28 23:20:43,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1034. [2021-10-28 23:20:43,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1028 states have (on average 1.3881322957198443) internal successors, (1427), 1033 states have internal predecessors, (1427), 0 states have call successors, (0), 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-10-28 23:20:43,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1427 transitions. [2021-10-28 23:20:43,516 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1427 transitions. Word has length 31 [2021-10-28 23:20:43,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:43,517 INFO L470 AbstractCegarLoop]: Abstraction has 1034 states and 1427 transitions. [2021-10-28 23:20:43,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:43,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1427 transitions. [2021-10-28 23:20:43,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-28 23:20:43,520 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:43,521 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:20:43,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-28 23:20:43,521 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:43,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:43,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1102324248, now seen corresponding path program 1 times [2021-10-28 23:20:43,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:43,522 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592006524] [2021-10-28 23:20:43,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:43,523 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:43,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:43,576 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:43,579 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592006524] [2021-10-28 23:20:43,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592006524] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:43,582 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:43,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 23:20:43,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240956409] [2021-10-28 23:20:43,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:20:43,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:43,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:20:43,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:20:43,584 INFO L87 Difference]: Start difference. First operand 1034 states and 1427 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:43,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:43,675 INFO L93 Difference]: Finished difference Result 1101 states and 1500 transitions. [2021-10-28 23:20:43,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 23:20:43,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-10-28 23:20:43,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:43,681 INFO L225 Difference]: With dead ends: 1101 [2021-10-28 23:20:43,682 INFO L226 Difference]: Without dead ends: 1078 [2021-10-28 23:20:43,682 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:20:43,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2021-10-28 23:20:43,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 1037. [2021-10-28 23:20:43,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 1031 states have (on average 1.3879728419010668) internal successors, (1431), 1036 states have internal predecessors, (1431), 0 states have call successors, (0), 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-10-28 23:20:43,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1431 transitions. [2021-10-28 23:20:43,771 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1431 transitions. Word has length 31 [2021-10-28 23:20:43,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:43,771 INFO L470 AbstractCegarLoop]: Abstraction has 1037 states and 1431 transitions. [2021-10-28 23:20:43,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:43,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1431 transitions. [2021-10-28 23:20:43,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-28 23:20:43,774 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:43,774 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:20:43,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-28 23:20:43,775 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:43,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:43,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1689130262, now seen corresponding path program 1 times [2021-10-28 23:20:43,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:43,776 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356912920] [2021-10-28 23:20:43,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:43,776 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:43,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:43,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:43,826 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356912920] [2021-10-28 23:20:43,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356912920] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:43,826 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:43,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 23:20:43,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710009310] [2021-10-28 23:20:43,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:20:43,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:43,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:20:43,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:20:43,829 INFO L87 Difference]: Start difference. First operand 1037 states and 1431 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:44,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:44,087 INFO L93 Difference]: Finished difference Result 1060 states and 1456 transitions. [2021-10-28 23:20:44,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 23:20:44,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-10-28 23:20:44,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:44,093 INFO L225 Difference]: With dead ends: 1060 [2021-10-28 23:20:44,093 INFO L226 Difference]: Without dead ends: 996 [2021-10-28 23:20:44,094 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:20:44,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2021-10-28 23:20:44,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 994. [2021-10-28 23:20:44,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 988 states have (on average 1.3856275303643724) internal successors, (1369), 993 states have internal predecessors, (1369), 0 states have call successors, (0), 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-10-28 23:20:44,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1369 transitions. [2021-10-28 23:20:44,165 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1369 transitions. Word has length 31 [2021-10-28 23:20:44,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:44,166 INFO L470 AbstractCegarLoop]: Abstraction has 994 states and 1369 transitions. [2021-10-28 23:20:44,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:44,166 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1369 transitions. [2021-10-28 23:20:44,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-28 23:20:44,168 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:44,169 INFO L513 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-10-28 23:20:44,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-28 23:20:44,169 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:44,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:44,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1100290421, now seen corresponding path program 1 times [2021-10-28 23:20:44,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:44,170 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919576753] [2021-10-28 23:20:44,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:44,170 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:44,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:44,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:44,249 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919576753] [2021-10-28 23:20:44,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919576753] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:44,250 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:44,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 23:20:44,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524711970] [2021-10-28 23:20:44,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:20:44,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:44,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:20:44,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:20:44,255 INFO L87 Difference]: Start difference. First operand 994 states and 1369 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 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-10-28 23:20:44,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:44,521 INFO L93 Difference]: Finished difference Result 1002 states and 1375 transitions. [2021-10-28 23:20:44,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 23:20:44,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 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-10-28 23:20:44,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:44,528 INFO L225 Difference]: With dead ends: 1002 [2021-10-28 23:20:44,528 INFO L226 Difference]: Without dead ends: 997 [2021-10-28 23:20:44,529 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:20:44,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2021-10-28 23:20:44,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 994. [2021-10-28 23:20:44,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 988 states have (on average 1.3846153846153846) internal successors, (1368), 993 states have internal predecessors, (1368), 0 states have call successors, (0), 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-10-28 23:20:44,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1368 transitions. [2021-10-28 23:20:44,600 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1368 transitions. Word has length 32 [2021-10-28 23:20:44,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:44,600 INFO L470 AbstractCegarLoop]: Abstraction has 994 states and 1368 transitions. [2021-10-28 23:20:44,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 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-10-28 23:20:44,600 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1368 transitions. [2021-10-28 23:20:44,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-28 23:20:44,603 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:44,603 INFO L513 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-10-28 23:20:44,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-28 23:20:44,603 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:44,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:44,604 INFO L85 PathProgramCache]: Analyzing trace with hash 635619136, now seen corresponding path program 1 times [2021-10-28 23:20:44,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:44,604 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638179818] [2021-10-28 23:20:44,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:44,604 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:44,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:44,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:44,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:44,640 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638179818] [2021-10-28 23:20:44,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638179818] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:44,640 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:44,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:20:44,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554072517] [2021-10-28 23:20:44,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:20:44,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:44,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:20:44,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:44,643 INFO L87 Difference]: Start difference. First operand 994 states and 1368 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:44,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:44,722 INFO L93 Difference]: Finished difference Result 1095 states and 1504 transitions. [2021-10-28 23:20:44,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:20:44,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-10-28 23:20:44,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:44,728 INFO L225 Difference]: With dead ends: 1095 [2021-10-28 23:20:44,729 INFO L226 Difference]: Without dead ends: 978 [2021-10-28 23:20:44,729 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:44,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2021-10-28 23:20:44,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 978. [2021-10-28 23:20:44,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 972 states have (on average 1.3775720164609053) internal successors, (1339), 977 states have internal predecessors, (1339), 0 states have call successors, (0), 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-10-28 23:20:44,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1339 transitions. [2021-10-28 23:20:44,803 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1339 transitions. Word has length 32 [2021-10-28 23:20:44,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:44,803 INFO L470 AbstractCegarLoop]: Abstraction has 978 states and 1339 transitions. [2021-10-28 23:20:44,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:44,804 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1339 transitions. [2021-10-28 23:20:44,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-28 23:20:44,806 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:44,806 INFO L513 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-10-28 23:20:44,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-28 23:20:44,807 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:44,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:44,807 INFO L85 PathProgramCache]: Analyzing trace with hash -369077776, now seen corresponding path program 1 times [2021-10-28 23:20:44,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:44,808 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936176211] [2021-10-28 23:20:44,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:44,808 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:44,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:44,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:44,855 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936176211] [2021-10-28 23:20:44,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936176211] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:44,855 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:44,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 23:20:44,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899918687] [2021-10-28 23:20:44,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 23:20:44,856 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:44,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 23:20:44,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 23:20:44,857 INFO L87 Difference]: Start difference. First operand 978 states and 1339 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:45,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:45,042 INFO L93 Difference]: Finished difference Result 992 states and 1353 transitions. [2021-10-28 23:20:45,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 23:20:45,043 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-10-28 23:20:45,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:45,048 INFO L225 Difference]: With dead ends: 992 [2021-10-28 23:20:45,049 INFO L226 Difference]: Without dead ends: 989 [2021-10-28 23:20:45,049 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-28 23:20:45,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2021-10-28 23:20:45,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 984. [2021-10-28 23:20:45,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 978 states have (on average 1.3762781186094069) internal successors, (1346), 983 states have internal predecessors, (1346), 0 states have call successors, (0), 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-10-28 23:20:45,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1346 transitions. [2021-10-28 23:20:45,146 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1346 transitions. Word has length 32 [2021-10-28 23:20:45,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:45,147 INFO L470 AbstractCegarLoop]: Abstraction has 984 states and 1346 transitions. [2021-10-28 23:20:45,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:45,147 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1346 transitions. [2021-10-28 23:20:45,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-28 23:20:45,150 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:45,150 INFO L513 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-10-28 23:20:45,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-28 23:20:45,151 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:45,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:45,151 INFO L85 PathProgramCache]: Analyzing trace with hash -369089692, now seen corresponding path program 1 times [2021-10-28 23:20:45,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:45,152 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558829097] [2021-10-28 23:20:45,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:45,152 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:45,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:45,199 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:45,199 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558829097] [2021-10-28 23:20:45,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558829097] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:45,199 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:45,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 23:20:45,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342037282] [2021-10-28 23:20:45,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 23:20:45,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:45,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 23:20:45,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 23:20:45,202 INFO L87 Difference]: Start difference. First operand 984 states and 1346 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:45,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:45,334 INFO L93 Difference]: Finished difference Result 1001 states and 1363 transitions. [2021-10-28 23:20:45,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 23:20:45,335 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-10-28 23:20:45,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:45,341 INFO L225 Difference]: With dead ends: 1001 [2021-10-28 23:20:45,341 INFO L226 Difference]: Without dead ends: 983 [2021-10-28 23:20:45,342 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-28 23:20:45,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2021-10-28 23:20:45,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 983. [2021-10-28 23:20:45,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 977 states have (on average 1.375639713408393) internal successors, (1344), 982 states have internal predecessors, (1344), 0 states have call successors, (0), 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-10-28 23:20:45,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1344 transitions. [2021-10-28 23:20:45,416 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1344 transitions. Word has length 32 [2021-10-28 23:20:45,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:45,417 INFO L470 AbstractCegarLoop]: Abstraction has 983 states and 1344 transitions. [2021-10-28 23:20:45,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:45,417 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1344 transitions. [2021-10-28 23:20:45,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-28 23:20:45,419 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:45,420 INFO L513 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-10-28 23:20:45,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-28 23:20:45,420 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:45,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:45,421 INFO L85 PathProgramCache]: Analyzing trace with hash -603608195, now seen corresponding path program 1 times [2021-10-28 23:20:45,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:45,421 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50004144] [2021-10-28 23:20:45,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:45,421 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:45,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:45,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:45,477 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50004144] [2021-10-28 23:20:45,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50004144] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:45,477 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:45,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 23:20:45,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101081672] [2021-10-28 23:20:45,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 23:20:45,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:45,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 23:20:45,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-28 23:20:45,479 INFO L87 Difference]: Start difference. First operand 983 states and 1344 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 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-10-28 23:20:45,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:45,725 INFO L93 Difference]: Finished difference Result 1004 states and 1366 transitions. [2021-10-28 23:20:45,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 23:20:45,725 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 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-10-28 23:20:45,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:45,731 INFO L225 Difference]: With dead ends: 1004 [2021-10-28 23:20:45,731 INFO L226 Difference]: Without dead ends: 974 [2021-10-28 23:20:45,733 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-28 23:20:45,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2021-10-28 23:20:45,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2021-10-28 23:20:45,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 968 states have (on average 1.365702479338843) internal successors, (1322), 973 states have internal predecessors, (1322), 0 states have call successors, (0), 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-10-28 23:20:45,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1322 transitions. [2021-10-28 23:20:45,836 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1322 transitions. Word has length 33 [2021-10-28 23:20:45,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:45,837 INFO L470 AbstractCegarLoop]: Abstraction has 974 states and 1322 transitions. [2021-10-28 23:20:45,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 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-10-28 23:20:45,838 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1322 transitions. [2021-10-28 23:20:45,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-28 23:20:45,841 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:45,841 INFO L513 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-10-28 23:20:45,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-28 23:20:45,841 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:45,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:45,842 INFO L85 PathProgramCache]: Analyzing trace with hash -691762275, now seen corresponding path program 1 times [2021-10-28 23:20:45,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:45,842 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677075499] [2021-10-28 23:20:45,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:45,843 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:45,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:45,956 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:45,956 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677075499] [2021-10-28 23:20:45,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677075499] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:45,957 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:45,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 23:20:45,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077573422] [2021-10-28 23:20:45,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 23:20:45,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:45,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 23:20:45,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-28 23:20:45,959 INFO L87 Difference]: Start difference. First operand 974 states and 1322 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 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-10-28 23:20:46,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:46,423 INFO L93 Difference]: Finished difference Result 1009 states and 1356 transitions. [2021-10-28 23:20:46,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 23:20:46,424 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 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-10-28 23:20:46,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:46,430 INFO L225 Difference]: With dead ends: 1009 [2021-10-28 23:20:46,430 INFO L226 Difference]: Without dead ends: 1006 [2021-10-28 23:20:46,431 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-28 23:20:46,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2021-10-28 23:20:46,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 974. [2021-10-28 23:20:46,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 968 states have (on average 1.365702479338843) internal successors, (1322), 973 states have internal predecessors, (1322), 0 states have call successors, (0), 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-10-28 23:20:46,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1322 transitions. [2021-10-28 23:20:46,509 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1322 transitions. Word has length 33 [2021-10-28 23:20:46,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:46,509 INFO L470 AbstractCegarLoop]: Abstraction has 974 states and 1322 transitions. [2021-10-28 23:20:46,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 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-10-28 23:20:46,510 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1322 transitions. [2021-10-28 23:20:46,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-28 23:20:46,512 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:46,512 INFO L513 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-10-28 23:20:46,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-28 23:20:46,513 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:46,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:46,513 INFO L85 PathProgramCache]: Analyzing trace with hash -691774191, now seen corresponding path program 1 times [2021-10-28 23:20:46,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:46,514 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187936148] [2021-10-28 23:20:46,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:46,514 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:46,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:46,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:46,571 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187936148] [2021-10-28 23:20:46,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187936148] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:46,571 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:46,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 23:20:46,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100675223] [2021-10-28 23:20:46,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:20:46,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:46,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:20:46,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:20:46,573 INFO L87 Difference]: Start difference. First operand 974 states and 1322 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-10-28 23:20:46,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:46,868 INFO L93 Difference]: Finished difference Result 985 states and 1333 transitions. [2021-10-28 23:20:46,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 23:20:46,869 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-10-28 23:20:46,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:46,874 INFO L225 Difference]: With dead ends: 985 [2021-10-28 23:20:46,874 INFO L226 Difference]: Without dead ends: 926 [2021-10-28 23:20:46,875 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:20:46,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2021-10-28 23:20:46,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 923. [2021-10-28 23:20:46,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 917 states have (on average 1.3751363140676118) internal successors, (1261), 922 states have internal predecessors, (1261), 0 states have call successors, (0), 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-10-28 23:20:46,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1261 transitions. [2021-10-28 23:20:46,963 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1261 transitions. Word has length 33 [2021-10-28 23:20:46,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:46,963 INFO L470 AbstractCegarLoop]: Abstraction has 923 states and 1261 transitions. [2021-10-28 23:20:46,963 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-10-28 23:20:46,963 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1261 transitions. [2021-10-28 23:20:46,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-28 23:20:46,966 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:46,966 INFO L513 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-10-28 23:20:46,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-28 23:20:46,966 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:46,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:46,967 INFO L85 PathProgramCache]: Analyzing trace with hash -2061346662, now seen corresponding path program 1 times [2021-10-28 23:20:46,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:46,967 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925018958] [2021-10-28 23:20:46,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:46,967 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:47,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:47,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:47,058 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925018958] [2021-10-28 23:20:47,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925018958] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:47,058 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:47,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-28 23:20:47,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459612084] [2021-10-28 23:20:47,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 23:20:47,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:47,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 23:20:47,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-28 23:20:47,060 INFO L87 Difference]: Start difference. First operand 923 states and 1261 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 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-10-28 23:20:47,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:47,322 INFO L93 Difference]: Finished difference Result 945 states and 1284 transitions. [2021-10-28 23:20:47,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 23:20:47,323 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 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-10-28 23:20:47,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:47,328 INFO L225 Difference]: With dead ends: 945 [2021-10-28 23:20:47,328 INFO L226 Difference]: Without dead ends: 917 [2021-10-28 23:20:47,329 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2021-10-28 23:20:47,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2021-10-28 23:20:47,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 917. [2021-10-28 23:20:47,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 911 states have (on average 1.3644346871569704) internal successors, (1243), 916 states have internal predecessors, (1243), 0 states have call successors, (0), 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-10-28 23:20:47,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1243 transitions. [2021-10-28 23:20:47,399 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1243 transitions. Word has length 34 [2021-10-28 23:20:47,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:47,399 INFO L470 AbstractCegarLoop]: Abstraction has 917 states and 1243 transitions. [2021-10-28 23:20:47,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 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-10-28 23:20:47,400 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1243 transitions. [2021-10-28 23:20:47,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-28 23:20:47,402 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:47,402 INFO L513 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-10-28 23:20:47,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-28 23:20:47,403 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:47,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:47,403 INFO L85 PathProgramCache]: Analyzing trace with hash -842658898, now seen corresponding path program 1 times [2021-10-28 23:20:47,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:47,404 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487854669] [2021-10-28 23:20:47,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:47,404 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:47,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:47,428 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:47,428 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487854669] [2021-10-28 23:20:47,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487854669] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:47,428 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:47,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:20:47,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451854263] [2021-10-28 23:20:47,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:20:47,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:47,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:20:47,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:47,430 INFO L87 Difference]: Start difference. First operand 917 states and 1243 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-10-28 23:20:47,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:47,566 INFO L93 Difference]: Finished difference Result 1290 states and 1738 transitions. [2021-10-28 23:20:47,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:20:47,567 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-10-28 23:20:47,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:47,571 INFO L225 Difference]: With dead ends: 1290 [2021-10-28 23:20:47,571 INFO L226 Difference]: Without dead ends: 1114 [2021-10-28 23:20:47,572 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:47,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2021-10-28 23:20:47,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 917. [2021-10-28 23:20:47,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 911 states have (on average 1.353457738748628) internal successors, (1233), 916 states have internal predecessors, (1233), 0 states have call successors, (0), 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-10-28 23:20:47,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1233 transitions. [2021-10-28 23:20:47,664 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1233 transitions. Word has length 34 [2021-10-28 23:20:47,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:47,664 INFO L470 AbstractCegarLoop]: Abstraction has 917 states and 1233 transitions. [2021-10-28 23:20:47,665 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-10-28 23:20:47,665 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1233 transitions. [2021-10-28 23:20:47,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-28 23:20:47,667 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:47,667 INFO L513 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-10-28 23:20:47,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-28 23:20:47,668 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:47,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:47,668 INFO L85 PathProgramCache]: Analyzing trace with hash -419957072, now seen corresponding path program 1 times [2021-10-28 23:20:47,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:47,668 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053724832] [2021-10-28 23:20:47,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:47,669 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:47,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:47,720 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:47,720 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053724832] [2021-10-28 23:20:47,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053724832] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:47,721 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:47,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 23:20:47,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673339176] [2021-10-28 23:20:47,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 23:20:47,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:47,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 23:20:47,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-28 23:20:47,722 INFO L87 Difference]: Start difference. First operand 917 states and 1233 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 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-10-28 23:20:47,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:47,848 INFO L93 Difference]: Finished difference Result 933 states and 1249 transitions. [2021-10-28 23:20:47,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 23:20:47,849 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 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-10-28 23:20:47,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:47,851 INFO L225 Difference]: With dead ends: 933 [2021-10-28 23:20:47,852 INFO L226 Difference]: Without dead ends: 915 [2021-10-28 23:20:47,852 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-28 23:20:47,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2021-10-28 23:20:47,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 915. [2021-10-28 23:20:47,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 909 states have (on average 1.353135313531353) internal successors, (1230), 914 states have internal predecessors, (1230), 0 states have call successors, (0), 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-10-28 23:20:47,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1230 transitions. [2021-10-28 23:20:47,930 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1230 transitions. Word has length 34 [2021-10-28 23:20:47,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:47,930 INFO L470 AbstractCegarLoop]: Abstraction has 915 states and 1230 transitions. [2021-10-28 23:20:47,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 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-10-28 23:20:47,930 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1230 transitions. [2021-10-28 23:20:47,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-28 23:20:47,933 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:47,933 INFO L513 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-10-28 23:20:47,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-28 23:20:47,933 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:47,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:47,934 INFO L85 PathProgramCache]: Analyzing trace with hash 732400922, now seen corresponding path program 1 times [2021-10-28 23:20:47,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:47,934 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65601234] [2021-10-28 23:20:47,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:47,935 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:47,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:47,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:47,957 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:47,957 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65601234] [2021-10-28 23:20:47,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65601234] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:47,957 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:47,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:20:47,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127848786] [2021-10-28 23:20:47,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:20:47,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:47,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:20:47,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:47,959 INFO L87 Difference]: Start difference. First operand 915 states and 1230 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-10-28 23:20:48,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:48,045 INFO L93 Difference]: Finished difference Result 967 states and 1286 transitions. [2021-10-28 23:20:48,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:20:48,046 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-10-28 23:20:48,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:48,049 INFO L225 Difference]: With dead ends: 967 [2021-10-28 23:20:48,049 INFO L226 Difference]: Without dead ends: 933 [2021-10-28 23:20:48,049 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:48,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2021-10-28 23:20:48,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 915. [2021-10-28 23:20:48,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 909 states have (on average 1.352035203520352) internal successors, (1229), 914 states have internal predecessors, (1229), 0 states have call successors, (0), 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-10-28 23:20:48,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1229 transitions. [2021-10-28 23:20:48,134 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1229 transitions. Word has length 34 [2021-10-28 23:20:48,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:48,134 INFO L470 AbstractCegarLoop]: Abstraction has 915 states and 1229 transitions. [2021-10-28 23:20:48,134 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-10-28 23:20:48,135 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1229 transitions. [2021-10-28 23:20:48,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-28 23:20:48,137 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:48,137 INFO L513 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-10-28 23:20:48,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-28 23:20:48,137 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:48,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:48,138 INFO L85 PathProgramCache]: Analyzing trace with hash 908827288, now seen corresponding path program 1 times [2021-10-28 23:20:48,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:48,138 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550208715] [2021-10-28 23:20:48,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:48,139 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:48,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-10-28 23:20:48,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:48,166 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550208715] [2021-10-28 23:20:48,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550208715] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:48,167 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:48,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 23:20:48,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033980509] [2021-10-28 23:20:48,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:20:48,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:48,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:20:48,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:20:48,168 INFO L87 Difference]: Start difference. First operand 915 states and 1229 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-10-28 23:20:48,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:48,347 INFO L93 Difference]: Finished difference Result 1074 states and 1434 transitions. [2021-10-28 23:20:48,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 23:20:48,347 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-10-28 23:20:48,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:48,350 INFO L225 Difference]: With dead ends: 1074 [2021-10-28 23:20:48,350 INFO L226 Difference]: Without dead ends: 1053 [2021-10-28 23:20:48,351 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:20:48,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2021-10-28 23:20:48,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 915. [2021-10-28 23:20:48,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 909 states have (on average 1.350935093509351) internal successors, (1228), 914 states have internal predecessors, (1228), 0 states have call successors, (0), 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-10-28 23:20:48,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1228 transitions. [2021-10-28 23:20:48,427 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1228 transitions. Word has length 35 [2021-10-28 23:20:48,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:48,427 INFO L470 AbstractCegarLoop]: Abstraction has 915 states and 1228 transitions. [2021-10-28 23:20:48,427 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-10-28 23:20:48,427 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1228 transitions. [2021-10-28 23:20:48,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-28 23:20:48,430 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:48,430 INFO L513 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-10-28 23:20:48,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-28 23:20:48,430 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:48,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:48,431 INFO L85 PathProgramCache]: Analyzing trace with hash 479003308, now seen corresponding path program 1 times [2021-10-28 23:20:48,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:48,431 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308397497] [2021-10-28 23:20:48,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:48,431 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:48,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:48,498 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:48,498 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308397497] [2021-10-28 23:20:48,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308397497] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:48,499 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:48,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 23:20:48,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128995904] [2021-10-28 23:20:48,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 23:20:48,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:48,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 23:20:48,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-28 23:20:48,500 INFO L87 Difference]: Start difference. First operand 915 states and 1228 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 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-10-28 23:20:48,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:48,827 INFO L93 Difference]: Finished difference Result 946 states and 1258 transitions. [2021-10-28 23:20:48,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-28 23:20:48,827 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 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-10-28 23:20:48,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:48,830 INFO L225 Difference]: With dead ends: 946 [2021-10-28 23:20:48,830 INFO L226 Difference]: Without dead ends: 917 [2021-10-28 23:20:48,831 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-10-28 23:20:48,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2021-10-28 23:20:48,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 899. [2021-10-28 23:20:48,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 893 states have (on average 1.3527435610302352) internal successors, (1208), 898 states have internal predecessors, (1208), 0 states have call successors, (0), 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-10-28 23:20:48,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1208 transitions. [2021-10-28 23:20:48,933 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1208 transitions. Word has length 35 [2021-10-28 23:20:48,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:48,933 INFO L470 AbstractCegarLoop]: Abstraction has 899 states and 1208 transitions. [2021-10-28 23:20:48,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 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-10-28 23:20:48,934 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1208 transitions. [2021-10-28 23:20:48,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-28 23:20:48,936 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:48,937 INFO L513 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-10-28 23:20:48,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-28 23:20:48,937 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:48,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:48,938 INFO L85 PathProgramCache]: Analyzing trace with hash 290487121, now seen corresponding path program 1 times [2021-10-28 23:20:48,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:48,938 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644475455] [2021-10-28 23:20:48,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:48,939 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:49,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:49,002 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:49,003 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644475455] [2021-10-28 23:20:49,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644475455] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:49,003 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:49,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 23:20:49,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101792140] [2021-10-28 23:20:49,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 23:20:49,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:49,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 23:20:49,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-28 23:20:49,005 INFO L87 Difference]: Start difference. First operand 899 states and 1208 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 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-10-28 23:20:49,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:49,187 INFO L93 Difference]: Finished difference Result 915 states and 1224 transitions. [2021-10-28 23:20:49,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-28 23:20:49,190 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 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-10-28 23:20:49,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:49,192 INFO L225 Difference]: With dead ends: 915 [2021-10-28 23:20:49,192 INFO L226 Difference]: Without dead ends: 884 [2021-10-28 23:20:49,193 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-10-28 23:20:49,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2021-10-28 23:20:49,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 884. [2021-10-28 23:20:49,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 878 states have (on average 1.3519362186788155) internal successors, (1187), 883 states have internal predecessors, (1187), 0 states have call successors, (0), 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-10-28 23:20:49,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1187 transitions. [2021-10-28 23:20:49,267 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1187 transitions. Word has length 36 [2021-10-28 23:20:49,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:49,267 INFO L470 AbstractCegarLoop]: Abstraction has 884 states and 1187 transitions. [2021-10-28 23:20:49,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 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-10-28 23:20:49,268 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1187 transitions. [2021-10-28 23:20:49,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-28 23:20:49,270 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:49,270 INFO L513 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-10-28 23:20:49,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-28 23:20:49,271 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:49,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:49,271 INFO L85 PathProgramCache]: Analyzing trace with hash 2146304349, now seen corresponding path program 1 times [2021-10-28 23:20:49,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:49,272 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216900565] [2021-10-28 23:20:49,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:49,272 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:49,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:49,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:49,327 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216900565] [2021-10-28 23:20:49,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216900565] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:49,328 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:49,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 23:20:49,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090201439] [2021-10-28 23:20:49,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 23:20:49,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:49,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 23:20:49,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-28 23:20:49,330 INFO L87 Difference]: Start difference. First operand 884 states and 1187 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 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-10-28 23:20:49,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:49,520 INFO L93 Difference]: Finished difference Result 900 states and 1203 transitions. [2021-10-28 23:20:49,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 23:20:49,521 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 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-10-28 23:20:49,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:49,523 INFO L225 Difference]: With dead ends: 900 [2021-10-28 23:20:49,523 INFO L226 Difference]: Without dead ends: 872 [2021-10-28 23:20:49,524 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-28 23:20:49,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2021-10-28 23:20:49,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2021-10-28 23:20:49,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 866 states have (on average 1.3498845265588915) internal successors, (1169), 871 states have internal predecessors, (1169), 0 states have call successors, (0), 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-10-28 23:20:49,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1169 transitions. [2021-10-28 23:20:49,597 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1169 transitions. Word has length 36 [2021-10-28 23:20:49,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:49,597 INFO L470 AbstractCegarLoop]: Abstraction has 872 states and 1169 transitions. [2021-10-28 23:20:49,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 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-10-28 23:20:49,598 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1169 transitions. [2021-10-28 23:20:49,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-28 23:20:49,600 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:49,600 INFO L513 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-10-28 23:20:49,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-28 23:20:49,601 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:49,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:49,601 INFO L85 PathProgramCache]: Analyzing trace with hash -700544509, now seen corresponding path program 1 times [2021-10-28 23:20:49,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:49,602 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493376621] [2021-10-28 23:20:49,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:49,602 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:49,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:49,726 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:49,726 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493376621] [2021-10-28 23:20:49,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493376621] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:49,726 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:49,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-28 23:20:49,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172891807] [2021-10-28 23:20:49,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 23:20:49,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:49,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 23:20:49,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-28 23:20:49,728 INFO L87 Difference]: Start difference. First operand 872 states and 1169 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 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-10-28 23:20:50,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:50,190 INFO L93 Difference]: Finished difference Result 903 states and 1199 transitions. [2021-10-28 23:20:50,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 23:20:50,191 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 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-10-28 23:20:50,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:50,193 INFO L225 Difference]: With dead ends: 903 [2021-10-28 23:20:50,194 INFO L226 Difference]: Without dead ends: 874 [2021-10-28 23:20:50,194 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2021-10-28 23:20:50,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2021-10-28 23:20:50,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 856. [2021-10-28 23:20:50,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 850 states have (on average 1.351764705882353) internal successors, (1149), 855 states have internal predecessors, (1149), 0 states have call successors, (0), 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-10-28 23:20:50,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1149 transitions. [2021-10-28 23:20:50,263 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1149 transitions. Word has length 36 [2021-10-28 23:20:50,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:50,263 INFO L470 AbstractCegarLoop]: Abstraction has 856 states and 1149 transitions. [2021-10-28 23:20:50,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 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-10-28 23:20:50,263 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1149 transitions. [2021-10-28 23:20:50,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-28 23:20:50,266 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:50,266 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:20:50,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-28 23:20:50,266 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:50,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:50,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1075516100, now seen corresponding path program 1 times [2021-10-28 23:20:50,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:50,267 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857740413] [2021-10-28 23:20:50,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:50,268 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:50,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:50,290 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:50,291 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857740413] [2021-10-28 23:20:50,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857740413] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:50,291 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:50,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:20:50,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587832302] [2021-10-28 23:20:50,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:20:50,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:50,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:20:50,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:50,293 INFO L87 Difference]: Start difference. First operand 856 states and 1149 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:50,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:50,398 INFO L93 Difference]: Finished difference Result 1052 states and 1409 transitions. [2021-10-28 23:20:50,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:20:50,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-28 23:20:50,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:50,400 INFO L225 Difference]: With dead ends: 1052 [2021-10-28 23:20:50,400 INFO L226 Difference]: Without dead ends: 716 [2021-10-28 23:20:50,402 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:50,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2021-10-28 23:20:50,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 666. [2021-10-28 23:20:50,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 660 states have (on average 1.343939393939394) internal successors, (887), 665 states have internal predecessors, (887), 0 states have call successors, (0), 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-10-28 23:20:50,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 887 transitions. [2021-10-28 23:20:50,454 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 887 transitions. Word has length 37 [2021-10-28 23:20:50,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:50,454 INFO L470 AbstractCegarLoop]: Abstraction has 666 states and 887 transitions. [2021-10-28 23:20:50,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:50,455 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 887 transitions. [2021-10-28 23:20:50,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-28 23:20:50,457 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:50,457 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:20:50,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-28 23:20:50,457 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:50,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:50,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1405976500, now seen corresponding path program 1 times [2021-10-28 23:20:50,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:50,458 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768885980] [2021-10-28 23:20:50,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:50,459 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:50,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:50,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:50,593 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768885980] [2021-10-28 23:20:50,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768885980] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:50,594 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:50,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-28 23:20:50,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170779736] [2021-10-28 23:20:50,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 23:20:50,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:50,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 23:20:50,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-28 23:20:50,596 INFO L87 Difference]: Start difference. First operand 666 states and 887 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:51,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:51,173 INFO L93 Difference]: Finished difference Result 700 states and 920 transitions. [2021-10-28 23:20:51,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-28 23:20:51,174 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-28 23:20:51,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:51,176 INFO L225 Difference]: With dead ends: 700 [2021-10-28 23:20:51,176 INFO L226 Difference]: Without dead ends: 668 [2021-10-28 23:20:51,177 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2021-10-28 23:20:51,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2021-10-28 23:20:51,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 647. [2021-10-28 23:20:51,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 641 states have (on average 1.3416536661466458) internal successors, (860), 646 states have internal predecessors, (860), 0 states have call successors, (0), 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-10-28 23:20:51,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 860 transitions. [2021-10-28 23:20:51,252 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 860 transitions. Word has length 37 [2021-10-28 23:20:51,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:51,252 INFO L470 AbstractCegarLoop]: Abstraction has 647 states and 860 transitions. [2021-10-28 23:20:51,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:51,253 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 860 transitions. [2021-10-28 23:20:51,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-28 23:20:51,255 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:51,255 INFO L513 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-10-28 23:20:51,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-28 23:20:51,256 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:51,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:51,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1404147991, now seen corresponding path program 1 times [2021-10-28 23:20:51,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:51,257 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855299970] [2021-10-28 23:20:51,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:51,257 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:51,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:51,323 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:51,323 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855299970] [2021-10-28 23:20:51,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855299970] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:51,323 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:51,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 23:20:51,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835855239] [2021-10-28 23:20:51,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 23:20:51,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:51,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 23:20:51,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-28 23:20:51,325 INFO L87 Difference]: Start difference. First operand 647 states and 860 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 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-10-28 23:20:51,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:51,487 INFO L93 Difference]: Finished difference Result 672 states and 889 transitions. [2021-10-28 23:20:51,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 23:20:51,487 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 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-10-28 23:20:51,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:51,489 INFO L225 Difference]: With dead ends: 672 [2021-10-28 23:20:51,489 INFO L226 Difference]: Without dead ends: 639 [2021-10-28 23:20:51,490 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-28 23:20:51,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2021-10-28 23:20:51,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2021-10-28 23:20:51,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 633 states have (on average 1.3364928909952607) internal successors, (846), 638 states have internal predecessors, (846), 0 states have call successors, (0), 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-10-28 23:20:51,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 846 transitions. [2021-10-28 23:20:51,540 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 846 transitions. Word has length 38 [2021-10-28 23:20:51,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:51,540 INFO L470 AbstractCegarLoop]: Abstraction has 639 states and 846 transitions. [2021-10-28 23:20:51,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 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-10-28 23:20:51,541 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 846 transitions. [2021-10-28 23:20:51,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-28 23:20:51,546 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:51,547 INFO L513 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-10-28 23:20:51,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-28 23:20:51,547 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:51,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:51,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1025315248, now seen corresponding path program 1 times [2021-10-28 23:20:51,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:51,548 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408765115] [2021-10-28 23:20:51,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:51,548 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:51,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:51,576 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:51,576 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408765115] [2021-10-28 23:20:51,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408765115] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:51,576 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:51,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:20:51,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388276790] [2021-10-28 23:20:51,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:20:51,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:51,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:20:51,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:51,579 INFO L87 Difference]: Start difference. First operand 639 states and 846 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-10-28 23:20:51,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:51,640 INFO L93 Difference]: Finished difference Result 691 states and 908 transitions. [2021-10-28 23:20:51,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:20:51,641 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-10-28 23:20:51,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:51,642 INFO L225 Difference]: With dead ends: 691 [2021-10-28 23:20:51,643 INFO L226 Difference]: Without dead ends: 649 [2021-10-28 23:20:51,643 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:51,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2021-10-28 23:20:51,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 636. [2021-10-28 23:20:51,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 630 states have (on average 1.3349206349206348) internal successors, (841), 635 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:51,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 841 transitions. [2021-10-28 23:20:51,692 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 841 transitions. Word has length 38 [2021-10-28 23:20:51,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:51,692 INFO L470 AbstractCegarLoop]: Abstraction has 636 states and 841 transitions. [2021-10-28 23:20:51,692 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-10-28 23:20:51,693 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 841 transitions. [2021-10-28 23:20:51,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-28 23:20:51,694 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:51,694 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:20:51,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-28 23:20:51,695 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:51,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:51,695 INFO L85 PathProgramCache]: Analyzing trace with hash -2131208369, now seen corresponding path program 1 times [2021-10-28 23:20:51,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:51,696 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178492163] [2021-10-28 23:20:51,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:51,696 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:51,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:51,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:51,735 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178492163] [2021-10-28 23:20:51,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178492163] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:51,735 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:51,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 23:20:51,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807421304] [2021-10-28 23:20:51,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:20:51,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:51,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:20:51,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:20:51,738 INFO L87 Difference]: Start difference. First operand 636 states and 841 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:51,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:51,874 INFO L93 Difference]: Finished difference Result 730 states and 951 transitions. [2021-10-28 23:20:51,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 23:20:51,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-10-28 23:20:51,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:51,877 INFO L225 Difference]: With dead ends: 730 [2021-10-28 23:20:51,877 INFO L226 Difference]: Without dead ends: 688 [2021-10-28 23:20:51,878 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:20:51,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2021-10-28 23:20:51,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 626. [2021-10-28 23:20:51,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 620 states have (on average 1.3258064516129033) internal successors, (822), 625 states have internal predecessors, (822), 0 states have call successors, (0), 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-10-28 23:20:51,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 822 transitions. [2021-10-28 23:20:51,929 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 822 transitions. Word has length 39 [2021-10-28 23:20:51,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:51,930 INFO L470 AbstractCegarLoop]: Abstraction has 626 states and 822 transitions. [2021-10-28 23:20:51,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:51,930 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 822 transitions. [2021-10-28 23:20:51,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-28 23:20:51,932 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:51,932 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:20:51,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-10-28 23:20:51,933 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:51,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:51,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1912353651, now seen corresponding path program 1 times [2021-10-28 23:20:51,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:51,933 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766105211] [2021-10-28 23:20:51,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:51,934 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:51,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:51,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:51,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:51,976 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766105211] [2021-10-28 23:20:51,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766105211] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:51,976 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:51,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 23:20:51,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542961205] [2021-10-28 23:20:51,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 23:20:51,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:51,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 23:20:51,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:20:51,978 INFO L87 Difference]: Start difference. First operand 626 states and 822 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:52,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:52,102 INFO L93 Difference]: Finished difference Result 713 states and 913 transitions. [2021-10-28 23:20:52,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 23:20:52,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-10-28 23:20:52,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:52,104 INFO L225 Difference]: With dead ends: 713 [2021-10-28 23:20:52,104 INFO L226 Difference]: Without dead ends: 693 [2021-10-28 23:20:52,105 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-28 23:20:52,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2021-10-28 23:20:52,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 633. [2021-10-28 23:20:52,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 627 states have (on average 1.3221690590111643) internal successors, (829), 632 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:52,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 829 transitions. [2021-10-28 23:20:52,154 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 829 transitions. Word has length 39 [2021-10-28 23:20:52,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:52,155 INFO L470 AbstractCegarLoop]: Abstraction has 633 states and 829 transitions. [2021-10-28 23:20:52,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:52,155 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 829 transitions. [2021-10-28 23:20:52,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-28 23:20:52,157 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:52,157 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:20:52,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-10-28 23:20:52,157 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:52,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:52,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1059382494, now seen corresponding path program 1 times [2021-10-28 23:20:52,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:52,158 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031255959] [2021-10-28 23:20:52,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:52,158 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:52,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:52,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:52,293 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031255959] [2021-10-28 23:20:52,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031255959] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:52,293 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:52,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 23:20:52,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270917233] [2021-10-28 23:20:52,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 23:20:52,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:52,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 23:20:52,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:20:52,296 INFO L87 Difference]: Start difference. First operand 633 states and 829 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:52,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:52,447 INFO L93 Difference]: Finished difference Result 766 states and 1000 transitions. [2021-10-28 23:20:52,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 23:20:52,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-10-28 23:20:52,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:52,449 INFO L225 Difference]: With dead ends: 766 [2021-10-28 23:20:52,449 INFO L226 Difference]: Without dead ends: 632 [2021-10-28 23:20:52,450 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-28 23:20:52,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2021-10-28 23:20:52,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 619. [2021-10-28 23:20:52,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 613 states have (on average 1.3164763458401305) internal successors, (807), 618 states have internal predecessors, (807), 0 states have call successors, (0), 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-10-28 23:20:52,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 807 transitions. [2021-10-28 23:20:52,519 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 807 transitions. Word has length 39 [2021-10-28 23:20:52,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:52,519 INFO L470 AbstractCegarLoop]: Abstraction has 619 states and 807 transitions. [2021-10-28 23:20:52,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:52,519 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 807 transitions. [2021-10-28 23:20:52,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-28 23:20:52,521 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:52,521 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:20:52,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-10-28 23:20:52,522 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:52,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:52,522 INFO L85 PathProgramCache]: Analyzing trace with hash -494516766, now seen corresponding path program 1 times [2021-10-28 23:20:52,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:52,522 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308830732] [2021-10-28 23:20:52,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:52,523 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:52,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:52,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:52,577 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308830732] [2021-10-28 23:20:52,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308830732] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:52,579 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:52,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 23:20:52,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083254576] [2021-10-28 23:20:52,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 23:20:52,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:52,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 23:20:52,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-28 23:20:52,581 INFO L87 Difference]: Start difference. First operand 619 states and 807 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:52,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:52,758 INFO L93 Difference]: Finished difference Result 640 states and 829 transitions. [2021-10-28 23:20:52,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 23:20:52,758 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-10-28 23:20:52,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:52,760 INFO L225 Difference]: With dead ends: 640 [2021-10-28 23:20:52,760 INFO L226 Difference]: Without dead ends: 532 [2021-10-28 23:20:52,761 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-28 23:20:52,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-10-28 23:20:52,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2021-10-28 23:20:52,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 526 states have (on average 1.3193916349809887) internal successors, (694), 531 states have internal predecessors, (694), 0 states have call successors, (0), 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-10-28 23:20:52,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 694 transitions. [2021-10-28 23:20:52,819 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 694 transitions. Word has length 40 [2021-10-28 23:20:52,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:52,819 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 694 transitions. [2021-10-28 23:20:52,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:52,819 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 694 transitions. [2021-10-28 23:20:52,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-28 23:20:52,821 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:52,821 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:20:52,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-10-28 23:20:52,821 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:52,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:52,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1734827187, now seen corresponding path program 1 times [2021-10-28 23:20:52,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:52,822 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126105138] [2021-10-28 23:20:52,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:52,823 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:52,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:52,882 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:52,882 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126105138] [2021-10-28 23:20:52,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126105138] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:52,883 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:52,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 23:20:52,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841995652] [2021-10-28 23:20:52,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:20:52,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:52,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:20:52,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:20:52,884 INFO L87 Difference]: Start difference. First operand 532 states and 694 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:53,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:53,066 INFO L93 Difference]: Finished difference Result 705 states and 915 transitions. [2021-10-28 23:20:53,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 23:20:53,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-10-28 23:20:53,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:53,068 INFO L225 Difference]: With dead ends: 705 [2021-10-28 23:20:53,068 INFO L226 Difference]: Without dead ends: 550 [2021-10-28 23:20:53,070 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:20:53,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2021-10-28 23:20:53,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 532. [2021-10-28 23:20:53,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 526 states have (on average 1.311787072243346) internal successors, (690), 531 states have internal predecessors, (690), 0 states have call successors, (0), 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-10-28 23:20:53,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 690 transitions. [2021-10-28 23:20:53,132 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 690 transitions. Word has length 40 [2021-10-28 23:20:53,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:53,132 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 690 transitions. [2021-10-28 23:20:53,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:53,132 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 690 transitions. [2021-10-28 23:20:53,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-28 23:20:53,134 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:53,134 INFO L513 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-10-28 23:20:53,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-10-28 23:20:53,134 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:53,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:53,135 INFO L85 PathProgramCache]: Analyzing trace with hash 289296501, now seen corresponding path program 1 times [2021-10-28 23:20:53,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:53,135 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448893735] [2021-10-28 23:20:53,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:53,136 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:53,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:53,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:53,235 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:53,237 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448893735] [2021-10-28 23:20:53,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448893735] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:53,237 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:53,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-28 23:20:53,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560017680] [2021-10-28 23:20:53,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-28 23:20:53,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:53,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-28 23:20:53,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-10-28 23:20:53,239 INFO L87 Difference]: Start difference. First operand 532 states and 690 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 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-10-28 23:20:53,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:53,563 INFO L93 Difference]: Finished difference Result 624 states and 800 transitions. [2021-10-28 23:20:53,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 23:20:53,563 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 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-10-28 23:20:53,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:53,565 INFO L225 Difference]: With dead ends: 624 [2021-10-28 23:20:53,565 INFO L226 Difference]: Without dead ends: 479 [2021-10-28 23:20:53,566 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2021-10-28 23:20:53,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2021-10-28 23:20:53,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 432. [2021-10-28 23:20:53,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 426 states have (on average 1.2863849765258215) internal successors, (548), 431 states have internal predecessors, (548), 0 states have call successors, (0), 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-10-28 23:20:53,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 548 transitions. [2021-10-28 23:20:53,620 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 548 transitions. Word has length 41 [2021-10-28 23:20:53,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:53,622 INFO L470 AbstractCegarLoop]: Abstraction has 432 states and 548 transitions. [2021-10-28 23:20:53,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 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-10-28 23:20:53,623 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 548 transitions. [2021-10-28 23:20:53,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-28 23:20:53,624 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:53,624 INFO L513 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-10-28 23:20:53,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-10-28 23:20:53,625 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:53,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:53,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1488645827, now seen corresponding path program 1 times [2021-10-28 23:20:53,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:53,626 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882227606] [2021-10-28 23:20:53,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:53,626 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:53,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:53,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:53,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:53,650 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882227606] [2021-10-28 23:20:53,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882227606] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:53,650 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:53,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:20:53,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979140515] [2021-10-28 23:20:53,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:20:53,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:53,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:20:53,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:53,652 INFO L87 Difference]: Start difference. First operand 432 states and 548 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 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-10-28 23:20:53,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:53,777 INFO L93 Difference]: Finished difference Result 481 states and 603 transitions. [2021-10-28 23:20:53,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:20:53,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 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-10-28 23:20:53,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:53,778 INFO L225 Difference]: With dead ends: 481 [2021-10-28 23:20:53,779 INFO L226 Difference]: Without dead ends: 468 [2021-10-28 23:20:53,779 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:53,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2021-10-28 23:20:53,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 458. [2021-10-28 23:20:53,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 452 states have (on average 1.2809734513274336) internal successors, (579), 457 states have internal predecessors, (579), 0 states have call successors, (0), 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-10-28 23:20:53,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 579 transitions. [2021-10-28 23:20:53,838 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 579 transitions. Word has length 41 [2021-10-28 23:20:53,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:53,839 INFO L470 AbstractCegarLoop]: Abstraction has 458 states and 579 transitions. [2021-10-28 23:20:53,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 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-10-28 23:20:53,839 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 579 transitions. [2021-10-28 23:20:53,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-10-28 23:20:53,840 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:53,841 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:20:53,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-10-28 23:20:53,841 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:53,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:53,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1202346494, now seen corresponding path program 1 times [2021-10-28 23:20:53,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:53,842 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263195690] [2021-10-28 23:20:53,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:53,842 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:53,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:53,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:53,885 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263195690] [2021-10-28 23:20:53,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263195690] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:53,885 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:53,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:20:53,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143868888] [2021-10-28 23:20:53,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:20:53,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:53,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:20:53,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:53,886 INFO L87 Difference]: Start difference. First operand 458 states and 579 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:53,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:53,956 INFO L93 Difference]: Finished difference Result 484 states and 608 transitions. [2021-10-28 23:20:53,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:20:53,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-10-28 23:20:53,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:53,958 INFO L225 Difference]: With dead ends: 484 [2021-10-28 23:20:53,958 INFO L226 Difference]: Without dead ends: 453 [2021-10-28 23:20:53,959 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:53,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2021-10-28 23:20:54,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 450. [2021-10-28 23:20:54,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 444 states have (on average 1.2702702702702702) internal successors, (564), 449 states have internal predecessors, (564), 0 states have call successors, (0), 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-10-28 23:20:54,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 564 transitions. [2021-10-28 23:20:54,015 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 564 transitions. Word has length 42 [2021-10-28 23:20:54,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:54,015 INFO L470 AbstractCegarLoop]: Abstraction has 450 states and 564 transitions. [2021-10-28 23:20:54,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:54,015 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 564 transitions. [2021-10-28 23:20:54,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-10-28 23:20:54,017 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:54,017 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:20:54,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-10-28 23:20:54,017 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:54,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:54,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1198792050, now seen corresponding path program 1 times [2021-10-28 23:20:54,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:54,018 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961806375] [2021-10-28 23:20:54,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:54,018 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:54,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:54,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:54,043 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961806375] [2021-10-28 23:20:54,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961806375] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:54,043 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:54,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:20:54,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89063135] [2021-10-28 23:20:54,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:20:54,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:54,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:20:54,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:54,044 INFO L87 Difference]: Start difference. First operand 450 states and 564 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:54,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:54,160 INFO L93 Difference]: Finished difference Result 535 states and 665 transitions. [2021-10-28 23:20:54,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:20:54,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-10-28 23:20:54,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:54,161 INFO L225 Difference]: With dead ends: 535 [2021-10-28 23:20:54,161 INFO L226 Difference]: Without dead ends: 394 [2021-10-28 23:20:54,162 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:54,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2021-10-28 23:20:54,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 374. [2021-10-28 23:20:54,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 370 states have (on average 1.2405405405405405) internal successors, (459), 373 states have internal predecessors, (459), 0 states have call successors, (0), 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-10-28 23:20:54,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 459 transitions. [2021-10-28 23:20:54,211 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 459 transitions. Word has length 42 [2021-10-28 23:20:54,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:54,211 INFO L470 AbstractCegarLoop]: Abstraction has 374 states and 459 transitions. [2021-10-28 23:20:54,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:54,212 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 459 transitions. [2021-10-28 23:20:54,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-28 23:20:54,213 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:54,213 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:20:54,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-10-28 23:20:54,213 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:54,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:54,214 INFO L85 PathProgramCache]: Analyzing trace with hash 888562187, now seen corresponding path program 1 times [2021-10-28 23:20:54,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:54,214 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005329438] [2021-10-28 23:20:54,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:54,214 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:54,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:54,282 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:54,283 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005329438] [2021-10-28 23:20:54,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005329438] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:54,283 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:54,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 23:20:54,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869950105] [2021-10-28 23:20:54,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 23:20:54,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:54,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 23:20:54,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-28 23:20:54,285 INFO L87 Difference]: Start difference. First operand 374 states and 459 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 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-10-28 23:20:54,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:54,434 INFO L93 Difference]: Finished difference Result 417 states and 508 transitions. [2021-10-28 23:20:54,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-28 23:20:54,434 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2021-10-28 23:20:54,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:54,435 INFO L225 Difference]: With dead ends: 417 [2021-10-28 23:20:54,436 INFO L226 Difference]: Without dead ends: 392 [2021-10-28 23:20:54,436 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-10-28 23:20:54,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2021-10-28 23:20:54,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 362. [2021-10-28 23:20:54,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 358 states have (on average 1.2430167597765363) internal successors, (445), 361 states have internal predecessors, (445), 0 states have call successors, (0), 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-10-28 23:20:54,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 445 transitions. [2021-10-28 23:20:54,481 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 445 transitions. Word has length 43 [2021-10-28 23:20:54,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:54,482 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 445 transitions. [2021-10-28 23:20:54,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 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-10-28 23:20:54,482 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 445 transitions. [2021-10-28 23:20:54,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-28 23:20:54,483 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:54,483 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:20:54,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-10-28 23:20:54,484 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:54,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:54,484 INFO L85 PathProgramCache]: Analyzing trace with hash -352812212, now seen corresponding path program 1 times [2021-10-28 23:20:54,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:54,485 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693256171] [2021-10-28 23:20:54,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:54,485 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:54,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:54,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:54,544 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693256171] [2021-10-28 23:20:54,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693256171] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:54,544 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:54,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 23:20:54,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386449965] [2021-10-28 23:20:54,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:20:54,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:54,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:20:54,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:20:54,545 INFO L87 Difference]: Start difference. First operand 362 states and 445 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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-10-28 23:20:54,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:54,668 INFO L93 Difference]: Finished difference Result 367 states and 449 transitions. [2021-10-28 23:20:54,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 23:20:54,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2021-10-28 23:20:54,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:54,669 INFO L225 Difference]: With dead ends: 367 [2021-10-28 23:20:54,669 INFO L226 Difference]: Without dead ends: 343 [2021-10-28 23:20:54,670 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:20:54,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2021-10-28 23:20:54,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2021-10-28 23:20:54,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 339 states have (on average 1.238938053097345) internal successors, (420), 342 states have internal predecessors, (420), 0 states have call successors, (0), 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-10-28 23:20:54,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 420 transitions. [2021-10-28 23:20:54,718 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 420 transitions. Word has length 43 [2021-10-28 23:20:54,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:54,719 INFO L470 AbstractCegarLoop]: Abstraction has 343 states and 420 transitions. [2021-10-28 23:20:54,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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-10-28 23:20:54,719 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 420 transitions. [2021-10-28 23:20:54,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-28 23:20:54,720 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:54,720 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:20:54,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-10-28 23:20:54,721 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:54,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:54,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1424724662, now seen corresponding path program 1 times [2021-10-28 23:20:54,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:54,722 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169808334] [2021-10-28 23:20:54,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:54,722 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:54,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:54,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:54,826 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169808334] [2021-10-28 23:20:54,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169808334] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:54,827 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:54,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-28 23:20:54,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162093651] [2021-10-28 23:20:54,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 23:20:54,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:54,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 23:20:54,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-28 23:20:54,829 INFO L87 Difference]: Start difference. First operand 343 states and 420 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:55,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:55,158 INFO L93 Difference]: Finished difference Result 356 states and 433 transitions. [2021-10-28 23:20:55,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 23:20:55,158 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-10-28 23:20:55,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:55,159 INFO L225 Difference]: With dead ends: 356 [2021-10-28 23:20:55,160 INFO L226 Difference]: Without dead ends: 298 [2021-10-28 23:20:55,161 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2021-10-28 23:20:55,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-10-28 23:20:55,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2021-10-28 23:20:55,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 294 states have (on average 1.2312925170068028) internal successors, (362), 297 states have internal predecessors, (362), 0 states have call successors, (0), 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-10-28 23:20:55,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 362 transitions. [2021-10-28 23:20:55,199 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 362 transitions. Word has length 44 [2021-10-28 23:20:55,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:55,199 INFO L470 AbstractCegarLoop]: Abstraction has 298 states and 362 transitions. [2021-10-28 23:20:55,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:55,201 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 362 transitions. [2021-10-28 23:20:55,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-28 23:20:55,202 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:55,202 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:20:55,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-10-28 23:20:55,202 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:55,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:55,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1904668637, now seen corresponding path program 1 times [2021-10-28 23:20:55,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:55,203 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911151671] [2021-10-28 23:20:55,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:55,203 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:55,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:55,282 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:55,283 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911151671] [2021-10-28 23:20:55,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911151671] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:55,283 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:55,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 23:20:55,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614595032] [2021-10-28 23:20:55,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 23:20:55,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:55,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 23:20:55,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 23:20:55,285 INFO L87 Difference]: Start difference. First operand 298 states and 362 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:55,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:55,464 INFO L93 Difference]: Finished difference Result 628 states and 758 transitions. [2021-10-28 23:20:55,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 23:20:55,465 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-10-28 23:20:55,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:55,466 INFO L225 Difference]: With dead ends: 628 [2021-10-28 23:20:55,466 INFO L226 Difference]: Without dead ends: 558 [2021-10-28 23:20:55,467 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-28 23:20:55,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2021-10-28 23:20:55,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 316. [2021-10-28 23:20:55,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 312 states have (on average 1.2243589743589745) internal successors, (382), 315 states have internal predecessors, (382), 0 states have call successors, (0), 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-10-28 23:20:55,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 382 transitions. [2021-10-28 23:20:55,518 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 382 transitions. Word has length 44 [2021-10-28 23:20:55,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:55,518 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 382 transitions. [2021-10-28 23:20:55,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:55,518 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 382 transitions. [2021-10-28 23:20:55,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-28 23:20:55,519 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:55,520 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:20:55,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-10-28 23:20:55,520 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:55,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:55,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1732054660, now seen corresponding path program 1 times [2021-10-28 23:20:55,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:55,521 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017362143] [2021-10-28 23:20:55,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:55,521 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:55,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:55,568 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:55,569 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017362143] [2021-10-28 23:20:55,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017362143] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:55,569 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:55,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 23:20:55,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875255902] [2021-10-28 23:20:55,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 23:20:55,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:55,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 23:20:55,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 23:20:55,571 INFO L87 Difference]: Start difference. First operand 316 states and 382 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:55,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:55,698 INFO L93 Difference]: Finished difference Result 320 states and 385 transitions. [2021-10-28 23:20:55,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 23:20:55,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-10-28 23:20:55,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:55,700 INFO L225 Difference]: With dead ends: 320 [2021-10-28 23:20:55,701 INFO L226 Difference]: Without dead ends: 316 [2021-10-28 23:20:55,701 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 23:20:55,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-10-28 23:20:55,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2021-10-28 23:20:55,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 312 states have (on average 1.2211538461538463) internal successors, (381), 315 states have internal predecessors, (381), 0 states have call successors, (0), 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-10-28 23:20:55,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 381 transitions. [2021-10-28 23:20:55,750 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 381 transitions. Word has length 44 [2021-10-28 23:20:55,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:55,750 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 381 transitions. [2021-10-28 23:20:55,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:55,751 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 381 transitions. [2021-10-28 23:20:55,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-28 23:20:55,752 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:55,752 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:20:55,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-10-28 23:20:55,752 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:55,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:55,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1966651937, now seen corresponding path program 1 times [2021-10-28 23:20:55,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:55,753 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649122988] [2021-10-28 23:20:55,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:55,754 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:55,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:55,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:55,782 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649122988] [2021-10-28 23:20:55,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649122988] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:55,783 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:55,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 23:20:55,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921729655] [2021-10-28 23:20:55,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 23:20:55,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:55,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 23:20:55,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:55,785 INFO L87 Difference]: Start difference. First operand 316 states and 381 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:55,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:55,897 INFO L93 Difference]: Finished difference Result 621 states and 743 transitions. [2021-10-28 23:20:55,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 23:20:55,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-10-28 23:20:55,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:55,899 INFO L225 Difference]: With dead ends: 621 [2021-10-28 23:20:55,899 INFO L226 Difference]: Without dead ends: 558 [2021-10-28 23:20:55,899 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 23:20:55,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2021-10-28 23:20:55,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 316. [2021-10-28 23:20:55,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 312 states have (on average 1.2147435897435896) internal successors, (379), 315 states have internal predecessors, (379), 0 states have call successors, (0), 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-10-28 23:20:55,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 379 transitions. [2021-10-28 23:20:55,947 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 379 transitions. Word has length 44 [2021-10-28 23:20:55,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:55,948 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 379 transitions. [2021-10-28 23:20:55,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 23:20:55,948 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 379 transitions. [2021-10-28 23:20:55,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-28 23:20:55,950 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:55,950 INFO L513 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-10-28 23:20:55,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-10-28 23:20:55,950 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:55,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:55,951 INFO L85 PathProgramCache]: Analyzing trace with hash 2123245657, now seen corresponding path program 1 times [2021-10-28 23:20:55,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:55,951 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368670277] [2021-10-28 23:20:55,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:55,951 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:56,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:56,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:56,043 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368670277] [2021-10-28 23:20:56,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368670277] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:56,044 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:56,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 23:20:56,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240046228] [2021-10-28 23:20:56,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 23:20:56,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:56,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 23:20:56,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-28 23:20:56,047 INFO L87 Difference]: Start difference. First operand 316 states and 379 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 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-10-28 23:20:56,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:56,370 INFO L93 Difference]: Finished difference Result 535 states and 638 transitions. [2021-10-28 23:20:56,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 23:20:56,371 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 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-10-28 23:20:56,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:56,372 INFO L225 Difference]: With dead ends: 535 [2021-10-28 23:20:56,372 INFO L226 Difference]: Without dead ends: 429 [2021-10-28 23:20:56,373 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-10-28 23:20:56,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2021-10-28 23:20:56,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 324. [2021-10-28 23:20:56,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 320 states have (on average 1.203125) internal successors, (385), 323 states have internal predecessors, (385), 0 states have call successors, (0), 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-10-28 23:20:56,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 385 transitions. [2021-10-28 23:20:56,428 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 385 transitions. Word has length 45 [2021-10-28 23:20:56,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:56,428 INFO L470 AbstractCegarLoop]: Abstraction has 324 states and 385 transitions. [2021-10-28 23:20:56,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 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-10-28 23:20:56,429 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 385 transitions. [2021-10-28 23:20:56,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-28 23:20:56,430 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:56,430 INFO L513 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-10-28 23:20:56,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-10-28 23:20:56,431 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:56,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:56,431 INFO L85 PathProgramCache]: Analyzing trace with hash -970126947, now seen corresponding path program 1 times [2021-10-28 23:20:56,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:56,432 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529176975] [2021-10-28 23:20:56,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:56,432 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:56,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:56,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:56,483 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529176975] [2021-10-28 23:20:56,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529176975] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:56,483 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:56,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 23:20:56,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855270111] [2021-10-28 23:20:56,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 23:20:56,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:56,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 23:20:56,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 23:20:56,485 INFO L87 Difference]: Start difference. First operand 324 states and 385 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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-10-28 23:20:56,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:56,683 INFO L93 Difference]: Finished difference Result 576 states and 684 transitions. [2021-10-28 23:20:56,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 23:20:56,684 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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-10-28 23:20:56,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:56,685 INFO L225 Difference]: With dead ends: 576 [2021-10-28 23:20:56,685 INFO L226 Difference]: Without dead ends: 537 [2021-10-28 23:20:56,686 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-28 23:20:56,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2021-10-28 23:20:56,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 290. [2021-10-28 23:20:56,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 287 states have (on average 1.1986062717770034) internal successors, (344), 289 states have internal predecessors, (344), 0 states have call successors, (0), 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-10-28 23:20:56,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 344 transitions. [2021-10-28 23:20:56,741 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 344 transitions. Word has length 45 [2021-10-28 23:20:56,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:56,742 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 344 transitions. [2021-10-28 23:20:56,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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-10-28 23:20:56,742 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 344 transitions. [2021-10-28 23:20:56,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-28 23:20:56,743 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:56,743 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:20:56,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-10-28 23:20:56,744 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:56,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:56,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1018198740, now seen corresponding path program 1 times [2021-10-28 23:20:56,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:56,745 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517329125] [2021-10-28 23:20:56,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:56,745 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:20:56,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:20:56,863 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:20:56,864 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517329125] [2021-10-28 23:20:56,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517329125] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:20:56,864 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:20:56,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-28 23:20:56,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366816127] [2021-10-28 23:20:56,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 23:20:56,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:20:56,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 23:20:56,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-28 23:20:56,866 INFO L87 Difference]: Start difference. First operand 290 states and 344 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 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-10-28 23:20:57,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:20:57,199 INFO L93 Difference]: Finished difference Result 290 states and 344 transitions. [2021-10-28 23:20:57,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 23:20:57,200 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2021-10-28 23:20:57,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:20:57,201 INFO L225 Difference]: With dead ends: 290 [2021-10-28 23:20:57,201 INFO L226 Difference]: Without dead ends: 214 [2021-10-28 23:20:57,202 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2021-10-28 23:20:57,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-10-28 23:20:57,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2021-10-28 23:20:57,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 212 states have (on average 1.1839622641509433) internal successors, (251), 213 states have internal predecessors, (251), 0 states have call successors, (0), 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-10-28 23:20:57,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 251 transitions. [2021-10-28 23:20:57,243 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 251 transitions. Word has length 47 [2021-10-28 23:20:57,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:20:57,243 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 251 transitions. [2021-10-28 23:20:57,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 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-10-28 23:20:57,244 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 251 transitions. [2021-10-28 23:20:57,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-28 23:20:57,245 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:20:57,245 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:20:57,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-10-28 23:20:57,245 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-28 23:20:57,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:20:57,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1477898981, now seen corresponding path program 1 times [2021-10-28 23:20:57,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:20:57,246 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301775234] [2021-10-28 23:20:57,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:20:57,247 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:20:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:20:57,285 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:20:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:20:57,362 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:20:57,362 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-10-28 23:20:57,363 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,365 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,366 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,366 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,366 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,366 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,366 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,367 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,367 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,367 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,367 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,367 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,368 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,368 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,368 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,368 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,368 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,368 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,369 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,369 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,369 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,369 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,369 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,369 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,370 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,370 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,370 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,370 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,370 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,371 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,371 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,372 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,372 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,373 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,373 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,373 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,373 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,373 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,373 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,374 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,374 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,374 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,374 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,374 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,375 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,375 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,375 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,375 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,375 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,375 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,376 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,376 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,376 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,376 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,376 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,376 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,377 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,377 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,377 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,377 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,377 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,378 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,378 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,378 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,378 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,378 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,378 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,379 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,379 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,379 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,379 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,379 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,380 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,380 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,380 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,380 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,380 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,380 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,381 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,381 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,382 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,382 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,382 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,382 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,382 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,382 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,383 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,383 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,383 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,383 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,383 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,383 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,384 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,384 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,384 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,384 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,384 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,385 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,385 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,385 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,385 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,385 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,386 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:20:57,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-10-28 23:20:57,389 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:20:57,394 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 23:20:57,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 11:20:57 BoogieIcfgContainer [2021-10-28 23:20:57,501 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 23:20:57,502 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 23:20:57,502 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 23:20:57,502 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 23:20:57,503 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:20:37" (3/4) ... [2021-10-28 23:20:57,505 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-28 23:20:57,634 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff8f36a2-359c-4cee-a1bd-36a2449c7615/bin/uautomizer-GMMbpWq8iD/witness.graphml [2021-10-28 23:20:57,634 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 23:20:57,636 INFO L168 Benchmark]: Toolchain (without parser) took 24622.69 ms. Allocated memory was 96.5 MB in the beginning and 375.4 MB in the end (delta: 278.9 MB). Free memory was 61.1 MB in the beginning and 235.5 MB in the end (delta: -174.4 MB). Peak memory consumption was 103.6 MB. Max. memory is 16.1 GB. [2021-10-28 23:20:57,636 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 96.5 MB. Free memory is still 52.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 23:20:57,637 INFO L168 Benchmark]: CACSL2BoogieTranslator took 769.11 ms. Allocated memory was 96.5 MB in the beginning and 121.6 MB in the end (delta: 25.2 MB). Free memory was 61.1 MB in the beginning and 79.4 MB in the end (delta: -18.4 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-10-28 23:20:57,637 INFO L168 Benchmark]: Boogie Procedure Inliner took 237.80 ms. Allocated memory is still 121.6 MB. Free memory was 79.4 MB in the beginning and 59.1 MB in the end (delta: 20.3 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2021-10-28 23:20:57,638 INFO L168 Benchmark]: Boogie Preprocessor took 132.52 ms. Allocated memory is still 121.6 MB. Free memory was 59.1 MB in the beginning and 45.9 MB in the end (delta: 13.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-28 23:20:57,638 INFO L168 Benchmark]: RCFGBuilder took 2866.41 ms. Allocated memory was 121.6 MB in the beginning and 197.1 MB in the end (delta: 75.5 MB). Free memory was 45.9 MB in the beginning and 124.0 MB in the end (delta: -78.1 MB). Peak memory consumption was 34.2 MB. Max. memory is 16.1 GB. [2021-10-28 23:20:57,639 INFO L168 Benchmark]: TraceAbstraction took 20478.06 ms. Allocated memory was 197.1 MB in the beginning and 375.4 MB in the end (delta: 178.3 MB). Free memory was 122.9 MB in the beginning and 248.0 MB in the end (delta: -125.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 16.1 GB. [2021-10-28 23:20:57,639 INFO L168 Benchmark]: Witness Printer took 132.88 ms. Allocated memory is still 375.4 MB. Free memory was 248.0 MB in the beginning and 235.5 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-28 23:20:57,641 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.29 ms. Allocated memory is still 96.5 MB. Free memory is still 52.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 769.11 ms. Allocated memory was 96.5 MB in the beginning and 121.6 MB in the end (delta: 25.2 MB). Free memory was 61.1 MB in the beginning and 79.4 MB in the end (delta: -18.4 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 237.80 ms. Allocated memory is still 121.6 MB. Free memory was 79.4 MB in the beginning and 59.1 MB in the end (delta: 20.3 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 132.52 ms. Allocated memory is still 121.6 MB. Free memory was 59.1 MB in the beginning and 45.9 MB in the end (delta: 13.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2866.41 ms. Allocated memory was 121.6 MB in the beginning and 197.1 MB in the end (delta: 75.5 MB). Free memory was 45.9 MB in the beginning and 124.0 MB in the end (delta: -78.1 MB). Peak memory consumption was 34.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 20478.06 ms. Allocated memory was 197.1 MB in the beginning and 375.4 MB in the end (delta: 178.3 MB). Free memory was 122.9 MB in the beginning and 248.0 MB in the end (delta: -125.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 16.1 GB. * Witness Printer took 132.88 ms. Allocated memory is still 375.4 MB. Free memory was 248.0 MB in the beginning and 235.5 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 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.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 59]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int s ; [L33] int UNLOADED ; [L34] int NP ; [L35] int DC ; [L36] int SKIP1 ; [L37] int SKIP2 ; [L38] int MPR1 ; [L39] int MPR3 ; [L40] int IPC ; [L41] int pended ; [L42] int compFptr ; [L43] int compRegistered ; [L44] int lowerDriverReturn ; [L45] int setEventCalled ; [L46] int customIrp ; [L47] int routine ; [L48] int myStatus ; [L49] int pirp ; [L50] int Executive ; [L51] int Suspended ; [L52] int KernelMode ; [L53] int DeviceUsageTypePaging ; VAL [compFptr=0, compRegistered=0, customIrp=0, DC=0, DeviceUsageTypePaging=0, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, pirp=0, routine=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, Suspended=0, UNLOADED=0] [L1718] int pirp__IoStatus__Status ; [L1719] int d = __VERIFIER_nondet_int() ; [L1720] int status = __VERIFIER_nondet_int() ; [L1721] int irp = __VERIFIER_nondet_int() ; [L1722] int we_should_unload = __VERIFIER_nondet_int() ; [L1723] int irp_choice = __VERIFIER_nondet_int() ; [L1724] int devobj = __VERIFIER_nondet_int() ; [L1725] int __cil_tmp9 ; [L1730] s = 0 [L1731] UNLOADED = 0 [L1732] NP = 0 [L1733] DC = 0 [L1734] SKIP1 = 0 [L1735] SKIP2 = 0 [L1736] MPR1 = 0 [L1737] MPR3 = 0 [L1738] IPC = 0 [L1739] pended = 0 [L1740] compFptr = 0 [L1741] compRegistered = 0 [L1742] lowerDriverReturn = 0 [L1743] setEventCalled = 0 [L1744] customIrp = 0 [L1745] routine = 0 [L1746] myStatus = 0 [L1747] pirp = 0 [L1748] Executive = 0 [L1749] Suspended = 5 [L1750] KernelMode = 0 [L1751] DeviceUsageTypePaging = 1 [L1754] pirp = irp [L67] UNLOADED = 0 [L68] NP = 1 [L69] DC = 2 [L70] SKIP1 = 3 [L71] SKIP2 = 4 [L72] MPR1 = 5 [L73] MPR3 = 6 [L74] IPC = 7 [L75] s = UNLOADED [L76] pended = 0 [L77] compFptr = 0 [L78] compRegistered = 0 [L79] lowerDriverReturn = 0 [L80] setEventCalled = 0 [L81] customIrp = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=-2, routine=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1757] COND TRUE status >= 0 [L1758] s = NP [L1759] customIrp = 0 [L1760] setEventCalled = customIrp [L1761] lowerDriverReturn = setEventCalled [L1762] compRegistered = lowerDriverReturn [L1763] compFptr = compRegistered [L1764] pended = compFptr [L1765] pirp__IoStatus__Status = 0 [L1766] myStatus = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1767] COND TRUE irp_choice == 0 [L1768] pirp__IoStatus__Status = -1073741637 [L1769] myStatus = -1073741637 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1707] s = NP [L1708] customIrp = 0 [L1709] setEventCalled = customIrp [L1710] lowerDriverReturn = setEventCalled [L1711] compRegistered = lowerDriverReturn [L1712] compFptr = compRegistered [L1713] pended = compFptr VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1775] COND FALSE !(status < 0) [L1779] int tmp_ndt_1; [L1780] tmp_ndt_1 = __VERIFIER_nondet_int() [L1781] COND TRUE tmp_ndt_1 == 2 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L313] int deviceExtension__Active = __VERIFIER_nondet_int() ; [L314] int status ; VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L317] COND FALSE !(deviceExtension__Active == 2) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L320] COND FALSE !(deviceExtension__Active == 3) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L323] COND FALSE !(deviceExtension__Active == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L326] COND TRUE deviceExtension__Active == 7 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1591] int currentIrpStack__Parameters__DeviceIoControl__IoControlCode = __VERIFIER_nondet_int() ; [L1592] int deviceExtension__TargetDeviceObject = __VERIFIER_nondet_int() ; [L1593] int irpSp__Control ; [L1594] int tmp ; [L1595] int tmp___0 ; [L1596] int __cil_tmp8 ; [L1597] int __cil_tmp9 ; [L1598] int __cil_tmp10 ; [L1599] int __cil_tmp11 ; [L1600] int __cil_tmp12 ; [L1604] __cil_tmp8 = 56 [L1605] __cil_tmp9 = 16384 [L1606] __cil_tmp10 = 131072 [L1607] __cil_tmp11 = 147456 [L1608] __cil_tmp12 = 147512 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1609] COND TRUE currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp12 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1610] COND FALSE !(s != NP) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1615] COND FALSE !(compRegistered != 0) [L1620] compRegistered = 1 [L1621] routine = 0 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1625] irpSp__Control = 224 [L1900] int Irp__PendingReturned = __VERIFIER_nondet_int() ; [L1901] int returnVal2 ; [L1902] int compRetStatus ; [L1903] int lcontext = __VERIFIER_nondet_int() ; [L1904] unsigned long __cil_tmp8 ; VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1907] COND TRUE \read(compRegistered) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1908] COND TRUE routine == 0 [L1569] int Irp__PendingReturned = __VERIFIER_nondet_int() ; [L1570] int Irp__AssociatedIrp__SystemBuffer = __VERIFIER_nondet_int() ; [L1573] COND TRUE \read(Irp__PendingReturned) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1574] COND TRUE pended == 0 [L1575] pended = 1 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1582] COND FALSE !(myStatus >= 0) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1587] return (myStatus); VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1910] compRetStatus = HPCdrCompletion(DeviceObject, Irp, lcontext) [L1920] __cil_tmp8 = (unsigned long )compRetStatus VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1921] COND FALSE !(__cil_tmp8 == -1073741802) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1928] COND FALSE !(\read(Irp__PendingReturned)) [L1931] int tmp_ndt_4; [L1932] tmp_ndt_4 = __VERIFIER_nondet_int() [L1933] COND TRUE tmp_ndt_4 == 0 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1944] returnVal2 = 0 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1958] COND TRUE s == NP [L1959] s = IPC [L1960] lowerDriverReturn = returnVal2 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1981] return (returnVal2); VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1626] tmp = IofCallDriver(deviceExtension__TargetDeviceObject, Irp) [L1628] return (tmp); VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L348] status = CdAudioHPCdrDeviceControl(DeviceObject, Irp) [L363] return (status); VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1798] status = CdAudioDeviceControl(devobj, pirp) [L1819] COND TRUE \read(we_should_unload) [L1825] COND TRUE pended == 1 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1826] COND FALSE !(s == NP) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1833] COND TRUE pended == 1 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1834] COND FALSE !(s == MPR3) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1841] COND TRUE s != UNLOADED VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1842] COND TRUE status != -1 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1843] COND TRUE s != SKIP2 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1844] COND FALSE !(s != IPC) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1857] COND FALSE !(pended != 1) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1869] COND TRUE status != 259 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L59] reach_error() VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] - UnprovableResult [Line: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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: 59]: 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, 1185 locations, 103 error locations. Started 1 CEGAR loops. OverallTime: 20.2s, OverallIterations: 56, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 49574 SDtfs, 21547 SDslu, 110166 SDs, 0 SdLazy, 7182 SolverSat, 921 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 392 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1245occurred in iteration=4, InterpolantAutomatonStates: 283, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 55 MinimizatonAttempts, 2604 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1897 NumberOfCodeBlocks, 1897 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 1795 ConstructedInterpolants, 0 QuantifiedInterpolants, 4918 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 55 InterpolantComputations, 55 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-10-28 23:20:57,706 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff8f36a2-359c-4cee-a1bd-36a2449c7615/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...