./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_fce1ca98-c754-40dc-9510-e68e37914470/bin/uautomizer-UnR33cPsHg/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fce1ca98-c754-40dc-9510-e68e37914470/bin/uautomizer-UnR33cPsHg/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fce1ca98-c754-40dc-9510-e68e37914470/bin/uautomizer-UnR33cPsHg/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fce1ca98-c754-40dc-9510-e68e37914470/bin/uautomizer-UnR33cPsHg/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_fce1ca98-c754-40dc-9510-e68e37914470/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fce1ca98-c754-40dc-9510-e68e37914470/bin/uautomizer-UnR33cPsHg --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 09:03:49,825 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 09:03:49,830 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 09:03:49,920 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 09:03:49,921 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 09:03:49,926 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 09:03:49,928 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 09:03:49,934 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 09:03:49,937 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 09:03:49,945 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 09:03:49,947 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 09:03:49,950 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 09:03:49,951 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 09:03:49,954 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 09:03:49,957 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 09:03:49,968 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 09:03:49,970 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 09:03:49,972 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 09:03:49,975 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 09:03:49,985 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 09:03:49,987 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 09:03:49,989 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 09:03:49,993 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 09:03:49,994 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 09:03:50,006 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 09:03:50,007 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 09:03:50,007 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 09:03:50,010 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 09:03:50,011 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 09:03:50,013 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 09:03:50,013 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 09:03:50,015 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 09:03:50,018 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 09:03:50,020 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 09:03:50,022 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 09:03:50,022 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 09:03:50,023 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 09:03:50,024 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 09:03:50,024 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 09:03:50,025 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 09:03:50,026 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 09:03:50,027 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fce1ca98-c754-40dc-9510-e68e37914470/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-28 09:03:50,074 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 09:03:50,074 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 09:03:50,075 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 09:03:50,075 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 09:03:50,077 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 09:03:50,077 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 09:03:50,077 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 09:03:50,078 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 09:03:50,078 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 09:03:50,078 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 09:03:50,079 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 09:03:50,079 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 09:03:50,079 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-28 09:03:50,079 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 09:03:50,080 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-28 09:03:50,080 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 09:03:50,080 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 09:03:50,081 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 09:03:50,081 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-28 09:03:50,081 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 09:03:50,081 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 09:03:50,082 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 09:03:50,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 09:03:50,082 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 09:03:50,083 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 09:03:50,083 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-28 09:03:50,083 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 09:03:50,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 09:03:50,084 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-28 09:03:50,084 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-28 09:03:50,084 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-28 09:03:50,085 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 09:03:50,085 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_fce1ca98-c754-40dc-9510-e68e37914470/bin/uautomizer-UnR33cPsHg/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_fce1ca98-c754-40dc-9510-e68e37914470/bin/uautomizer-UnR33cPsHg 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 09:03:50,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 09:03:50,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 09:03:50,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 09:03:50,546 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 09:03:50,547 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 09:03:50,549 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fce1ca98-c754-40dc-9510-e68e37914470/bin/uautomizer-UnR33cPsHg/../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2021-10-28 09:03:50,627 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fce1ca98-c754-40dc-9510-e68e37914470/bin/uautomizer-UnR33cPsHg/data/33acccf3f/36d8982621cc4f648029cce9a2da6411/FLAG8fcad1273 [2021-10-28 09:03:51,361 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 09:03:51,362 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fce1ca98-c754-40dc-9510-e68e37914470/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2021-10-28 09:03:51,412 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fce1ca98-c754-40dc-9510-e68e37914470/bin/uautomizer-UnR33cPsHg/data/33acccf3f/36d8982621cc4f648029cce9a2da6411/FLAG8fcad1273 [2021-10-28 09:03:51,550 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fce1ca98-c754-40dc-9510-e68e37914470/bin/uautomizer-UnR33cPsHg/data/33acccf3f/36d8982621cc4f648029cce9a2da6411 [2021-10-28 09:03:51,553 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 09:03:51,555 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 09:03:51,561 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 09:03:51,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 09:03:51,568 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 09:03:51,570 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:03:51" (1/1) ... [2021-10-28 09:03:51,572 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7905cb84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:03:51, skipping insertion in model container [2021-10-28 09:03:51,572 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:03:51" (1/1) ... [2021-10-28 09:03:51,582 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 09:03:51,705 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 09:03:51,928 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_fce1ca98-c754-40dc-9510-e68e37914470/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c[2074,2087] [2021-10-28 09:03:52,206 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:03:52,219 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 09:03:52,248 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_fce1ca98-c754-40dc-9510-e68e37914470/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c[2074,2087] [2021-10-28 09:03:52,422 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:03:52,445 INFO L208 MainTranslator]: Completed translation [2021-10-28 09:03:52,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:03:52 WrapperNode [2021-10-28 09:03:52,446 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 09:03:52,447 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 09:03:52,447 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 09:03:52,448 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 09:03:52,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:03:52" (1/1) ... [2021-10-28 09:03:52,503 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:03:52" (1/1) ... [2021-10-28 09:03:52,774 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 09:03:52,775 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 09:03:52,775 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 09:03:52,775 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 09:03:52,787 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:03:52" (1/1) ... [2021-10-28 09:03:52,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:03:52" (1/1) ... [2021-10-28 09:03:52,810 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:03:52" (1/1) ... [2021-10-28 09:03:52,810 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:03:52" (1/1) ... [2021-10-28 09:03:52,912 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:03:52" (1/1) ... [2021-10-28 09:03:53,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:03:52" (1/1) ... [2021-10-28 09:03:53,080 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:03:52" (1/1) ... [2021-10-28 09:03:53,114 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 09:03:53,118 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 09:03:53,118 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 09:03:53,118 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 09:03:53,121 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:03:52" (1/1) ... [2021-10-28 09:03:53,133 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 09:03:53,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fce1ca98-c754-40dc-9510-e68e37914470/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:03:53,175 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fce1ca98-c754-40dc-9510-e68e37914470/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 09:03:53,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fce1ca98-c754-40dc-9510-e68e37914470/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 09:03:53,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 09:03:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 09:03:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 09:03:53,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 09:03:53,658 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,659 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,666 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,670 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,675 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,679 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,686 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,696 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,710 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,712 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,714 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,720 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,725 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,731 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,737 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,742 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,745 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,752 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,753 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,756 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,758 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,761 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,764 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,811 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,813 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,816 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,821 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,824 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,828 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,837 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,841 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,845 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,847 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,849 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,851 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,855 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,856 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,862 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,865 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,868 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,870 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,873 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:53,879 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:03:56,573 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1271: assume false; [2021-10-28 09:03:56,574 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1272: assume !false; [2021-10-28 09:03:56,574 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2021-10-28 09:03:56,574 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2021-10-28 09:03:56,575 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1230: assume !false; [2021-10-28 09:03:56,575 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##287: assume false; [2021-10-28 09:03:56,575 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##288: assume !false; [2021-10-28 09:03:56,575 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1229: assume false; [2021-10-28 09:03:56,575 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1210: assume false; [2021-10-28 09:03:56,575 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1211: assume !false; [2021-10-28 09:03:56,576 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##319: assume false; [2021-10-28 09:03:56,576 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##320: assume !false; [2021-10-28 09:03:56,576 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1160: assume !false; [2021-10-28 09:03:56,576 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1159: assume false; [2021-10-28 09:03:56,577 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##371: assume false; [2021-10-28 09:03:56,577 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##372: assume !false; [2021-10-28 09:03:56,577 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1108: assume false; [2021-10-28 09:03:56,577 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1109: assume !false; [2021-10-28 09:03:56,577 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##346: assume false; [2021-10-28 09:03:56,578 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##347: assume !false; [2021-10-28 09:03:56,578 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##416: assume false; [2021-10-28 09:03:56,578 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##417: assume !false; [2021-10-28 09:03:56,578 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1050: assume !false; [2021-10-28 09:03:56,578 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: CdAudioPnp_#res := 0; [2021-10-28 09:03:56,579 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1049: assume false; [2021-10-28 09:03:56,579 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1003: assume false; [2021-10-28 09:03:56,579 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1004: assume !false; [2021-10-28 09:03:56,579 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##461: assume !false; [2021-10-28 09:03:56,580 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##460: assume false; [2021-10-28 09:03:56,580 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##487: assume !false; [2021-10-28 09:03:56,580 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##486: assume false; [2021-10-28 09:03:56,580 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##526: assume !false; [2021-10-28 09:03:56,580 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##525: assume false; [2021-10-28 09:03:56,581 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##71: assume !false; [2021-10-28 09:03:56,581 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##70: assume false; [2021-10-28 09:03:56,581 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume !false; [2021-10-28 09:03:56,581 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume false; [2021-10-28 09:03:56,581 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume !false; [2021-10-28 09:03:56,582 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume false; [2021-10-28 09:03:56,582 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2021-10-28 09:03:56,582 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2021-10-28 09:03:56,582 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##573: assume !false; [2021-10-28 09:03:56,582 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##572: assume false; [2021-10-28 09:03:56,583 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##685: assume !false; [2021-10-28 09:03:56,583 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##684: assume false; [2021-10-28 09:03:56,583 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##609: assume false; [2021-10-28 09:03:56,584 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##610: assume !false; [2021-10-28 09:03:56,584 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##639: assume !false; [2021-10-28 09:03:56,585 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##638: assume false; [2021-10-28 09:03:56,585 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1612: assume false; [2021-10-28 09:03:56,585 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1613: assume !false; [2021-10-28 09:03:56,586 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##757: assume !false; [2021-10-28 09:03:56,586 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##756: assume false; [2021-10-28 09:03:56,587 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##717: assume !false; [2021-10-28 09:03:56,587 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##716: assume false; [2021-10-28 09:03:56,587 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1506: assume false; [2021-10-28 09:03:56,587 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1507: assume !false; [2021-10-28 09:03:56,587 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1564: assume false; [2021-10-28 09:03:56,588 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1565: assume !false; [2021-10-28 09:03:56,588 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##856: assume false; [2021-10-28 09:03:56,588 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##857: assume !false; [2021-10-28 09:03:56,589 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##801: assume false; [2021-10-28 09:03:56,589 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##802: assume !false; [2021-10-28 09:03:56,589 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##832: assume !false; [2021-10-28 09:03:56,589 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##831: assume false; [2021-10-28 09:03:56,590 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1426: assume false; [2021-10-28 09:03:56,590 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1427: assume !false; [2021-10-28 09:03:56,590 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1476: assume false; [2021-10-28 09:03:56,590 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1477: assume !false; [2021-10-28 09:03:56,591 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1398: assume false; [2021-10-28 09:03:56,592 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1399: assume !false; [2021-10-28 09:03:56,592 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##961: assume !false; [2021-10-28 09:03:56,595 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##960: assume false; [2021-10-28 09:03:56,596 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##909: assume false; [2021-10-28 09:03:56,596 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##910: assume !false; [2021-10-28 09:03:56,596 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1301: assume false; [2021-10-28 09:03:56,596 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1302: assume !false; [2021-10-28 09:03:56,598 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##188: assume !false; [2021-10-28 09:03:56,598 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##187: assume false; [2021-10-28 09:03:56,598 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##148: assume false; [2021-10-28 09:03:56,600 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##149: assume !false; [2021-10-28 09:03:56,606 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1354: assume false; [2021-10-28 09:03:56,607 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1355: assume !false; [2021-10-28 09:03:56,607 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1341: assume false; [2021-10-28 09:03:56,607 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1342: assume !false; [2021-10-28 09:03:56,607 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##111: assume false; [2021-10-28 09:03:56,607 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##112: assume !false; [2021-10-28 09:03:56,641 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 09:03:56,641 INFO L299 CfgBuilder]: Removed 555 assume(true) statements. [2021-10-28 09:03:56,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:03:56 BoogieIcfgContainer [2021-10-28 09:03:56,647 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 09:03:56,649 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 09:03:56,649 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 09:03:56,653 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 09:03:56,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 09:03:51" (1/3) ... [2021-10-28 09:03:56,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a7c3de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 09:03:56, skipping insertion in model container [2021-10-28 09:03:56,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:03:52" (2/3) ... [2021-10-28 09:03:56,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a7c3de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 09:03:56, skipping insertion in model container [2021-10-28 09:03:56,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:03:56" (3/3) ... [2021-10-28 09:03:56,657 INFO L111 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-1.c [2021-10-28 09:03:56,668 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 09:03:56,668 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 103 error locations. [2021-10-28 09:03:56,752 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 09:03:56,762 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 09:03:56,762 INFO L340 AbstractCegarLoop]: Starting to check reachability of 103 error locations. [2021-10-28 09:03:56,819 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 09:03:56,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-28 09:03:56,858 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:03:56,859 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:03:56,859 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 09:03:56,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:03:56,883 INFO L85 PathProgramCache]: Analyzing trace with hash -630605601, now seen corresponding path program 1 times [2021-10-28 09:03:56,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:03:56,903 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831792103] [2021-10-28 09:03:56,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:03:56,906 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:03:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:03:57,303 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 09:03:57,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:03:57,304 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831792103] [2021-10-28 09:03:57,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831792103] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:03:57,305 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:03:57,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:03:57,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452735285] [2021-10-28 09:03:57,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:03:57,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:03:57,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:03:57,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:03:57,361 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 09:03:58,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:03:58,057 INFO L93 Difference]: Finished difference Result 2072 states and 3036 transitions. [2021-10-28 09:03:58,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:03:58,060 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 09:03:58,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:03:58,099 INFO L225 Difference]: With dead ends: 2072 [2021-10-28 09:03:58,099 INFO L226 Difference]: Without dead ends: 1180 [2021-10-28 09:03:58,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 09:03:58,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2021-10-28 09:03:58,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1180. [2021-10-28 09:03:58,275 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 09:03:58,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1645 transitions. [2021-10-28 09:03:58,285 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1645 transitions. Word has length 11 [2021-10-28 09:03:58,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:03:58,286 INFO L470 AbstractCegarLoop]: Abstraction has 1180 states and 1645 transitions. [2021-10-28 09:03:58,286 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 09:03:58,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1645 transitions. [2021-10-28 09:03:58,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-28 09:03:58,288 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:03:58,288 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:03:58,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 09:03:58,289 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 09:03:58,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:03:58,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1724813645, now seen corresponding path program 1 times [2021-10-28 09:03:58,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:03:58,291 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55918947] [2021-10-28 09:03:58,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:03:58,291 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:03:58,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:03:58,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:03:58,374 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:03:58,374 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55918947] [2021-10-28 09:03:58,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55918947] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:03:58,375 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:03:58,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:03:58,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976496178] [2021-10-28 09:03:58,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:03:58,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:03:58,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:03:58,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:03:58,379 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 09:03:59,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:03:59,104 INFO L93 Difference]: Finished difference Result 1458 states and 2013 transitions. [2021-10-28 09:03:59,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:03:59,104 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 09:03:59,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:03:59,114 INFO L225 Difference]: With dead ends: 1458 [2021-10-28 09:03:59,114 INFO L226 Difference]: Without dead ends: 1261 [2021-10-28 09:03:59,116 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 09:03:59,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2021-10-28 09:03:59,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1235. [2021-10-28 09:03:59,164 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 09:03:59,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1744 transitions. [2021-10-28 09:03:59,172 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1744 transitions. Word has length 12 [2021-10-28 09:03:59,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:03:59,172 INFO L470 AbstractCegarLoop]: Abstraction has 1235 states and 1744 transitions. [2021-10-28 09:03:59,173 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 09:03:59,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1744 transitions. [2021-10-28 09:03:59,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-28 09:03:59,175 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:03:59,175 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:03:59,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 09:03:59,176 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 09:03:59,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:03:59,177 INFO L85 PathProgramCache]: Analyzing trace with hash 375851837, now seen corresponding path program 1 times [2021-10-28 09:03:59,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:03:59,177 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575704497] [2021-10-28 09:03:59,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:03:59,178 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:03:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:03:59,261 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 09:03:59,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:03:59,261 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575704497] [2021-10-28 09:03:59,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575704497] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:03:59,262 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:03:59,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:03:59,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553102848] [2021-10-28 09:03:59,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:03:59,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:03:59,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:03:59,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:03:59,265 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 09:03:59,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:03:59,365 INFO L93 Difference]: Finished difference Result 1625 states and 2261 transitions. [2021-10-28 09:03:59,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:03:59,366 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 09:03:59,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:03:59,378 INFO L225 Difference]: With dead ends: 1625 [2021-10-28 09:03:59,378 INFO L226 Difference]: Without dead ends: 1265 [2021-10-28 09:03:59,380 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 09:03:59,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2021-10-28 09:03:59,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1076. [2021-10-28 09:03:59,439 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 09:03:59,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1522 transitions. [2021-10-28 09:03:59,445 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1522 transitions. Word has length 14 [2021-10-28 09:03:59,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:03:59,446 INFO L470 AbstractCegarLoop]: Abstraction has 1076 states and 1522 transitions. [2021-10-28 09:03:59,446 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 09:03:59,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1522 transitions. [2021-10-28 09:03:59,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-28 09:03:59,456 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:03:59,456 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:03:59,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-28 09:03:59,457 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 09:03:59,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:03:59,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1788319990, now seen corresponding path program 1 times [2021-10-28 09:03:59,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:03:59,459 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704992289] [2021-10-28 09:03:59,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:03:59,460 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:03:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:03:59,583 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 09:03:59,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:03:59,585 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704992289] [2021-10-28 09:03:59,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704992289] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:03:59,587 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:03:59,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:03:59,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292938075] [2021-10-28 09:03:59,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:03:59,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:03:59,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:03:59,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:03:59,592 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 09:04:00,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:00,148 INFO L93 Difference]: Finished difference Result 1775 states and 2478 transitions. [2021-10-28 09:04:00,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:04:00,148 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 09:04:00,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:00,163 INFO L225 Difference]: With dead ends: 1775 [2021-10-28 09:04:00,164 INFO L226 Difference]: Without dead ends: 1539 [2021-10-28 09:04:00,167 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 09:04:00,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2021-10-28 09:04:00,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1245. [2021-10-28 09:04:00,238 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 09:04:00,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1774 transitions. [2021-10-28 09:04:00,245 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1774 transitions. Word has length 16 [2021-10-28 09:04:00,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:00,246 INFO L470 AbstractCegarLoop]: Abstraction has 1245 states and 1774 transitions. [2021-10-28 09:04:00,246 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 09:04:00,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1774 transitions. [2021-10-28 09:04:00,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-28 09:04:00,250 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:00,250 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 09:04:00,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-28 09:04:00,251 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 09:04:00,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:00,255 INFO L85 PathProgramCache]: Analyzing trace with hash 388999750, now seen corresponding path program 1 times [2021-10-28 09:04:00,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:00,256 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150715571] [2021-10-28 09:04:00,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:00,257 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:00,391 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 09:04:00,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:00,391 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150715571] [2021-10-28 09:04:00,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150715571] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:00,392 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:00,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:04:00,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548505102] [2021-10-28 09:04:00,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:04:00,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:00,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:04:00,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:04:00,395 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 09:04:00,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:00,925 INFO L93 Difference]: Finished difference Result 1870 states and 2623 transitions. [2021-10-28 09:04:00,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:04:00,926 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 09:04:00,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:00,935 INFO L225 Difference]: With dead ends: 1870 [2021-10-28 09:04:00,935 INFO L226 Difference]: Without dead ends: 1146 [2021-10-28 09:04:00,937 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 09:04:00,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2021-10-28 09:04:01,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1028. [2021-10-28 09:04:01,038 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 09:04:01,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1432 transitions. [2021-10-28 09:04:01,043 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1432 transitions. Word has length 17 [2021-10-28 09:04:01,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:01,044 INFO L470 AbstractCegarLoop]: Abstraction has 1028 states and 1432 transitions. [2021-10-28 09:04:01,044 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 09:04:01,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1432 transitions. [2021-10-28 09:04:01,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-28 09:04:01,046 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:01,047 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 09:04:01,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-28 09:04:01,047 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 09:04:01,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:01,048 INFO L85 PathProgramCache]: Analyzing trace with hash 79997488, now seen corresponding path program 1 times [2021-10-28 09:04:01,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:01,048 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468440243] [2021-10-28 09:04:01,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:01,049 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:01,105 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 09:04:01,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:01,106 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468440243] [2021-10-28 09:04:01,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468440243] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:01,106 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:01,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:04:01,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422435569] [2021-10-28 09:04:01,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:04:01,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:01,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:04:01,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:04:01,109 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 09:04:01,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:01,258 INFO L93 Difference]: Finished difference Result 1343 states and 1857 transitions. [2021-10-28 09:04:01,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 09:04:01,260 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 09:04:01,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:01,269 INFO L225 Difference]: With dead ends: 1343 [2021-10-28 09:04:01,269 INFO L226 Difference]: Without dead ends: 1093 [2021-10-28 09:04:01,270 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 09:04:01,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2021-10-28 09:04:01,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1012. [2021-10-28 09:04:01,340 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 09:04:01,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1406 transitions. [2021-10-28 09:04:01,346 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1406 transitions. Word has length 19 [2021-10-28 09:04:01,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:01,347 INFO L470 AbstractCegarLoop]: Abstraction has 1012 states and 1406 transitions. [2021-10-28 09:04:01,347 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 09:04:01,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1406 transitions. [2021-10-28 09:04:01,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-28 09:04:01,349 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:01,350 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 09:04:01,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-28 09:04:01,350 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 09:04:01,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:01,351 INFO L85 PathProgramCache]: Analyzing trace with hash 2053267823, now seen corresponding path program 1 times [2021-10-28 09:04:01,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:01,352 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012725652] [2021-10-28 09:04:01,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:01,352 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:01,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:04:01,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:01,394 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012725652] [2021-10-28 09:04:01,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012725652] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:01,395 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:01,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:04:01,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135820106] [2021-10-28 09:04:01,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:04:01,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:01,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:04:01,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:04:01,398 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 09:04:01,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:01,721 INFO L93 Difference]: Finished difference Result 1012 states and 1406 transitions. [2021-10-28 09:04:01,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:04:01,722 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 09:04:01,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:01,730 INFO L225 Difference]: With dead ends: 1012 [2021-10-28 09:04:01,731 INFO L226 Difference]: Without dead ends: 994 [2021-10-28 09:04:01,732 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 09:04:01,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2021-10-28 09:04:01,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 994. [2021-10-28 09:04:01,801 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 09:04:01,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1388 transitions. [2021-10-28 09:04:01,806 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1388 transitions. Word has length 20 [2021-10-28 09:04:01,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:01,807 INFO L470 AbstractCegarLoop]: Abstraction has 994 states and 1388 transitions. [2021-10-28 09:04:01,833 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 09:04:01,833 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1388 transitions. [2021-10-28 09:04:01,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-28 09:04:01,835 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:01,836 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 09:04:01,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-28 09:04:01,836 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 09:04:01,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:01,837 INFO L85 PathProgramCache]: Analyzing trace with hash -99023241, now seen corresponding path program 1 times [2021-10-28 09:04:01,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:01,837 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978015817] [2021-10-28 09:04:01,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:01,838 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:01,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:04:01,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:01,884 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978015817] [2021-10-28 09:04:01,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978015817] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:01,884 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:01,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:04:01,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084976544] [2021-10-28 09:04:01,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:04:01,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:01,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:04:01,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:04:01,887 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 09:04:02,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:02,001 INFO L93 Difference]: Finished difference Result 1071 states and 1485 transitions. [2021-10-28 09:04:02,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:04:02,002 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 09:04:02,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:02,011 INFO L225 Difference]: With dead ends: 1071 [2021-10-28 09:04:02,012 INFO L226 Difference]: Without dead ends: 1048 [2021-10-28 09:04:02,013 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 09:04:02,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2021-10-28 09:04:02,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 999. [2021-10-28 09:04:02,103 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 09:04:02,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1410 transitions. [2021-10-28 09:04:02,110 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1410 transitions. Word has length 22 [2021-10-28 09:04:02,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:02,111 INFO L470 AbstractCegarLoop]: Abstraction has 999 states and 1410 transitions. [2021-10-28 09:04:02,111 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 09:04:02,112 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1410 transitions. [2021-10-28 09:04:02,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-28 09:04:02,115 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:02,115 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 09:04:02,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-28 09:04:02,116 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 09:04:02,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:02,117 INFO L85 PathProgramCache]: Analyzing trace with hash 85424501, now seen corresponding path program 1 times [2021-10-28 09:04:02,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:02,117 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970395110] [2021-10-28 09:04:02,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:02,118 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:02,194 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 09:04:02,195 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:02,195 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970395110] [2021-10-28 09:04:02,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970395110] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:02,196 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:02,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:04:02,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499725219] [2021-10-28 09:04:02,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:04:02,197 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:02,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:04:02,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:04:02,199 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 09:04:02,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:02,316 INFO L93 Difference]: Finished difference Result 1274 states and 1786 transitions. [2021-10-28 09:04:02,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:04:02,317 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 09:04:02,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:02,327 INFO L225 Difference]: With dead ends: 1274 [2021-10-28 09:04:02,327 INFO L226 Difference]: Without dead ends: 1045 [2021-10-28 09:04:02,336 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 09:04:02,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2021-10-28 09:04:02,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 999. [2021-10-28 09:04:02,413 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 09:04:02,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1408 transitions. [2021-10-28 09:04:02,419 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1408 transitions. Word has length 25 [2021-10-28 09:04:02,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:02,420 INFO L470 AbstractCegarLoop]: Abstraction has 999 states and 1408 transitions. [2021-10-28 09:04:02,420 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 09:04:02,420 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1408 transitions. [2021-10-28 09:04:02,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-28 09:04:02,423 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:02,423 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 09:04:02,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-28 09:04:02,425 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 09:04:02,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:02,426 INFO L85 PathProgramCache]: Analyzing trace with hash -105580495, now seen corresponding path program 1 times [2021-10-28 09:04:02,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:02,428 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588131867] [2021-10-28 09:04:02,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:02,429 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:02,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:04:02,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:02,493 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588131867] [2021-10-28 09:04:02,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588131867] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:02,494 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:02,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:04:02,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296947616] [2021-10-28 09:04:02,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:04:02,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:02,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:04:02,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:04:02,497 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 09:04:02,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:02,841 INFO L93 Difference]: Finished difference Result 1196 states and 1676 transitions. [2021-10-28 09:04:02,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:04:02,842 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 09:04:02,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:02,851 INFO L225 Difference]: With dead ends: 1196 [2021-10-28 09:04:02,851 INFO L226 Difference]: Without dead ends: 989 [2021-10-28 09:04:02,852 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 09:04:02,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2021-10-28 09:04:02,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 989. [2021-10-28 09:04:02,924 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 09:04:02,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1393 transitions. [2021-10-28 09:04:02,930 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1393 transitions. Word has length 27 [2021-10-28 09:04:02,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:02,930 INFO L470 AbstractCegarLoop]: Abstraction has 989 states and 1393 transitions. [2021-10-28 09:04:02,930 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 09:04:02,931 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1393 transitions. [2021-10-28 09:04:02,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-28 09:04:02,937 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:02,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] [2021-10-28 09:04:02,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-28 09:04:02,938 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 09:04:02,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:02,939 INFO L85 PathProgramCache]: Analyzing trace with hash 333752835, now seen corresponding path program 1 times [2021-10-28 09:04:02,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:02,942 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441365742] [2021-10-28 09:04:02,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:02,943 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:03,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 09:04:03,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:03,043 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441365742] [2021-10-28 09:04:03,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441365742] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:03,044 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:03,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:04:03,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331947813] [2021-10-28 09:04:03,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:04:03,045 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:03,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:04:03,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:04:03,048 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 09:04:03,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:03,480 INFO L93 Difference]: Finished difference Result 1061 states and 1469 transitions. [2021-10-28 09:04:03,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:04:03,480 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 09:04:03,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:03,489 INFO L225 Difference]: With dead ends: 1061 [2021-10-28 09:04:03,489 INFO L226 Difference]: Without dead ends: 1009 [2021-10-28 09:04:03,491 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 09:04:03,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2021-10-28 09:04:03,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 989. [2021-10-28 09:04:03,565 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 09:04:03,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1384 transitions. [2021-10-28 09:04:03,571 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1384 transitions. Word has length 29 [2021-10-28 09:04:03,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:03,571 INFO L470 AbstractCegarLoop]: Abstraction has 989 states and 1384 transitions. [2021-10-28 09:04:03,572 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 09:04:03,572 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1384 transitions. [2021-10-28 09:04:03,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-28 09:04:03,575 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:03,575 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 09:04:03,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-28 09:04:03,577 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 09:04:03,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:03,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1053614682, now seen corresponding path program 1 times [2021-10-28 09:04:03,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:03,579 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469367728] [2021-10-28 09:04:03,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:03,579 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:03,633 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 09:04:03,634 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:03,634 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469367728] [2021-10-28 09:04:03,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469367728] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:03,641 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:03,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:04:03,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735506827] [2021-10-28 09:04:03,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:04:03,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:03,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:04:03,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:04:03,644 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 09:04:03,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:03,968 INFO L93 Difference]: Finished difference Result 1014 states and 1412 transitions. [2021-10-28 09:04:03,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:04:03,969 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 09:04:03,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:03,979 INFO L225 Difference]: With dead ends: 1014 [2021-10-28 09:04:03,979 INFO L226 Difference]: Without dead ends: 1009 [2021-10-28 09:04:03,980 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 09:04:03,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2021-10-28 09:04:04,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1006. [2021-10-28 09:04:04,058 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 09:04:04,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1405 transitions. [2021-10-28 09:04:04,063 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1405 transitions. Word has length 30 [2021-10-28 09:04:04,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:04,064 INFO L470 AbstractCegarLoop]: Abstraction has 1006 states and 1405 transitions. [2021-10-28 09:04:04,064 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 09:04:04,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1405 transitions. [2021-10-28 09:04:04,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-28 09:04:04,067 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:04,068 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 09:04:04,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-28 09:04:04,068 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 09:04:04,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:04,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1714895974, now seen corresponding path program 1 times [2021-10-28 09:04:04,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:04,070 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602847798] [2021-10-28 09:04:04,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:04,070 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:04,155 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 09:04:04,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:04,155 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602847798] [2021-10-28 09:04:04,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602847798] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:04,156 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:04,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:04:04,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077648723] [2021-10-28 09:04:04,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:04:04,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:04,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:04:04,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:04:04,160 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 09:04:04,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:04,571 INFO L93 Difference]: Finished difference Result 1014 states and 1411 transitions. [2021-10-28 09:04:04,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:04:04,572 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 09:04:04,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:04,580 INFO L225 Difference]: With dead ends: 1014 [2021-10-28 09:04:04,580 INFO L226 Difference]: Without dead ends: 1009 [2021-10-28 09:04:04,581 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 09:04:04,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2021-10-28 09:04:04,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1006. [2021-10-28 09:04:04,668 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 09:04:04,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1404 transitions. [2021-10-28 09:04:04,676 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1404 transitions. Word has length 31 [2021-10-28 09:04:04,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:04,677 INFO L470 AbstractCegarLoop]: Abstraction has 1006 states and 1404 transitions. [2021-10-28 09:04:04,677 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 09:04:04,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1404 transitions. [2021-10-28 09:04:04,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-28 09:04:04,690 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:04,691 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 09:04:04,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-28 09:04:04,691 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 09:04:04,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:04,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1557214583, now seen corresponding path program 1 times [2021-10-28 09:04:04,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:04,693 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37444527] [2021-10-28 09:04:04,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:04,693 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:04,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:04:04,756 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:04,756 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37444527] [2021-10-28 09:04:04,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37444527] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:04,757 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:04,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:04:04,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767737451] [2021-10-28 09:04:04,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:04:04,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:04,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:04:04,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:04:04,759 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 09:04:04,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:04,909 INFO L93 Difference]: Finished difference Result 1237 states and 1712 transitions. [2021-10-28 09:04:04,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:04:04,910 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 09:04:04,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:04,919 INFO L225 Difference]: With dead ends: 1237 [2021-10-28 09:04:04,920 INFO L226 Difference]: Without dead ends: 1099 [2021-10-28 09:04:04,922 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 09:04:04,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2021-10-28 09:04:05,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 994. [2021-10-28 09:04:05,009 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 09:04:05,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1386 transitions. [2021-10-28 09:04:05,014 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1386 transitions. Word has length 31 [2021-10-28 09:04:05,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:05,014 INFO L470 AbstractCegarLoop]: Abstraction has 994 states and 1386 transitions. [2021-10-28 09:04:05,015 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 09:04:05,015 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1386 transitions. [2021-10-28 09:04:05,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-28 09:04:05,018 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:05,018 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 09:04:05,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-28 09:04:05,019 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 09:04:05,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:05,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1095917288, now seen corresponding path program 1 times [2021-10-28 09:04:05,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:05,020 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594004236] [2021-10-28 09:04:05,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:05,021 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:05,064 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 09:04:05,064 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:05,065 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594004236] [2021-10-28 09:04:05,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594004236] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:05,065 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:05,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:04:05,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527980356] [2021-10-28 09:04:05,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:04:05,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:05,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:04:05,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:04:05,068 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 09:04:05,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:05,396 INFO L93 Difference]: Finished difference Result 1060 states and 1453 transitions. [2021-10-28 09:04:05,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:04:05,397 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 09:04:05,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:05,405 INFO L225 Difference]: With dead ends: 1060 [2021-10-28 09:04:05,405 INFO L226 Difference]: Without dead ends: 1046 [2021-10-28 09:04:05,406 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 09:04:05,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2021-10-28 09:04:05,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1034. [2021-10-28 09:04:05,525 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 09:04:05,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1427 transitions. [2021-10-28 09:04:05,530 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1427 transitions. Word has length 31 [2021-10-28 09:04:05,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:05,530 INFO L470 AbstractCegarLoop]: Abstraction has 1034 states and 1427 transitions. [2021-10-28 09:04:05,530 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 09:04:05,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1427 transitions. [2021-10-28 09:04:05,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-28 09:04:05,534 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:05,534 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 09:04:05,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-28 09:04:05,535 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 09:04:05,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:05,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1102324248, now seen corresponding path program 1 times [2021-10-28 09:04:05,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:05,536 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861725696] [2021-10-28 09:04:05,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:05,537 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:05,578 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 09:04:05,578 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:05,579 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861725696] [2021-10-28 09:04:05,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861725696] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:05,579 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:05,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:04:05,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837027862] [2021-10-28 09:04:05,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:04:05,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:05,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:04:05,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:04:05,582 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 09:04:05,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:05,716 INFO L93 Difference]: Finished difference Result 1101 states and 1500 transitions. [2021-10-28 09:04:05,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:04:05,717 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 09:04:05,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:05,725 INFO L225 Difference]: With dead ends: 1101 [2021-10-28 09:04:05,725 INFO L226 Difference]: Without dead ends: 1078 [2021-10-28 09:04:05,726 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 09:04:05,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2021-10-28 09:04:05,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 1037. [2021-10-28 09:04:05,822 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 09:04:05,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1431 transitions. [2021-10-28 09:04:05,827 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1431 transitions. Word has length 31 [2021-10-28 09:04:05,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:05,827 INFO L470 AbstractCegarLoop]: Abstraction has 1037 states and 1431 transitions. [2021-10-28 09:04:05,828 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 09:04:05,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1431 transitions. [2021-10-28 09:04:05,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-28 09:04:05,831 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:05,831 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 09:04:05,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-28 09:04:05,832 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 09:04:05,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:05,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1689130262, now seen corresponding path program 1 times [2021-10-28 09:04:05,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:05,833 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743728264] [2021-10-28 09:04:05,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:05,834 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:05,886 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 09:04:05,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:05,887 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743728264] [2021-10-28 09:04:05,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743728264] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:05,887 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:05,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:04:05,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40931756] [2021-10-28 09:04:05,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:04:05,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:05,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:04:05,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:04:05,890 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 09:04:06,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:06,275 INFO L93 Difference]: Finished difference Result 1060 states and 1456 transitions. [2021-10-28 09:04:06,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:04:06,276 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 09:04:06,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:06,283 INFO L225 Difference]: With dead ends: 1060 [2021-10-28 09:04:06,284 INFO L226 Difference]: Without dead ends: 996 [2021-10-28 09:04:06,285 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 09:04:06,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2021-10-28 09:04:06,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 994. [2021-10-28 09:04:06,377 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 09:04:06,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1369 transitions. [2021-10-28 09:04:06,381 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1369 transitions. Word has length 31 [2021-10-28 09:04:06,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:06,381 INFO L470 AbstractCegarLoop]: Abstraction has 994 states and 1369 transitions. [2021-10-28 09:04:06,382 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 09:04:06,382 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1369 transitions. [2021-10-28 09:04:06,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-28 09:04:06,385 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:06,385 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 09:04:06,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-28 09:04:06,386 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 09:04:06,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:06,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1100290421, now seen corresponding path program 1 times [2021-10-28 09:04:06,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:06,387 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085221018] [2021-10-28 09:04:06,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:06,388 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:06,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:06,511 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 09:04:06,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:06,512 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085221018] [2021-10-28 09:04:06,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085221018] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:06,512 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:06,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:04:06,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264573767] [2021-10-28 09:04:06,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:04:06,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:06,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:04:06,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:04:06,519 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 09:04:06,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:06,890 INFO L93 Difference]: Finished difference Result 1002 states and 1375 transitions. [2021-10-28 09:04:06,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:04:06,891 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 09:04:06,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:06,899 INFO L225 Difference]: With dead ends: 1002 [2021-10-28 09:04:06,899 INFO L226 Difference]: Without dead ends: 997 [2021-10-28 09:04:06,900 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 09:04:06,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2021-10-28 09:04:07,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 994. [2021-10-28 09:04:07,004 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 09:04:07,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1368 transitions. [2021-10-28 09:04:07,008 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1368 transitions. Word has length 32 [2021-10-28 09:04:07,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:07,009 INFO L470 AbstractCegarLoop]: Abstraction has 994 states and 1368 transitions. [2021-10-28 09:04:07,009 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 09:04:07,009 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1368 transitions. [2021-10-28 09:04:07,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-28 09:04:07,012 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:07,013 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 09:04:07,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-28 09:04:07,013 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 09:04:07,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:07,014 INFO L85 PathProgramCache]: Analyzing trace with hash 635619136, now seen corresponding path program 1 times [2021-10-28 09:04:07,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:07,014 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667899576] [2021-10-28 09:04:07,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:07,015 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:07,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:04:07,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:07,067 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667899576] [2021-10-28 09:04:07,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667899576] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:07,067 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:07,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:04:07,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172802831] [2021-10-28 09:04:07,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:04:07,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:07,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:04:07,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:04:07,071 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 09:04:07,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:07,172 INFO L93 Difference]: Finished difference Result 1095 states and 1504 transitions. [2021-10-28 09:04:07,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:04:07,173 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 09:04:07,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:07,180 INFO L225 Difference]: With dead ends: 1095 [2021-10-28 09:04:07,180 INFO L226 Difference]: Without dead ends: 978 [2021-10-28 09:04:07,182 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 09:04:07,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2021-10-28 09:04:07,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 978. [2021-10-28 09:04:07,267 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 09:04:07,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1339 transitions. [2021-10-28 09:04:07,272 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1339 transitions. Word has length 32 [2021-10-28 09:04:07,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:07,273 INFO L470 AbstractCegarLoop]: Abstraction has 978 states and 1339 transitions. [2021-10-28 09:04:07,273 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 09:04:07,273 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1339 transitions. [2021-10-28 09:04:07,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-28 09:04:07,277 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:07,277 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 09:04:07,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-28 09:04:07,277 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 09:04:07,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:07,278 INFO L85 PathProgramCache]: Analyzing trace with hash -369077776, now seen corresponding path program 1 times [2021-10-28 09:04:07,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:07,279 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758127993] [2021-10-28 09:04:07,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:07,279 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:07,337 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 09:04:07,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:07,338 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758127993] [2021-10-28 09:04:07,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758127993] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:07,338 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:07,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 09:04:07,339 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053222612] [2021-10-28 09:04:07,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:04:07,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:07,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:04:07,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:04:07,340 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 09:04:07,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:07,551 INFO L93 Difference]: Finished difference Result 992 states and 1353 transitions. [2021-10-28 09:04:07,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 09:04:07,551 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 09:04:07,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:07,559 INFO L225 Difference]: With dead ends: 992 [2021-10-28 09:04:07,559 INFO L226 Difference]: Without dead ends: 989 [2021-10-28 09:04:07,560 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 09:04:07,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2021-10-28 09:04:07,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 984. [2021-10-28 09:04:07,676 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 09:04:07,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1346 transitions. [2021-10-28 09:04:07,681 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1346 transitions. Word has length 32 [2021-10-28 09:04:07,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:07,682 INFO L470 AbstractCegarLoop]: Abstraction has 984 states and 1346 transitions. [2021-10-28 09:04:07,682 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 09:04:07,682 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1346 transitions. [2021-10-28 09:04:07,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-28 09:04:07,686 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:07,686 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 09:04:07,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-28 09:04:07,686 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 09:04:07,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:07,687 INFO L85 PathProgramCache]: Analyzing trace with hash -369089692, now seen corresponding path program 1 times [2021-10-28 09:04:07,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:07,688 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408078090] [2021-10-28 09:04:07,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:07,688 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:07,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:07,748 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 09:04:07,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:07,748 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408078090] [2021-10-28 09:04:07,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408078090] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:07,749 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:07,749 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 09:04:07,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249060383] [2021-10-28 09:04:07,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:04:07,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:07,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:04:07,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:04:07,753 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 09:04:07,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:07,912 INFO L93 Difference]: Finished difference Result 1001 states and 1363 transitions. [2021-10-28 09:04:07,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 09:04:07,913 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 09:04:07,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:07,921 INFO L225 Difference]: With dead ends: 1001 [2021-10-28 09:04:07,921 INFO L226 Difference]: Without dead ends: 983 [2021-10-28 09:04:07,922 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 09:04:07,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2021-10-28 09:04:08,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 983. [2021-10-28 09:04:08,008 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 09:04:08,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1344 transitions. [2021-10-28 09:04:08,012 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1344 transitions. Word has length 32 [2021-10-28 09:04:08,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:08,013 INFO L470 AbstractCegarLoop]: Abstraction has 983 states and 1344 transitions. [2021-10-28 09:04:08,013 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 09:04:08,014 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1344 transitions. [2021-10-28 09:04:08,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-28 09:04:08,017 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:08,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] [2021-10-28 09:04:08,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-28 09:04:08,017 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 09:04:08,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:08,018 INFO L85 PathProgramCache]: Analyzing trace with hash -603608195, now seen corresponding path program 1 times [2021-10-28 09:04:08,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:08,019 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428947700] [2021-10-28 09:04:08,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:08,019 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:08,112 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 09:04:08,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:08,113 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428947700] [2021-10-28 09:04:08,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428947700] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:08,113 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:08,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 09:04:08,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265698845] [2021-10-28 09:04:08,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 09:04:08,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:08,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 09:04:08,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-28 09:04:08,116 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 09:04:08,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:08,406 INFO L93 Difference]: Finished difference Result 1004 states and 1366 transitions. [2021-10-28 09:04:08,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 09:04:08,407 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 09:04:08,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:08,413 INFO L225 Difference]: With dead ends: 1004 [2021-10-28 09:04:08,413 INFO L226 Difference]: Without dead ends: 974 [2021-10-28 09:04:08,415 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 09:04:08,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2021-10-28 09:04:08,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2021-10-28 09:04:08,512 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 09:04:08,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1322 transitions. [2021-10-28 09:04:08,523 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1322 transitions. Word has length 33 [2021-10-28 09:04:08,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:08,529 INFO L470 AbstractCegarLoop]: Abstraction has 974 states and 1322 transitions. [2021-10-28 09:04:08,530 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 09:04:08,530 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1322 transitions. [2021-10-28 09:04:08,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-28 09:04:08,534 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:08,534 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 09:04:08,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-28 09:04:08,534 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 09:04:08,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:08,535 INFO L85 PathProgramCache]: Analyzing trace with hash -691762275, now seen corresponding path program 1 times [2021-10-28 09:04:08,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:08,536 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474266559] [2021-10-28 09:04:08,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:08,536 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:08,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:08,675 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 09:04:08,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:08,676 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474266559] [2021-10-28 09:04:08,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474266559] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:08,676 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:08,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 09:04:08,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653637986] [2021-10-28 09:04:08,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 09:04:08,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:08,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 09:04:08,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-28 09:04:08,679 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 09:04:09,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:09,244 INFO L93 Difference]: Finished difference Result 1009 states and 1356 transitions. [2021-10-28 09:04:09,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 09:04:09,245 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 09:04:09,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:09,252 INFO L225 Difference]: With dead ends: 1009 [2021-10-28 09:04:09,252 INFO L226 Difference]: Without dead ends: 1006 [2021-10-28 09:04:09,253 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 09:04:09,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2021-10-28 09:04:09,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 974. [2021-10-28 09:04:09,348 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 09:04:09,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1322 transitions. [2021-10-28 09:04:09,353 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1322 transitions. Word has length 33 [2021-10-28 09:04:09,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:09,353 INFO L470 AbstractCegarLoop]: Abstraction has 974 states and 1322 transitions. [2021-10-28 09:04:09,353 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 09:04:09,354 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1322 transitions. [2021-10-28 09:04:09,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-28 09:04:09,357 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:09,357 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 09:04:09,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-28 09:04:09,358 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 09:04:09,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:09,359 INFO L85 PathProgramCache]: Analyzing trace with hash -691774191, now seen corresponding path program 1 times [2021-10-28 09:04:09,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:09,359 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440480192] [2021-10-28 09:04:09,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:09,360 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:09,416 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 09:04:09,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:09,416 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440480192] [2021-10-28 09:04:09,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440480192] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:09,417 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:09,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:04:09,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291265792] [2021-10-28 09:04:09,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:04:09,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:09,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:04:09,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:04:09,419 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 09:04:09,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:09,772 INFO L93 Difference]: Finished difference Result 985 states and 1333 transitions. [2021-10-28 09:04:09,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:04:09,773 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 09:04:09,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:09,792 INFO L225 Difference]: With dead ends: 985 [2021-10-28 09:04:09,792 INFO L226 Difference]: Without dead ends: 926 [2021-10-28 09:04:09,793 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 09:04:09,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2021-10-28 09:04:09,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 923. [2021-10-28 09:04:09,891 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 09:04:09,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1261 transitions. [2021-10-28 09:04:09,896 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1261 transitions. Word has length 33 [2021-10-28 09:04:09,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:09,896 INFO L470 AbstractCegarLoop]: Abstraction has 923 states and 1261 transitions. [2021-10-28 09:04:09,896 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 09:04:09,897 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1261 transitions. [2021-10-28 09:04:09,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-28 09:04:09,900 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:09,900 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 09:04:09,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-28 09:04:09,902 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 09:04:09,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:09,902 INFO L85 PathProgramCache]: Analyzing trace with hash -2061346662, now seen corresponding path program 1 times [2021-10-28 09:04:09,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:09,903 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888803998] [2021-10-28 09:04:09,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:09,904 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:09,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:10,086 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 09:04:10,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:10,087 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888803998] [2021-10-28 09:04:10,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888803998] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:10,088 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:10,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-28 09:04:10,088 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709012649] [2021-10-28 09:04:10,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 09:04:10,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:10,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 09:04:10,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-28 09:04:10,090 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 09:04:10,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:10,458 INFO L93 Difference]: Finished difference Result 945 states and 1284 transitions. [2021-10-28 09:04:10,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 09:04:10,459 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 09:04:10,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:10,464 INFO L225 Difference]: With dead ends: 945 [2021-10-28 09:04:10,464 INFO L226 Difference]: Without dead ends: 917 [2021-10-28 09:04:10,465 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 09:04:10,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2021-10-28 09:04:10,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 917. [2021-10-28 09:04:10,581 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 09:04:10,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1243 transitions. [2021-10-28 09:04:10,585 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1243 transitions. Word has length 34 [2021-10-28 09:04:10,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:10,586 INFO L470 AbstractCegarLoop]: Abstraction has 917 states and 1243 transitions. [2021-10-28 09:04:10,586 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 09:04:10,586 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1243 transitions. [2021-10-28 09:04:10,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-28 09:04:10,590 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:10,590 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 09:04:10,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-28 09:04:10,591 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 09:04:10,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:10,591 INFO L85 PathProgramCache]: Analyzing trace with hash -842658898, now seen corresponding path program 1 times [2021-10-28 09:04:10,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:10,592 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793300945] [2021-10-28 09:04:10,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:10,592 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:10,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:10,626 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 09:04:10,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:10,627 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793300945] [2021-10-28 09:04:10,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793300945] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:10,627 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:10,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:04:10,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916147964] [2021-10-28 09:04:10,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:04:10,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:10,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:04:10,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:04:10,630 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 09:04:10,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:10,814 INFO L93 Difference]: Finished difference Result 1290 states and 1738 transitions. [2021-10-28 09:04:10,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:04:10,815 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 09:04:10,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:10,819 INFO L225 Difference]: With dead ends: 1290 [2021-10-28 09:04:10,819 INFO L226 Difference]: Without dead ends: 1114 [2021-10-28 09:04:10,820 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 09:04:10,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2021-10-28 09:04:10,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 917. [2021-10-28 09:04:10,909 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 09:04:10,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1233 transitions. [2021-10-28 09:04:10,913 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1233 transitions. Word has length 34 [2021-10-28 09:04:10,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:10,914 INFO L470 AbstractCegarLoop]: Abstraction has 917 states and 1233 transitions. [2021-10-28 09:04:10,914 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 09:04:10,914 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1233 transitions. [2021-10-28 09:04:10,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-28 09:04:10,917 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:10,917 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 09:04:10,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-28 09:04:10,918 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 09:04:10,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:10,919 INFO L85 PathProgramCache]: Analyzing trace with hash -419957072, now seen corresponding path program 1 times [2021-10-28 09:04:10,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:10,919 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657058163] [2021-10-28 09:04:10,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:10,920 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:10,985 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 09:04:10,985 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:10,985 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657058163] [2021-10-28 09:04:10,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657058163] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:10,986 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:10,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 09:04:10,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583893650] [2021-10-28 09:04:10,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 09:04:10,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:10,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 09:04:10,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-28 09:04:10,988 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 09:04:11,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:11,157 INFO L93 Difference]: Finished difference Result 933 states and 1249 transitions. [2021-10-28 09:04:11,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 09:04:11,157 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 09:04:11,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:11,159 INFO L225 Difference]: With dead ends: 933 [2021-10-28 09:04:11,160 INFO L226 Difference]: Without dead ends: 915 [2021-10-28 09:04:11,160 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 09:04:11,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2021-10-28 09:04:11,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 915. [2021-10-28 09:04:11,251 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 09:04:11,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1230 transitions. [2021-10-28 09:04:11,255 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1230 transitions. Word has length 34 [2021-10-28 09:04:11,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:11,255 INFO L470 AbstractCegarLoop]: Abstraction has 915 states and 1230 transitions. [2021-10-28 09:04:11,256 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 09:04:11,256 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1230 transitions. [2021-10-28 09:04:11,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-28 09:04:11,259 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:11,260 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 09:04:11,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-28 09:04:11,260 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 09:04:11,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:11,261 INFO L85 PathProgramCache]: Analyzing trace with hash 732400922, now seen corresponding path program 1 times [2021-10-28 09:04:11,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:11,261 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539158859] [2021-10-28 09:04:11,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:11,262 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:11,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:11,292 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 09:04:11,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:11,293 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539158859] [2021-10-28 09:04:11,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539158859] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:11,293 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:11,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:04:11,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257396913] [2021-10-28 09:04:11,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:04:11,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:11,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:04:11,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:04:11,296 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 09:04:11,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:11,438 INFO L93 Difference]: Finished difference Result 967 states and 1286 transitions. [2021-10-28 09:04:11,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:04:11,439 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 09:04:11,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:11,442 INFO L225 Difference]: With dead ends: 967 [2021-10-28 09:04:11,442 INFO L226 Difference]: Without dead ends: 933 [2021-10-28 09:04:11,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 09:04:11,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2021-10-28 09:04:11,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 915. [2021-10-28 09:04:11,564 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 09:04:11,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1229 transitions. [2021-10-28 09:04:11,569 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1229 transitions. Word has length 34 [2021-10-28 09:04:11,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:11,569 INFO L470 AbstractCegarLoop]: Abstraction has 915 states and 1229 transitions. [2021-10-28 09:04:11,570 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 09:04:11,570 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1229 transitions. [2021-10-28 09:04:11,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-28 09:04:11,574 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:11,574 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 09:04:11,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-28 09:04:11,575 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 09:04:11,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:11,575 INFO L85 PathProgramCache]: Analyzing trace with hash 908827288, now seen corresponding path program 1 times [2021-10-28 09:04:11,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:11,576 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510027335] [2021-10-28 09:04:11,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:11,576 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:11,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:11,619 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 09:04:11,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:11,620 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510027335] [2021-10-28 09:04:11,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510027335] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:11,620 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:11,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:04:11,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41004910] [2021-10-28 09:04:11,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:04:11,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:11,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:04:11,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:04:11,623 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 09:04:11,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:11,880 INFO L93 Difference]: Finished difference Result 1074 states and 1434 transitions. [2021-10-28 09:04:11,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:04:11,881 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 09:04:11,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:11,884 INFO L225 Difference]: With dead ends: 1074 [2021-10-28 09:04:11,884 INFO L226 Difference]: Without dead ends: 1053 [2021-10-28 09:04:11,885 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 09:04:11,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2021-10-28 09:04:11,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 915. [2021-10-28 09:04:11,977 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 09:04:11,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1228 transitions. [2021-10-28 09:04:11,980 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1228 transitions. Word has length 35 [2021-10-28 09:04:11,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:11,981 INFO L470 AbstractCegarLoop]: Abstraction has 915 states and 1228 transitions. [2021-10-28 09:04:11,981 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 09:04:11,981 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1228 transitions. [2021-10-28 09:04:11,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-28 09:04:11,984 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:11,985 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 09:04:11,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-28 09:04:11,985 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 09:04:11,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:11,986 INFO L85 PathProgramCache]: Analyzing trace with hash 479003308, now seen corresponding path program 1 times [2021-10-28 09:04:11,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:11,987 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635184007] [2021-10-28 09:04:11,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:11,987 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:12,081 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 09:04:12,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:12,082 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635184007] [2021-10-28 09:04:12,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635184007] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:12,082 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:12,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 09:04:12,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113544351] [2021-10-28 09:04:12,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 09:04:12,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:12,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 09:04:12,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-28 09:04:12,084 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 09:04:12,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:12,545 INFO L93 Difference]: Finished difference Result 946 states and 1258 transitions. [2021-10-28 09:04:12,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-28 09:04:12,545 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 09:04:12,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:12,547 INFO L225 Difference]: With dead ends: 946 [2021-10-28 09:04:12,547 INFO L226 Difference]: Without dead ends: 917 [2021-10-28 09:04:12,548 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-10-28 09:04:12,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2021-10-28 09:04:12,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 899. [2021-10-28 09:04:12,614 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 09:04:12,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1208 transitions. [2021-10-28 09:04:12,616 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1208 transitions. Word has length 35 [2021-10-28 09:04:12,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:12,617 INFO L470 AbstractCegarLoop]: Abstraction has 899 states and 1208 transitions. [2021-10-28 09:04:12,617 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 09:04:12,617 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1208 transitions. [2021-10-28 09:04:12,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-28 09:04:12,620 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:12,621 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 09:04:12,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-28 09:04:12,621 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 09:04:12,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:12,622 INFO L85 PathProgramCache]: Analyzing trace with hash 290487121, now seen corresponding path program 1 times [2021-10-28 09:04:12,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:12,622 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222257305] [2021-10-28 09:04:12,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:12,623 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:12,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:12,718 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 09:04:12,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:12,718 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222257305] [2021-10-28 09:04:12,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222257305] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:12,719 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:12,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 09:04:12,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164006405] [2021-10-28 09:04:12,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 09:04:12,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:12,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 09:04:12,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-28 09:04:12,722 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 09:04:12,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:12,989 INFO L93 Difference]: Finished difference Result 915 states and 1224 transitions. [2021-10-28 09:04:12,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-28 09:04:12,990 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 09:04:12,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:12,993 INFO L225 Difference]: With dead ends: 915 [2021-10-28 09:04:12,993 INFO L226 Difference]: Without dead ends: 884 [2021-10-28 09:04:12,994 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 09:04:12,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2021-10-28 09:04:13,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 884. [2021-10-28 09:04:13,070 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 09:04:13,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1187 transitions. [2021-10-28 09:04:13,073 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1187 transitions. Word has length 36 [2021-10-28 09:04:13,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:13,073 INFO L470 AbstractCegarLoop]: Abstraction has 884 states and 1187 transitions. [2021-10-28 09:04:13,074 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 09:04:13,074 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1187 transitions. [2021-10-28 09:04:13,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-28 09:04:13,076 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:13,077 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 09:04:13,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-28 09:04:13,077 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 09:04:13,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:13,078 INFO L85 PathProgramCache]: Analyzing trace with hash 2146304349, now seen corresponding path program 1 times [2021-10-28 09:04:13,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:13,078 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324101361] [2021-10-28 09:04:13,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:13,079 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:13,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:04:13,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:13,151 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324101361] [2021-10-28 09:04:13,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324101361] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:13,151 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:13,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 09:04:13,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87651801] [2021-10-28 09:04:13,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 09:04:13,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:13,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 09:04:13,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-28 09:04:13,154 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 09:04:13,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:13,400 INFO L93 Difference]: Finished difference Result 900 states and 1203 transitions. [2021-10-28 09:04:13,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 09:04:13,400 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 09:04:13,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:13,403 INFO L225 Difference]: With dead ends: 900 [2021-10-28 09:04:13,403 INFO L226 Difference]: Without dead ends: 872 [2021-10-28 09:04:13,406 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 09:04:13,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2021-10-28 09:04:13,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2021-10-28 09:04:13,490 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 09:04:13,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1169 transitions. [2021-10-28 09:04:13,493 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1169 transitions. Word has length 36 [2021-10-28 09:04:13,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:13,494 INFO L470 AbstractCegarLoop]: Abstraction has 872 states and 1169 transitions. [2021-10-28 09:04:13,494 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 09:04:13,494 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1169 transitions. [2021-10-28 09:04:13,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-28 09:04:13,497 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:13,497 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 09:04:13,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-28 09:04:13,497 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 09:04:13,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:13,498 INFO L85 PathProgramCache]: Analyzing trace with hash -700544509, now seen corresponding path program 1 times [2021-10-28 09:04:13,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:13,499 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72953675] [2021-10-28 09:04:13,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:13,499 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:13,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:04:13,663 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:13,664 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72953675] [2021-10-28 09:04:13,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72953675] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:13,664 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:13,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-28 09:04:13,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870794003] [2021-10-28 09:04:13,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 09:04:13,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:13,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 09:04:13,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-28 09:04:13,667 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 09:04:14,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:14,245 INFO L93 Difference]: Finished difference Result 903 states and 1199 transitions. [2021-10-28 09:04:14,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 09:04:14,245 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 09:04:14,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:14,248 INFO L225 Difference]: With dead ends: 903 [2021-10-28 09:04:14,248 INFO L226 Difference]: Without dead ends: 874 [2021-10-28 09:04:14,249 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2021-10-28 09:04:14,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2021-10-28 09:04:14,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 856. [2021-10-28 09:04:14,349 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 09:04:14,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1149 transitions. [2021-10-28 09:04:14,352 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1149 transitions. Word has length 36 [2021-10-28 09:04:14,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:14,353 INFO L470 AbstractCegarLoop]: Abstraction has 856 states and 1149 transitions. [2021-10-28 09:04:14,353 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 09:04:14,353 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1149 transitions. [2021-10-28 09:04:14,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-28 09:04:14,356 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:14,356 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 09:04:14,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-28 09:04:14,357 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 09:04:14,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:14,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1075516100, now seen corresponding path program 1 times [2021-10-28 09:04:14,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:14,358 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552409735] [2021-10-28 09:04:14,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:14,358 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:14,395 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 09:04:14,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:14,396 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552409735] [2021-10-28 09:04:14,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552409735] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:14,396 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:14,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:04:14,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720294298] [2021-10-28 09:04:14,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:04:14,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:14,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:04:14,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:04:14,399 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 09:04:14,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:14,541 INFO L93 Difference]: Finished difference Result 1052 states and 1409 transitions. [2021-10-28 09:04:14,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:04:14,542 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 09:04:14,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:14,544 INFO L225 Difference]: With dead ends: 1052 [2021-10-28 09:04:14,545 INFO L226 Difference]: Without dead ends: 716 [2021-10-28 09:04:14,550 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 09:04:14,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2021-10-28 09:04:14,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 666. [2021-10-28 09:04:14,621 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 09:04:14,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 887 transitions. [2021-10-28 09:04:14,623 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 887 transitions. Word has length 37 [2021-10-28 09:04:14,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:14,624 INFO L470 AbstractCegarLoop]: Abstraction has 666 states and 887 transitions. [2021-10-28 09:04:14,624 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 09:04:14,624 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 887 transitions. [2021-10-28 09:04:14,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-28 09:04:14,626 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:14,626 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 09:04:14,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-28 09:04:14,627 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 09:04:14,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:14,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1405976500, now seen corresponding path program 1 times [2021-10-28 09:04:14,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:14,628 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171829017] [2021-10-28 09:04:14,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:14,629 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:14,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:14,798 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 09:04:14,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:14,799 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171829017] [2021-10-28 09:04:14,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171829017] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:14,799 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:14,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-28 09:04:14,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204372550] [2021-10-28 09:04:14,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 09:04:14,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:14,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 09:04:14,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-28 09:04:14,801 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 09:04:15,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:15,471 INFO L93 Difference]: Finished difference Result 700 states and 920 transitions. [2021-10-28 09:04:15,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-28 09:04:15,472 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 09:04:15,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:15,475 INFO L225 Difference]: With dead ends: 700 [2021-10-28 09:04:15,475 INFO L226 Difference]: Without dead ends: 668 [2021-10-28 09:04:15,476 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2021-10-28 09:04:15,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2021-10-28 09:04:15,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 647. [2021-10-28 09:04:15,543 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 09:04:15,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 860 transitions. [2021-10-28 09:04:15,545 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 860 transitions. Word has length 37 [2021-10-28 09:04:15,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:15,546 INFO L470 AbstractCegarLoop]: Abstraction has 647 states and 860 transitions. [2021-10-28 09:04:15,546 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 09:04:15,546 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 860 transitions. [2021-10-28 09:04:15,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-28 09:04:15,548 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:15,549 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 09:04:15,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-28 09:04:15,549 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 09:04:15,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:15,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1404147991, now seen corresponding path program 1 times [2021-10-28 09:04:15,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:15,551 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385879446] [2021-10-28 09:04:15,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:15,551 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:15,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:15,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:04:15,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:15,621 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385879446] [2021-10-28 09:04:15,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385879446] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:15,621 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:15,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 09:04:15,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791712196] [2021-10-28 09:04:15,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 09:04:15,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:15,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 09:04:15,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-28 09:04:15,624 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 09:04:15,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:15,834 INFO L93 Difference]: Finished difference Result 672 states and 889 transitions. [2021-10-28 09:04:15,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 09:04:15,839 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 09:04:15,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:15,841 INFO L225 Difference]: With dead ends: 672 [2021-10-28 09:04:15,842 INFO L226 Difference]: Without dead ends: 639 [2021-10-28 09:04:15,842 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 09:04:15,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2021-10-28 09:04:15,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2021-10-28 09:04:15,902 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 09:04:15,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 846 transitions. [2021-10-28 09:04:15,904 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 846 transitions. Word has length 38 [2021-10-28 09:04:15,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:15,904 INFO L470 AbstractCegarLoop]: Abstraction has 639 states and 846 transitions. [2021-10-28 09:04:15,904 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 09:04:15,904 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 846 transitions. [2021-10-28 09:04:15,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-28 09:04:15,911 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:15,911 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 09:04:15,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-28 09:04:15,912 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 09:04:15,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:15,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1025315248, now seen corresponding path program 1 times [2021-10-28 09:04:15,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:15,913 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576588782] [2021-10-28 09:04:15,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:15,913 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:15,949 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 09:04:15,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:15,949 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576588782] [2021-10-28 09:04:15,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576588782] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:15,950 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:15,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:04:15,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802959801] [2021-10-28 09:04:15,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:04:15,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:15,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:04:15,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:04:15,954 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 09:04:16,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:16,036 INFO L93 Difference]: Finished difference Result 691 states and 908 transitions. [2021-10-28 09:04:16,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:04:16,036 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 09:04:16,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:16,038 INFO L225 Difference]: With dead ends: 691 [2021-10-28 09:04:16,039 INFO L226 Difference]: Without dead ends: 649 [2021-10-28 09:04:16,039 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 09:04:16,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2021-10-28 09:04:16,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 636. [2021-10-28 09:04:16,105 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 09:04:16,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 841 transitions. [2021-10-28 09:04:16,107 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 841 transitions. Word has length 38 [2021-10-28 09:04:16,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:16,108 INFO L470 AbstractCegarLoop]: Abstraction has 636 states and 841 transitions. [2021-10-28 09:04:16,108 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 09:04:16,108 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 841 transitions. [2021-10-28 09:04:16,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-28 09:04:16,110 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:16,111 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 09:04:16,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-28 09:04:16,111 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 09:04:16,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:16,112 INFO L85 PathProgramCache]: Analyzing trace with hash -2131208369, now seen corresponding path program 1 times [2021-10-28 09:04:16,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:16,112 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467013756] [2021-10-28 09:04:16,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:16,113 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:16,158 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 09:04:16,158 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:16,158 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467013756] [2021-10-28 09:04:16,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467013756] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:16,159 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:16,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:04:16,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682592143] [2021-10-28 09:04:16,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:04:16,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:16,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:04:16,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:04:16,163 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 09:04:16,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:16,367 INFO L93 Difference]: Finished difference Result 730 states and 951 transitions. [2021-10-28 09:04:16,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 09:04:16,367 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 09:04:16,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:16,370 INFO L225 Difference]: With dead ends: 730 [2021-10-28 09:04:16,370 INFO L226 Difference]: Without dead ends: 688 [2021-10-28 09:04:16,371 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 09:04:16,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2021-10-28 09:04:16,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 626. [2021-10-28 09:04:16,430 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 09:04:16,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 822 transitions. [2021-10-28 09:04:16,432 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 822 transitions. Word has length 39 [2021-10-28 09:04:16,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:16,433 INFO L470 AbstractCegarLoop]: Abstraction has 626 states and 822 transitions. [2021-10-28 09:04:16,433 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 09:04:16,433 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 822 transitions. [2021-10-28 09:04:16,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-28 09:04:16,435 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:16,435 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 09:04:16,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-10-28 09:04:16,436 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 09:04:16,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:16,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1912353651, now seen corresponding path program 1 times [2021-10-28 09:04:16,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:16,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172095517] [2021-10-28 09:04:16,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:16,437 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:16,488 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 09:04:16,489 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:16,489 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172095517] [2021-10-28 09:04:16,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172095517] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:16,489 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:16,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 09:04:16,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164139538] [2021-10-28 09:04:16,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 09:04:16,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:16,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 09:04:16,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:04:16,491 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 09:04:16,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:16,628 INFO L93 Difference]: Finished difference Result 713 states and 913 transitions. [2021-10-28 09:04:16,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 09:04:16,629 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 09:04:16,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:16,631 INFO L225 Difference]: With dead ends: 713 [2021-10-28 09:04:16,631 INFO L226 Difference]: Without dead ends: 693 [2021-10-28 09:04:16,632 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 09:04:16,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2021-10-28 09:04:16,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 633. [2021-10-28 09:04:16,701 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 09:04:16,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 829 transitions. [2021-10-28 09:04:16,703 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 829 transitions. Word has length 39 [2021-10-28 09:04:16,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:16,703 INFO L470 AbstractCegarLoop]: Abstraction has 633 states and 829 transitions. [2021-10-28 09:04:16,703 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 09:04:16,703 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 829 transitions. [2021-10-28 09:04:16,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-28 09:04:16,705 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:16,705 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 09:04:16,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-10-28 09:04:16,706 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 09:04:16,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:16,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1059382494, now seen corresponding path program 1 times [2021-10-28 09:04:16,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:16,707 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84430046] [2021-10-28 09:04:16,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:16,708 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:16,909 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 09:04:16,910 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:16,910 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84430046] [2021-10-28 09:04:16,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84430046] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:16,910 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:16,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 09:04:16,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685328901] [2021-10-28 09:04:16,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 09:04:16,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:16,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 09:04:16,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:04:16,912 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 09:04:17,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:17,108 INFO L93 Difference]: Finished difference Result 766 states and 1000 transitions. [2021-10-28 09:04:17,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 09:04:17,109 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 09:04:17,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:17,111 INFO L225 Difference]: With dead ends: 766 [2021-10-28 09:04:17,111 INFO L226 Difference]: Without dead ends: 632 [2021-10-28 09:04:17,112 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 09:04:17,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2021-10-28 09:04:17,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 619. [2021-10-28 09:04:17,195 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 09:04:17,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 807 transitions. [2021-10-28 09:04:17,197 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 807 transitions. Word has length 39 [2021-10-28 09:04:17,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:17,197 INFO L470 AbstractCegarLoop]: Abstraction has 619 states and 807 transitions. [2021-10-28 09:04:17,197 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 09:04:17,198 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 807 transitions. [2021-10-28 09:04:17,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-28 09:04:17,199 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:17,200 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 09:04:17,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-10-28 09:04:17,200 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 09:04:17,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:17,201 INFO L85 PathProgramCache]: Analyzing trace with hash -494516766, now seen corresponding path program 1 times [2021-10-28 09:04:17,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:17,201 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600113996] [2021-10-28 09:04:17,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:17,202 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:17,302 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 09:04:17,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:17,303 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600113996] [2021-10-28 09:04:17,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600113996] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:17,303 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:17,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 09:04:17,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205910570] [2021-10-28 09:04:17,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 09:04:17,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:17,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 09:04:17,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-28 09:04:17,305 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 09:04:17,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:17,537 INFO L93 Difference]: Finished difference Result 640 states and 829 transitions. [2021-10-28 09:04:17,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 09:04:17,538 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 09:04:17,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:17,540 INFO L225 Difference]: With dead ends: 640 [2021-10-28 09:04:17,540 INFO L226 Difference]: Without dead ends: 532 [2021-10-28 09:04:17,541 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 09:04:17,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-10-28 09:04:17,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2021-10-28 09:04:17,623 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 09:04:17,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 694 transitions. [2021-10-28 09:04:17,625 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 694 transitions. Word has length 40 [2021-10-28 09:04:17,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:17,625 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 694 transitions. [2021-10-28 09:04:17,625 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 09:04:17,626 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 694 transitions. [2021-10-28 09:04:17,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-28 09:04:17,627 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:17,628 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 09:04:17,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-10-28 09:04:17,628 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 09:04:17,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:17,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1734827187, now seen corresponding path program 1 times [2021-10-28 09:04:17,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:17,629 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110540017] [2021-10-28 09:04:17,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:17,630 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:17,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 09:04:17,688 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:17,689 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110540017] [2021-10-28 09:04:17,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110540017] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:17,689 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:17,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:04:17,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452927500] [2021-10-28 09:04:17,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:04:17,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:17,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:04:17,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:04:17,691 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 09:04:17,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:17,938 INFO L93 Difference]: Finished difference Result 705 states and 915 transitions. [2021-10-28 09:04:17,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:04:17,939 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 09:04:17,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:17,941 INFO L225 Difference]: With dead ends: 705 [2021-10-28 09:04:17,941 INFO L226 Difference]: Without dead ends: 550 [2021-10-28 09:04:17,942 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 09:04:17,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2021-10-28 09:04:18,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 532. [2021-10-28 09:04:18,023 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 09:04:18,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 690 transitions. [2021-10-28 09:04:18,025 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 690 transitions. Word has length 40 [2021-10-28 09:04:18,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:18,026 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 690 transitions. [2021-10-28 09:04:18,026 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 09:04:18,026 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 690 transitions. [2021-10-28 09:04:18,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-28 09:04:18,028 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:18,028 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 09:04:18,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-10-28 09:04:18,029 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 09:04:18,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:18,029 INFO L85 PathProgramCache]: Analyzing trace with hash 289296501, now seen corresponding path program 1 times [2021-10-28 09:04:18,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:18,030 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955656024] [2021-10-28 09:04:18,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:18,031 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:18,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:04:18,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:18,170 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955656024] [2021-10-28 09:04:18,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955656024] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:18,171 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:18,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-28 09:04:18,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667124870] [2021-10-28 09:04:18,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-28 09:04:18,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:18,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-28 09:04:18,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-10-28 09:04:18,174 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 09:04:18,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:18,612 INFO L93 Difference]: Finished difference Result 624 states and 800 transitions. [2021-10-28 09:04:18,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 09:04:18,613 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 09:04:18,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:18,615 INFO L225 Difference]: With dead ends: 624 [2021-10-28 09:04:18,615 INFO L226 Difference]: Without dead ends: 479 [2021-10-28 09:04:18,616 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 09:04:18,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2021-10-28 09:04:18,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 432. [2021-10-28 09:04:18,689 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 09:04:18,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 548 transitions. [2021-10-28 09:04:18,691 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 548 transitions. Word has length 41 [2021-10-28 09:04:18,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:18,694 INFO L470 AbstractCegarLoop]: Abstraction has 432 states and 548 transitions. [2021-10-28 09:04:18,694 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 09:04:18,695 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 548 transitions. [2021-10-28 09:04:18,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-28 09:04:18,696 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:18,697 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 09:04:18,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-10-28 09:04:18,698 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 09:04:18,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:18,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1488645827, now seen corresponding path program 1 times [2021-10-28 09:04:18,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:18,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189429393] [2021-10-28 09:04:18,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:18,700 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:18,752 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 09:04:18,752 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:18,752 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189429393] [2021-10-28 09:04:18,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189429393] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:18,753 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:18,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:04:18,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988629327] [2021-10-28 09:04:18,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:04:18,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:18,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:04:18,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:04:18,755 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 09:04:18,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:18,976 INFO L93 Difference]: Finished difference Result 481 states and 603 transitions. [2021-10-28 09:04:18,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:04:18,977 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 09:04:18,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:18,979 INFO L225 Difference]: With dead ends: 481 [2021-10-28 09:04:18,979 INFO L226 Difference]: Without dead ends: 468 [2021-10-28 09:04:18,980 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 09:04:18,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2021-10-28 09:04:19,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 458. [2021-10-28 09:04:19,080 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 09:04:19,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 579 transitions. [2021-10-28 09:04:19,082 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 579 transitions. Word has length 41 [2021-10-28 09:04:19,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:19,082 INFO L470 AbstractCegarLoop]: Abstraction has 458 states and 579 transitions. [2021-10-28 09:04:19,082 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 09:04:19,083 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 579 transitions. [2021-10-28 09:04:19,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-10-28 09:04:19,084 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:19,085 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 09:04:19,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-10-28 09:04:19,085 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 09:04:19,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:19,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1202346494, now seen corresponding path program 1 times [2021-10-28 09:04:19,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:19,087 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791657064] [2021-10-28 09:04:19,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:19,087 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:19,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:19,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:04:19,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:19,146 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791657064] [2021-10-28 09:04:19,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791657064] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:19,146 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:19,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:04:19,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924938635] [2021-10-28 09:04:19,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:04:19,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:19,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:04:19,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:04:19,149 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 09:04:19,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:19,277 INFO L93 Difference]: Finished difference Result 484 states and 608 transitions. [2021-10-28 09:04:19,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:04:19,278 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 09:04:19,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:19,280 INFO L225 Difference]: With dead ends: 484 [2021-10-28 09:04:19,281 INFO L226 Difference]: Without dead ends: 453 [2021-10-28 09:04:19,281 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 09:04:19,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2021-10-28 09:04:19,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 450. [2021-10-28 09:04:19,361 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 09:04:19,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 564 transitions. [2021-10-28 09:04:19,363 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 564 transitions. Word has length 42 [2021-10-28 09:04:19,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:19,363 INFO L470 AbstractCegarLoop]: Abstraction has 450 states and 564 transitions. [2021-10-28 09:04:19,364 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 09:04:19,364 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 564 transitions. [2021-10-28 09:04:19,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-10-28 09:04:19,365 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:19,366 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 09:04:19,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-10-28 09:04:19,366 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 09:04:19,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:19,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1198792050, now seen corresponding path program 1 times [2021-10-28 09:04:19,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:19,367 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310292177] [2021-10-28 09:04:19,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:19,368 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:19,407 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 09:04:19,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:19,408 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310292177] [2021-10-28 09:04:19,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310292177] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:19,408 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:19,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:04:19,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817838356] [2021-10-28 09:04:19,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:04:19,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:19,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:04:19,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:04:19,410 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 09:04:19,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:19,560 INFO L93 Difference]: Finished difference Result 535 states and 665 transitions. [2021-10-28 09:04:19,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:04:19,561 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 09:04:19,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:19,562 INFO L225 Difference]: With dead ends: 535 [2021-10-28 09:04:19,563 INFO L226 Difference]: Without dead ends: 394 [2021-10-28 09:04:19,563 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 09:04:19,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2021-10-28 09:04:19,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 374. [2021-10-28 09:04:19,618 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 09:04:19,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 459 transitions. [2021-10-28 09:04:19,619 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 459 transitions. Word has length 42 [2021-10-28 09:04:19,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:19,620 INFO L470 AbstractCegarLoop]: Abstraction has 374 states and 459 transitions. [2021-10-28 09:04:19,620 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 09:04:19,620 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 459 transitions. [2021-10-28 09:04:19,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-28 09:04:19,621 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:19,622 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 09:04:19,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-10-28 09:04:19,622 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 09:04:19,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:19,623 INFO L85 PathProgramCache]: Analyzing trace with hash 888562187, now seen corresponding path program 1 times [2021-10-28 09:04:19,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:19,623 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033583236] [2021-10-28 09:04:19,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:19,624 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:19,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:19,743 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 09:04:19,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:19,743 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033583236] [2021-10-28 09:04:19,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033583236] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:19,744 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:19,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 09:04:19,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83623752] [2021-10-28 09:04:19,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 09:04:19,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:19,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 09:04:19,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-28 09:04:19,746 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 09:04:19,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:19,949 INFO L93 Difference]: Finished difference Result 417 states and 508 transitions. [2021-10-28 09:04:19,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-28 09:04:19,950 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 09:04:19,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:19,951 INFO L225 Difference]: With dead ends: 417 [2021-10-28 09:04:19,952 INFO L226 Difference]: Without dead ends: 392 [2021-10-28 09:04:19,952 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 09:04:19,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2021-10-28 09:04:20,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 362. [2021-10-28 09:04:20,003 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 09:04:20,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 445 transitions. [2021-10-28 09:04:20,004 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 445 transitions. Word has length 43 [2021-10-28 09:04:20,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:20,005 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 445 transitions. [2021-10-28 09:04:20,005 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 09:04:20,005 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 445 transitions. [2021-10-28 09:04:20,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-28 09:04:20,006 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:20,007 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 09:04:20,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-10-28 09:04:20,007 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 09:04:20,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:20,008 INFO L85 PathProgramCache]: Analyzing trace with hash -352812212, now seen corresponding path program 1 times [2021-10-28 09:04:20,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:20,008 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721603975] [2021-10-28 09:04:20,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:20,008 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:20,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:20,093 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 09:04:20,093 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:20,094 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721603975] [2021-10-28 09:04:20,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721603975] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:20,094 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:20,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:04:20,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015615101] [2021-10-28 09:04:20,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:04:20,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:20,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:04:20,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:04:20,096 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 09:04:20,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:20,248 INFO L93 Difference]: Finished difference Result 367 states and 449 transitions. [2021-10-28 09:04:20,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:04:20,249 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 09:04:20,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:20,250 INFO L225 Difference]: With dead ends: 367 [2021-10-28 09:04:20,250 INFO L226 Difference]: Without dead ends: 343 [2021-10-28 09:04:20,251 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 09:04:20,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2021-10-28 09:04:20,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2021-10-28 09:04:20,300 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 09:04:20,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 420 transitions. [2021-10-28 09:04:20,301 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 420 transitions. Word has length 43 [2021-10-28 09:04:20,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:20,302 INFO L470 AbstractCegarLoop]: Abstraction has 343 states and 420 transitions. [2021-10-28 09:04:20,302 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 09:04:20,302 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 420 transitions. [2021-10-28 09:04:20,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-28 09:04:20,304 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:20,304 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 09:04:20,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-10-28 09:04:20,304 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 09:04:20,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:20,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1424724662, now seen corresponding path program 1 times [2021-10-28 09:04:20,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:20,306 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298882] [2021-10-28 09:04:20,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:20,306 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:20,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:04:20,465 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:20,465 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298882] [2021-10-28 09:04:20,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298882] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:20,466 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:20,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-28 09:04:20,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409391635] [2021-10-28 09:04:20,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 09:04:20,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:20,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 09:04:20,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-28 09:04:20,469 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 09:04:20,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:20,877 INFO L93 Difference]: Finished difference Result 356 states and 433 transitions. [2021-10-28 09:04:20,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 09:04:20,878 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 09:04:20,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:20,879 INFO L225 Difference]: With dead ends: 356 [2021-10-28 09:04:20,879 INFO L226 Difference]: Without dead ends: 298 [2021-10-28 09:04:20,880 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 09:04:20,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-10-28 09:04:20,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2021-10-28 09:04:20,920 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 09:04:20,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 362 transitions. [2021-10-28 09:04:20,921 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 362 transitions. Word has length 44 [2021-10-28 09:04:20,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:20,922 INFO L470 AbstractCegarLoop]: Abstraction has 298 states and 362 transitions. [2021-10-28 09:04:20,922 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 09:04:20,922 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 362 transitions. [2021-10-28 09:04:20,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-28 09:04:20,923 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:20,924 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 09:04:20,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-10-28 09:04:20,924 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 09:04:20,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:20,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1904668637, now seen corresponding path program 1 times [2021-10-28 09:04:20,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:20,925 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349086764] [2021-10-28 09:04:20,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:20,926 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:21,013 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 09:04:21,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:21,014 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349086764] [2021-10-28 09:04:21,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349086764] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:21,014 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:21,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 09:04:21,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458136769] [2021-10-28 09:04:21,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:04:21,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:21,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:04:21,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:04:21,017 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 09:04:21,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:21,240 INFO L93 Difference]: Finished difference Result 628 states and 758 transitions. [2021-10-28 09:04:21,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 09:04:21,241 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 09:04:21,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:21,243 INFO L225 Difference]: With dead ends: 628 [2021-10-28 09:04:21,243 INFO L226 Difference]: Without dead ends: 558 [2021-10-28 09:04:21,244 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 09:04:21,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2021-10-28 09:04:21,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 316. [2021-10-28 09:04:21,304 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 09:04:21,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 382 transitions. [2021-10-28 09:04:21,305 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 382 transitions. Word has length 44 [2021-10-28 09:04:21,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:21,306 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 382 transitions. [2021-10-28 09:04:21,306 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 09:04:21,306 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 382 transitions. [2021-10-28 09:04:21,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-28 09:04:21,307 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:21,307 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 09:04:21,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-10-28 09:04:21,308 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 09:04:21,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:21,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1732054660, now seen corresponding path program 1 times [2021-10-28 09:04:21,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:21,309 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859346886] [2021-10-28 09:04:21,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:21,310 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:21,363 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 09:04:21,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:21,363 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859346886] [2021-10-28 09:04:21,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859346886] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:21,364 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:21,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:04:21,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720314520] [2021-10-28 09:04:21,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:04:21,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:21,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:04:21,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:04:21,366 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 09:04:21,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:21,515 INFO L93 Difference]: Finished difference Result 320 states and 385 transitions. [2021-10-28 09:04:21,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:04:21,516 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 09:04:21,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:21,518 INFO L225 Difference]: With dead ends: 320 [2021-10-28 09:04:21,518 INFO L226 Difference]: Without dead ends: 316 [2021-10-28 09:04:21,519 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 09:04:21,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-10-28 09:04:21,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2021-10-28 09:04:21,578 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 09:04:21,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 381 transitions. [2021-10-28 09:04:21,580 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 381 transitions. Word has length 44 [2021-10-28 09:04:21,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:21,580 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 381 transitions. [2021-10-28 09:04:21,580 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 09:04:21,581 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 381 transitions. [2021-10-28 09:04:21,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-28 09:04:21,582 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:21,583 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 09:04:21,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-10-28 09:04:21,583 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 09:04:21,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:21,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1966651937, now seen corresponding path program 1 times [2021-10-28 09:04:21,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:21,584 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883623015] [2021-10-28 09:04:21,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:21,585 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:21,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:04:21,620 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:21,620 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883623015] [2021-10-28 09:04:21,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883623015] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:21,621 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:21,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:04:21,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881869575] [2021-10-28 09:04:21,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:04:21,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:21,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:04:21,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:04:21,623 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 09:04:21,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:21,766 INFO L93 Difference]: Finished difference Result 621 states and 743 transitions. [2021-10-28 09:04:21,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:04:21,766 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 09:04:21,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:21,768 INFO L225 Difference]: With dead ends: 621 [2021-10-28 09:04:21,769 INFO L226 Difference]: Without dead ends: 558 [2021-10-28 09:04:21,769 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 09:04:21,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2021-10-28 09:04:21,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 316. [2021-10-28 09:04:21,828 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 09:04:21,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 379 transitions. [2021-10-28 09:04:21,829 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 379 transitions. Word has length 44 [2021-10-28 09:04:21,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:21,830 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 379 transitions. [2021-10-28 09:04:21,830 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 09:04:21,830 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 379 transitions. [2021-10-28 09:04:21,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-28 09:04:21,832 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:21,832 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 09:04:21,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-10-28 09:04:21,832 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 09:04:21,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:21,833 INFO L85 PathProgramCache]: Analyzing trace with hash 2123245657, now seen corresponding path program 1 times [2021-10-28 09:04:21,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:21,833 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580294157] [2021-10-28 09:04:21,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:21,834 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:21,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:21,921 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 09:04:21,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:21,922 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580294157] [2021-10-28 09:04:21,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580294157] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:21,922 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:21,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 09:04:21,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540094540] [2021-10-28 09:04:21,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 09:04:21,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:21,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 09:04:21,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-28 09:04:21,924 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 09:04:22,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:22,263 INFO L93 Difference]: Finished difference Result 535 states and 638 transitions. [2021-10-28 09:04:22,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 09:04:22,264 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 09:04:22,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:22,265 INFO L225 Difference]: With dead ends: 535 [2021-10-28 09:04:22,266 INFO L226 Difference]: Without dead ends: 429 [2021-10-28 09:04:22,266 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 09:04:22,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2021-10-28 09:04:22,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 324. [2021-10-28 09:04:22,327 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 09:04:22,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 385 transitions. [2021-10-28 09:04:22,329 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 385 transitions. Word has length 45 [2021-10-28 09:04:22,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:22,329 INFO L470 AbstractCegarLoop]: Abstraction has 324 states and 385 transitions. [2021-10-28 09:04:22,329 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 09:04:22,330 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 385 transitions. [2021-10-28 09:04:22,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-28 09:04:22,331 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:22,331 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 09:04:22,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-10-28 09:04:22,332 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 09:04:22,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:22,332 INFO L85 PathProgramCache]: Analyzing trace with hash -970126947, now seen corresponding path program 1 times [2021-10-28 09:04:22,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:22,333 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976119077] [2021-10-28 09:04:22,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:22,333 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:22,396 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 09:04:22,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:22,396 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976119077] [2021-10-28 09:04:22,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976119077] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:22,397 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:22,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 09:04:22,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236899970] [2021-10-28 09:04:22,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:04:22,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:22,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:04:22,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:04:22,399 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 09:04:22,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:22,591 INFO L93 Difference]: Finished difference Result 576 states and 684 transitions. [2021-10-28 09:04:22,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 09:04:22,592 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 09:04:22,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:22,593 INFO L225 Difference]: With dead ends: 576 [2021-10-28 09:04:22,593 INFO L226 Difference]: Without dead ends: 537 [2021-10-28 09:04:22,594 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 09:04:22,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2021-10-28 09:04:22,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 290. [2021-10-28 09:04:22,630 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 09:04:22,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 344 transitions. [2021-10-28 09:04:22,631 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 344 transitions. Word has length 45 [2021-10-28 09:04:22,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:22,631 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 344 transitions. [2021-10-28 09:04:22,631 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 09:04:22,631 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 344 transitions. [2021-10-28 09:04:22,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-28 09:04:22,633 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:22,633 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 09:04:22,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-10-28 09:04:22,633 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 09:04:22,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:22,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1018198740, now seen corresponding path program 1 times [2021-10-28 09:04:22,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:22,634 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115877052] [2021-10-28 09:04:22,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:22,635 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:04:22,742 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 09:04:22,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:04:22,742 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115877052] [2021-10-28 09:04:22,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115877052] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:04:22,743 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:04:22,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-28 09:04:22,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566114980] [2021-10-28 09:04:22,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 09:04:22,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:04:22,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 09:04:22,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-28 09:04:22,745 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 09:04:23,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:04:23,064 INFO L93 Difference]: Finished difference Result 290 states and 344 transitions. [2021-10-28 09:04:23,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 09:04:23,065 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 09:04:23,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:04:23,066 INFO L225 Difference]: With dead ends: 290 [2021-10-28 09:04:23,066 INFO L226 Difference]: Without dead ends: 214 [2021-10-28 09:04:23,066 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 09:04:23,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-10-28 09:04:23,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2021-10-28 09:04:23,107 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 09:04:23,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 251 transitions. [2021-10-28 09:04:23,108 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 251 transitions. Word has length 47 [2021-10-28 09:04:23,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:04:23,108 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 251 transitions. [2021-10-28 09:04:23,109 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 09:04:23,109 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 251 transitions. [2021-10-28 09:04:23,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-28 09:04:23,110 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:04:23,110 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 09:04:23,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-10-28 09:04:23,111 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 09:04:23,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:04:23,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1477898981, now seen corresponding path program 1 times [2021-10-28 09:04:23,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:04:23,112 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9004988] [2021-10-28 09:04:23,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:04:23,112 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:04:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:04:23,130 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 09:04:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 09:04:23,204 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 09:04:23,205 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-10-28 09:04:23,206 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,209 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,210 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,210 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,211 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,211 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,212 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,212 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,212 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,213 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,213 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,214 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,214 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,214 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,215 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,215 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,215 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,215 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,216 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,216 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,216 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,217 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,217 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,217 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,217 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,221 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,222 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,223 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,224 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,224 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,224 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,225 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,225 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,225 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,225 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,226 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,226 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,226 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,227 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,227 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,227 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,227 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,228 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,228 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,228 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,228 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,229 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,229 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,229 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,229 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,230 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,230 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,230 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,231 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,231 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,231 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,231 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,232 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,232 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,232 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,232 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,233 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,233 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,233 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,233 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,234 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,234 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,234 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,235 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,235 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,235 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,235 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,236 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,236 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,236 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,236 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,237 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,237 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,237 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,239 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:04:23,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-10-28 09:04:23,244 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 09:04:23,249 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 09:04:23,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 09:04:23 BoogieIcfgContainer [2021-10-28 09:04:23,400 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 09:04:23,401 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 09:04:23,401 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 09:04:23,401 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 09:04:23,402 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:03:56" (3/4) ... [2021-10-28 09:04:23,404 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-28 09:04:23,570 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fce1ca98-c754-40dc-9510-e68e37914470/bin/uautomizer-UnR33cPsHg/witness.graphml [2021-10-28 09:04:23,570 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 09:04:23,572 INFO L168 Benchmark]: Toolchain (without parser) took 32015.95 ms. Allocated memory was 94.4 MB in the beginning and 541.1 MB in the end (delta: 446.7 MB). Free memory was 53.3 MB in the beginning and 312.4 MB in the end (delta: -259.1 MB). Peak memory consumption was 190.4 MB. Max. memory is 16.1 GB. [2021-10-28 09:04:23,573 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 94.4 MB. Free memory was 72.0 MB in the beginning and 72.0 MB in the end (delta: 56.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 09:04:23,573 INFO L168 Benchmark]: CACSL2BoogieTranslator took 885.23 ms. Allocated memory was 94.4 MB in the beginning and 113.2 MB in the end (delta: 18.9 MB). Free memory was 53.1 MB in the beginning and 69.6 MB in the end (delta: -16.5 MB). Peak memory consumption was 13.7 MB. Max. memory is 16.1 GB. [2021-10-28 09:04:23,574 INFO L168 Benchmark]: Boogie Procedure Inliner took 326.81 ms. Allocated memory is still 113.2 MB. Free memory was 69.6 MB in the beginning and 49.2 MB in the end (delta: 20.4 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2021-10-28 09:04:23,574 INFO L168 Benchmark]: Boogie Preprocessor took 339.25 ms. Allocated memory is still 113.2 MB. Free memory was 49.2 MB in the beginning and 73.8 MB in the end (delta: -24.6 MB). Peak memory consumption was 29.8 MB. Max. memory is 16.1 GB. [2021-10-28 09:04:23,575 INFO L168 Benchmark]: RCFGBuilder took 3529.17 ms. Allocated memory was 113.2 MB in the beginning and 159.4 MB in the end (delta: 46.1 MB). Free memory was 73.8 MB in the beginning and 93.3 MB in the end (delta: -19.5 MB). Peak memory consumption was 58.0 MB. Max. memory is 16.1 GB. [2021-10-28 09:04:23,575 INFO L168 Benchmark]: TraceAbstraction took 26750.88 ms. Allocated memory was 159.4 MB in the beginning and 541.1 MB in the end (delta: 381.7 MB). Free memory was 93.3 MB in the beginning and 325.0 MB in the end (delta: -231.7 MB). Peak memory consumption was 149.8 MB. Max. memory is 16.1 GB. [2021-10-28 09:04:23,576 INFO L168 Benchmark]: Witness Printer took 169.71 ms. Allocated memory is still 541.1 MB. Free memory was 324.0 MB in the beginning and 312.4 MB in the end (delta: 11.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-28 09:04:23,578 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.36 ms. Allocated memory is still 94.4 MB. Free memory was 72.0 MB in the beginning and 72.0 MB in the end (delta: 56.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 885.23 ms. Allocated memory was 94.4 MB in the beginning and 113.2 MB in the end (delta: 18.9 MB). Free memory was 53.1 MB in the beginning and 69.6 MB in the end (delta: -16.5 MB). Peak memory consumption was 13.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 326.81 ms. Allocated memory is still 113.2 MB. Free memory was 69.6 MB in the beginning and 49.2 MB in the end (delta: 20.4 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 339.25 ms. Allocated memory is still 113.2 MB. Free memory was 49.2 MB in the beginning and 73.8 MB in the end (delta: -24.6 MB). Peak memory consumption was 29.8 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3529.17 ms. Allocated memory was 113.2 MB in the beginning and 159.4 MB in the end (delta: 46.1 MB). Free memory was 73.8 MB in the beginning and 93.3 MB in the end (delta: -19.5 MB). Peak memory consumption was 58.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 26750.88 ms. Allocated memory was 159.4 MB in the beginning and 541.1 MB in the end (delta: 381.7 MB). Free memory was 93.3 MB in the beginning and 325.0 MB in the end (delta: -231.7 MB). Peak memory consumption was 149.8 MB. Max. memory is 16.1 GB. * Witness Printer took 169.71 ms. Allocated memory is still 541.1 MB. Free memory was 324.0 MB in the beginning and 312.4 MB in the end (delta: 11.5 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: 26.4s, OverallIterations: 56, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 16.2s, 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, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 392 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 2.5s 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: 4.5s AutomataMinimizationTime, 55 MinimizatonAttempts, 2604 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.2s 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 09:04:23,658 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fce1ca98-c754-40dc-9510-e68e37914470/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...