./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45438020-1b08-4a87-bf90-b961836db963/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45438020-1b08-4a87-bf90-b961836db963/bin/uautomizer-WNIpwEf4Nt/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45438020-1b08-4a87-bf90-b961836db963/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45438020-1b08-4a87-bf90-b961836db963/bin/uautomizer-WNIpwEf4Nt/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45438020-1b08-4a87-bf90-b961836db963/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45438020-1b08-4a87-bf90-b961836db963/bin/uautomizer-WNIpwEf4Nt --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 80f2ff50c19fe4a3b45780d8d11b89e9a2800d57 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 00:29:42,804 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 00:29:42,807 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 00:29:42,865 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 00:29:42,867 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 00:29:42,872 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 00:29:42,874 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 00:29:42,878 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 00:29:42,881 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 00:29:42,888 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 00:29:42,889 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 00:29:42,891 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 00:29:42,891 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 00:29:42,893 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 00:29:42,895 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 00:29:42,901 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 00:29:42,902 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 00:29:42,903 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 00:29:42,905 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 00:29:42,908 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 00:29:42,910 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 00:29:42,913 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 00:29:42,914 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 00:29:42,917 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 00:29:42,920 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 00:29:42,925 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 00:29:42,926 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 00:29:42,927 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 00:29:42,928 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 00:29:42,930 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 00:29:42,930 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 00:29:42,931 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 00:29:42,933 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 00:29:42,934 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 00:29:42,935 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 00:29:42,935 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 00:29:42,936 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 00:29:42,936 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 00:29:42,937 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 00:29:42,937 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 00:29:42,938 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 00:29:42,939 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45438020-1b08-4a87-bf90-b961836db963/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-13 00:29:42,963 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 00:29:42,963 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 00:29:42,963 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 00:29:42,964 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 00:29:42,965 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 00:29:42,965 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 00:29:42,965 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 00:29:42,965 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 00:29:42,966 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 00:29:42,966 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 00:29:42,966 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 00:29:42,966 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 00:29:42,966 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 00:29:42,967 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 00:29:42,967 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 00:29:42,967 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 00:29:42,967 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 00:29:42,968 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 00:29:42,968 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 00:29:42,968 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 00:29:42,968 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 00:29:42,969 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 00:29:42,969 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:29:42,969 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 00:29:42,969 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 00:29:42,969 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 00:29:42,970 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 00:29:42,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 00:29:42,970 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 00:29:42,970 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 00:29:42,971 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_45438020-1b08-4a87-bf90-b961836db963/bin/uautomizer-WNIpwEf4Nt/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_45438020-1b08-4a87-bf90-b961836db963/bin/uautomizer-WNIpwEf4Nt Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 80f2ff50c19fe4a3b45780d8d11b89e9a2800d57 [2021-10-13 00:29:43,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 00:29:43,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 00:29:43,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 00:29:43,249 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 00:29:43,250 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 00:29:43,251 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45438020-1b08-4a87-bf90-b961836db963/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-1.c [2021-10-13 00:29:43,304 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45438020-1b08-4a87-bf90-b961836db963/bin/uautomizer-WNIpwEf4Nt/data/1ec512f0c/2b452de33f9d4e32b6cbf1477125d069/FLAG3ee1a41ad [2021-10-13 00:29:43,735 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 00:29:43,736 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45438020-1b08-4a87-bf90-b961836db963/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-1.c [2021-10-13 00:29:43,752 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45438020-1b08-4a87-bf90-b961836db963/bin/uautomizer-WNIpwEf4Nt/data/1ec512f0c/2b452de33f9d4e32b6cbf1477125d069/FLAG3ee1a41ad [2021-10-13 00:29:43,765 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45438020-1b08-4a87-bf90-b961836db963/bin/uautomizer-WNIpwEf4Nt/data/1ec512f0c/2b452de33f9d4e32b6cbf1477125d069 [2021-10-13 00:29:43,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 00:29:43,769 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 00:29:43,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 00:29:43,772 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 00:29:43,775 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 00:29:43,776 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:29:43" (1/1) ... [2021-10-13 00:29:43,777 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75f3fbf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:29:43, skipping insertion in model container [2021-10-13 00:29:43,777 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:29:43" (1/1) ... [2021-10-13 00:29:43,784 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 00:29:43,847 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 00:29:44,051 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_45438020-1b08-4a87-bf90-b961836db963/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-1.c[2713,2726] [2021-10-13 00:29:44,145 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:29:44,154 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 00:29:44,169 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_45438020-1b08-4a87-bf90-b961836db963/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-1.c[2713,2726] [2021-10-13 00:29:44,280 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:29:44,296 INFO L208 MainTranslator]: Completed translation [2021-10-13 00:29:44,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:29:44 WrapperNode [2021-10-13 00:29:44,298 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 00:29:44,299 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 00:29:44,300 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 00:29:44,300 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 00:29:44,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:29:44" (1/1) ... [2021-10-13 00:29:44,334 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:29:44" (1/1) ... [2021-10-13 00:29:44,402 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 00:29:44,403 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 00:29:44,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 00:29:44,403 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 00:29:44,411 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:29:44" (1/1) ... [2021-10-13 00:29:44,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:29:44" (1/1) ... [2021-10-13 00:29:44,419 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:29:44" (1/1) ... [2021-10-13 00:29:44,419 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:29:44" (1/1) ... [2021-10-13 00:29:44,445 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:29:44" (1/1) ... [2021-10-13 00:29:44,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:29:44" (1/1) ... [2021-10-13 00:29:44,462 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:29:44" (1/1) ... [2021-10-13 00:29:44,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 00:29:44,480 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 00:29:44,480 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 00:29:44,480 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 00:29:44,492 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:29:44" (1/1) ... [2021-10-13 00:29:44,499 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:29:44,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45438020-1b08-4a87-bf90-b961836db963/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:29:44,537 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45438020-1b08-4a87-bf90-b961836db963/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 00:29:44,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45438020-1b08-4a87-bf90-b961836db963/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 00:29:44,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 00:29:44,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 00:29:44,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 00:29:44,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 00:29:44,746 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:29:44,754 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:29:44,763 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:29:44,768 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:29:44,770 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:29:44,774 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:29:44,779 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:29:44,785 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:29:44,788 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:29:44,789 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:29:44,797 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:29:44,802 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:29:44,804 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:29:44,805 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:29:44,810 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:29:44,815 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:29:44,825 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:29:44,832 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:29:44,837 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:29:44,844 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:29:44,851 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:29:44,855 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:29:44,856 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:29:44,862 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:29:45,873 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##416: assume !false; [2021-10-13 00:29:45,873 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##415: assume false; [2021-10-13 00:29:45,873 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##445: assume false; [2021-10-13 00:29:45,873 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##290: assume false; [2021-10-13 00:29:45,874 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##291: assume !false; [2021-10-13 00:29:45,874 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##490: assume !false; [2021-10-13 00:29:45,874 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##269: assume false; [2021-10-13 00:29:45,874 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##270: assume !false; [2021-10-13 00:29:45,874 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##446: assume !false; [2021-10-13 00:29:45,874 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##209: assume false; [2021-10-13 00:29:45,875 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##210: assume !false; [2021-10-13 00:29:45,875 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##463: assume false; [2021-10-13 00:29:45,875 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##464: assume !false; [2021-10-13 00:29:45,875 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##470: assume false; [2021-10-13 00:29:45,875 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##232: assume false; [2021-10-13 00:29:45,876 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##471: assume !false; [2021-10-13 00:29:45,876 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##233: assume !false; [2021-10-13 00:29:45,876 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##242: assume !false; [2021-10-13 00:29:45,876 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##241: assume false; [2021-10-13 00:29:45,876 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##489: assume false; [2021-10-13 00:29:45,876 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##246: assume !false; [2021-10-13 00:29:45,877 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##245: assume false; [2021-10-13 00:29:45,877 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-10-13 00:29:45,877 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-10-13 00:29:45,878 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume !false; [2021-10-13 00:29:45,878 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume false; [2021-10-13 00:29:45,878 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##175: assume !false; [2021-10-13 00:29:45,879 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##174: assume false; [2021-10-13 00:29:45,879 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##180: assume false; [2021-10-13 00:29:45,879 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##181: assume !false; [2021-10-13 00:29:45,879 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !false; [2021-10-13 00:29:45,880 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume false; [2021-10-13 00:29:45,880 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##137: assume false; [2021-10-13 00:29:45,880 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##35: assume !false; [2021-10-13 00:29:45,881 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##34: assume false; [2021-10-13 00:29:45,881 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##138: assume !false; [2021-10-13 00:29:45,881 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##393: assume false; [2021-10-13 00:29:45,882 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2021-10-13 00:29:45,882 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##394: assume !false; [2021-10-13 00:29:45,882 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2021-10-13 00:29:45,883 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##164: assume !false; [2021-10-13 00:29:45,883 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##163: assume false; [2021-10-13 00:29:45,883 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##329: assume false; [2021-10-13 00:29:45,884 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##330: assume !false; [2021-10-13 00:29:45,884 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##108: assume !false; [2021-10-13 00:29:45,884 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##107: assume false; [2021-10-13 00:29:45,884 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##364: assume !false; [2021-10-13 00:29:45,884 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##363: assume false; [2021-10-13 00:29:45,906 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 00:29:45,907 INFO L299 CfgBuilder]: Removed 207 assume(true) statements. [2021-10-13 00:29:45,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:29:45 BoogieIcfgContainer [2021-10-13 00:29:45,910 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 00:29:45,912 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 00:29:45,912 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 00:29:45,916 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 00:29:45,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:29:43" (1/3) ... [2021-10-13 00:29:45,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26acfdd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:29:45, skipping insertion in model container [2021-10-13 00:29:45,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:29:44" (2/3) ... [2021-10-13 00:29:45,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26acfdd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:29:45, skipping insertion in model container [2021-10-13 00:29:45,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:29:45" (3/3) ... [2021-10-13 00:29:45,919 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl3.cil-1.c [2021-10-13 00:29:45,927 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 00:29:45,927 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2021-10-13 00:29:45,991 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 00:29:46,002 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-13 00:29:46,003 INFO L340 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2021-10-13 00:29:46,036 INFO L276 IsEmpty]: Start isEmpty. Operand has 421 states, 379 states have (on average 1.5910290237467017) internal successors, (603), 420 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:46,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-13 00:29:46,040 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:46,040 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:46,041 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 00:29:46,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:46,046 INFO L82 PathProgramCache]: Analyzing trace with hash 660910296, now seen corresponding path program 1 times [2021-10-13 00:29:46,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:46,055 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916723377] [2021-10-13 00:29:46,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:46,056 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:46,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:46,271 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-13 00:29:46,271 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:46,272 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916723377] [2021-10-13 00:29:46,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916723377] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:46,273 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:46,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:29:46,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617670218] [2021-10-13 00:29:46,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:29:46,279 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:46,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:29:46,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:46,295 INFO L87 Difference]: Start difference. First operand has 421 states, 379 states have (on average 1.5910290237467017) internal successors, (603), 420 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:46,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:46,405 INFO L93 Difference]: Finished difference Result 763 states and 1090 transitions. [2021-10-13 00:29:46,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:29:46,409 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-13 00:29:46,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:46,436 INFO L225 Difference]: With dead ends: 763 [2021-10-13 00:29:46,436 INFO L226 Difference]: Without dead ends: 416 [2021-10-13 00:29:46,444 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:46,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2021-10-13 00:29:46,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2021-10-13 00:29:46,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 375 states have (on average 1.456) internal successors, (546), 415 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:46,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 546 transitions. [2021-10-13 00:29:46,547 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 546 transitions. Word has length 11 [2021-10-13 00:29:46,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:46,548 INFO L470 AbstractCegarLoop]: Abstraction has 416 states and 546 transitions. [2021-10-13 00:29:46,548 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-13 00:29:46,549 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 546 transitions. [2021-10-13 00:29:46,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-13 00:29:46,549 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:46,550 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:46,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 00:29:46,550 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 00:29:46,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:46,553 INFO L82 PathProgramCache]: Analyzing trace with hash -32433196, now seen corresponding path program 1 times [2021-10-13 00:29:46,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:46,554 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131524504] [2021-10-13 00:29:46,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:46,554 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:46,705 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-13 00:29:46,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:46,706 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131524504] [2021-10-13 00:29:46,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131524504] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:46,706 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:46,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:29:46,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222323003] [2021-10-13 00:29:46,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:29:46,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:46,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:29:46,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:46,710 INFO L87 Difference]: Start difference. First operand 416 states and 546 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:46,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:46,949 INFO L93 Difference]: Finished difference Result 714 states and 941 transitions. [2021-10-13 00:29:46,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:29:46,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-10-13 00:29:46,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:46,954 INFO L225 Difference]: With dead ends: 714 [2021-10-13 00:29:46,954 INFO L226 Difference]: Without dead ends: 547 [2021-10-13 00:29:46,956 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:46,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2021-10-13 00:29:46,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 521. [2021-10-13 00:29:46,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 492 states have (on average 1.4166666666666667) internal successors, (697), 520 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:46,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 697 transitions. [2021-10-13 00:29:46,989 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 697 transitions. Word has length 13 [2021-10-13 00:29:46,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:46,989 INFO L470 AbstractCegarLoop]: Abstraction has 521 states and 697 transitions. [2021-10-13 00:29:46,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:46,990 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 697 transitions. [2021-10-13 00:29:46,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-13 00:29:46,991 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:46,991 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:46,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 00:29:46,992 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 00:29:46,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:46,997 INFO L82 PathProgramCache]: Analyzing trace with hash 563627937, now seen corresponding path program 1 times [2021-10-13 00:29:46,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:46,998 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099870787] [2021-10-13 00:29:46,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:46,999 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:47,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-13 00:29:47,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:47,112 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099870787] [2021-10-13 00:29:47,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099870787] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:47,113 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:47,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:29:47,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789650743] [2021-10-13 00:29:47,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:29:47,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:47,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:29:47,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:47,115 INFO L87 Difference]: Start difference. First operand 521 states and 697 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:47,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:47,180 INFO L93 Difference]: Finished difference Result 1000 states and 1335 transitions. [2021-10-13 00:29:47,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:29:47,180 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-13 00:29:47,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:47,184 INFO L225 Difference]: With dead ends: 1000 [2021-10-13 00:29:47,185 INFO L226 Difference]: Without dead ends: 690 [2021-10-13 00:29:47,185 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:47,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2021-10-13 00:29:47,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 519. [2021-10-13 00:29:47,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 498 states have (on average 1.3975903614457832) internal successors, (696), 518 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:47,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 696 transitions. [2021-10-13 00:29:47,235 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 696 transitions. Word has length 16 [2021-10-13 00:29:47,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:47,235 INFO L470 AbstractCegarLoop]: Abstraction has 519 states and 696 transitions. [2021-10-13 00:29:47,236 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-13 00:29:47,236 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 696 transitions. [2021-10-13 00:29:47,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 00:29:47,237 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:47,237 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:47,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 00:29:47,238 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 00:29:47,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:47,239 INFO L82 PathProgramCache]: Analyzing trace with hash 6806604, now seen corresponding path program 1 times [2021-10-13 00:29:47,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:47,239 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717442461] [2021-10-13 00:29:47,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:47,239 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:47,281 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-13 00:29:47,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:47,282 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717442461] [2021-10-13 00:29:47,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717442461] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:47,282 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:47,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:29:47,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958044338] [2021-10-13 00:29:47,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:29:47,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:47,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:29:47,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:47,284 INFO L87 Difference]: Start difference. First operand 519 states and 696 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:47,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:47,344 INFO L93 Difference]: Finished difference Result 601 states and 797 transitions. [2021-10-13 00:29:47,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:29:47,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-13 00:29:47,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:47,348 INFO L225 Difference]: With dead ends: 601 [2021-10-13 00:29:47,348 INFO L226 Difference]: Without dead ends: 578 [2021-10-13 00:29:47,348 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:47,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2021-10-13 00:29:47,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 537. [2021-10-13 00:29:47,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 517 states have (on average 1.4061895551257253) internal successors, (727), 536 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:47,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 727 transitions. [2021-10-13 00:29:47,374 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 727 transitions. Word has length 19 [2021-10-13 00:29:47,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:47,374 INFO L470 AbstractCegarLoop]: Abstraction has 537 states and 727 transitions. [2021-10-13 00:29:47,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:47,375 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 727 transitions. [2021-10-13 00:29:47,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 00:29:47,376 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:47,377 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:47,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 00:29:47,377 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 00:29:47,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:47,377 INFO L82 PathProgramCache]: Analyzing trace with hash -450647822, now seen corresponding path program 1 times [2021-10-13 00:29:47,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:47,378 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569566504] [2021-10-13 00:29:47,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:47,378 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:47,428 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-13 00:29:47,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:47,429 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569566504] [2021-10-13 00:29:47,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569566504] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:47,429 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:47,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:29:47,430 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538259160] [2021-10-13 00:29:47,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:29:47,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:47,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:29:47,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:29:47,431 INFO L87 Difference]: Start difference. First operand 537 states and 727 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:47,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:47,480 INFO L93 Difference]: Finished difference Result 650 states and 863 transitions. [2021-10-13 00:29:47,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 00:29:47,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-13 00:29:47,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:47,484 INFO L225 Difference]: With dead ends: 650 [2021-10-13 00:29:47,485 INFO L226 Difference]: Without dead ends: 599 [2021-10-13 00:29:47,485 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:29:47,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2021-10-13 00:29:47,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 539. [2021-10-13 00:29:47,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 519 states have (on average 1.4046242774566473) internal successors, (729), 538 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:47,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 729 transitions. [2021-10-13 00:29:47,513 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 729 transitions. Word has length 22 [2021-10-13 00:29:47,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:47,513 INFO L470 AbstractCegarLoop]: Abstraction has 539 states and 729 transitions. [2021-10-13 00:29:47,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:47,513 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 729 transitions. [2021-10-13 00:29:47,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 00:29:47,515 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:47,515 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:47,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 00:29:47,516 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 00:29:47,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:47,516 INFO L82 PathProgramCache]: Analyzing trace with hash 364241657, now seen corresponding path program 1 times [2021-10-13 00:29:47,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:47,516 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609711753] [2021-10-13 00:29:47,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:47,517 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:47,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:29:47,549 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:47,549 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609711753] [2021-10-13 00:29:47,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609711753] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:47,549 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:47,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:29:47,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749529796] [2021-10-13 00:29:47,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:29:47,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:47,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:29:47,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:47,551 INFO L87 Difference]: Start difference. First operand 539 states and 729 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:47,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:47,704 INFO L93 Difference]: Finished difference Result 574 states and 773 transitions. [2021-10-13 00:29:47,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:29:47,704 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-13 00:29:47,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:47,708 INFO L225 Difference]: With dead ends: 574 [2021-10-13 00:29:47,708 INFO L226 Difference]: Without dead ends: 569 [2021-10-13 00:29:47,708 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:47,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2021-10-13 00:29:47,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 566. [2021-10-13 00:29:47,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 546 states have (on average 1.401098901098901) internal successors, (765), 565 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:47,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 765 transitions. [2021-10-13 00:29:47,751 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 765 transitions. Word has length 22 [2021-10-13 00:29:47,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:47,751 INFO L470 AbstractCegarLoop]: Abstraction has 566 states and 765 transitions. [2021-10-13 00:29:47,751 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-13 00:29:47,752 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 765 transitions. [2021-10-13 00:29:47,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-13 00:29:47,756 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:47,756 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:47,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 00:29:47,756 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 00:29:47,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:47,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1575831316, now seen corresponding path program 1 times [2021-10-13 00:29:47,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:47,763 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507779008] [2021-10-13 00:29:47,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:47,763 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:47,861 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-13 00:29:47,862 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:47,862 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507779008] [2021-10-13 00:29:47,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507779008] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:47,862 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:47,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:29:47,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61296910] [2021-10-13 00:29:47,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:29:47,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:47,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:29:47,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:29:47,864 INFO L87 Difference]: Start difference. First operand 566 states and 765 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:48,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:48,071 INFO L93 Difference]: Finished difference Result 578 states and 775 transitions. [2021-10-13 00:29:48,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:29:48,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-13 00:29:48,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:48,075 INFO L225 Difference]: With dead ends: 578 [2021-10-13 00:29:48,076 INFO L226 Difference]: Without dead ends: 569 [2021-10-13 00:29:48,076 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:29:48,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2021-10-13 00:29:48,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 566. [2021-10-13 00:29:48,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 546 states have (on average 1.3974358974358974) internal successors, (763), 565 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:48,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 763 transitions. [2021-10-13 00:29:48,113 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 763 transitions. Word has length 23 [2021-10-13 00:29:48,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:48,113 INFO L470 AbstractCegarLoop]: Abstraction has 566 states and 763 transitions. [2021-10-13 00:29:48,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:48,113 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 763 transitions. [2021-10-13 00:29:48,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-13 00:29:48,114 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:48,114 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:48,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 00:29:48,115 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 00:29:48,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:48,115 INFO L82 PathProgramCache]: Analyzing trace with hash -2139092952, now seen corresponding path program 1 times [2021-10-13 00:29:48,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:48,115 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089236974] [2021-10-13 00:29:48,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:48,116 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:48,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:29:48,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:48,170 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089236974] [2021-10-13 00:29:48,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089236974] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:48,171 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:48,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:29:48,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071851508] [2021-10-13 00:29:48,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:29:48,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:48,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:29:48,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:29:48,172 INFO L87 Difference]: Start difference. First operand 566 states and 763 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:48,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:48,356 INFO L93 Difference]: Finished difference Result 578 states and 773 transitions. [2021-10-13 00:29:48,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:29:48,356 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-13 00:29:48,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:48,360 INFO L225 Difference]: With dead ends: 578 [2021-10-13 00:29:48,360 INFO L226 Difference]: Without dead ends: 569 [2021-10-13 00:29:48,360 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:29:48,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2021-10-13 00:29:48,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 566. [2021-10-13 00:29:48,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 546 states have (on average 1.3937728937728937) internal successors, (761), 565 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:48,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 761 transitions. [2021-10-13 00:29:48,411 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 761 transitions. Word has length 24 [2021-10-13 00:29:48,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:48,411 INFO L470 AbstractCegarLoop]: Abstraction has 566 states and 761 transitions. [2021-10-13 00:29:48,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:48,411 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 761 transitions. [2021-10-13 00:29:48,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 00:29:48,412 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:48,412 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:48,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 00:29:48,413 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 00:29:48,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:48,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1167485085, now seen corresponding path program 1 times [2021-10-13 00:29:48,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:48,413 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681167127] [2021-10-13 00:29:48,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:48,414 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:48,442 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-13 00:29:48,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:48,442 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681167127] [2021-10-13 00:29:48,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681167127] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:48,443 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:48,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:29:48,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484533551] [2021-10-13 00:29:48,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:29:48,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:48,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:29:48,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:48,444 INFO L87 Difference]: Start difference. First operand 566 states and 761 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:48,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:48,643 INFO L93 Difference]: Finished difference Result 768 states and 1029 transitions. [2021-10-13 00:29:48,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:29:48,644 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-13 00:29:48,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:48,648 INFO L225 Difference]: With dead ends: 768 [2021-10-13 00:29:48,648 INFO L226 Difference]: Without dead ends: 760 [2021-10-13 00:29:48,649 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:48,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2021-10-13 00:29:48,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 584. [2021-10-13 00:29:48,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 564 states have (on average 1.3971631205673758) internal successors, (788), 583 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:48,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 788 transitions. [2021-10-13 00:29:48,689 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 788 transitions. Word has length 25 [2021-10-13 00:29:48,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:48,690 INFO L470 AbstractCegarLoop]: Abstraction has 584 states and 788 transitions. [2021-10-13 00:29:48,690 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-13 00:29:48,690 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 788 transitions. [2021-10-13 00:29:48,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 00:29:48,691 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:48,691 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:48,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 00:29:48,691 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 00:29:48,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:48,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1184010678, now seen corresponding path program 1 times [2021-10-13 00:29:48,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:48,692 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249815507] [2021-10-13 00:29:48,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:48,692 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:48,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:29:48,720 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:48,720 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249815507] [2021-10-13 00:29:48,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249815507] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:48,721 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:48,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:29:48,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555831745] [2021-10-13 00:29:48,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:29:48,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:48,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:29:48,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:48,722 INFO L87 Difference]: Start difference. First operand 584 states and 788 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:48,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:48,880 INFO L93 Difference]: Finished difference Result 584 states and 788 transitions. [2021-10-13 00:29:48,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:29:48,880 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-13 00:29:48,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:48,884 INFO L225 Difference]: With dead ends: 584 [2021-10-13 00:29:48,884 INFO L226 Difference]: Without dead ends: 572 [2021-10-13 00:29:48,884 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:48,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2021-10-13 00:29:48,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2021-10-13 00:29:48,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 558 states have (on average 1.3888888888888888) internal successors, (775), 571 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:48,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 775 transitions. [2021-10-13 00:29:48,921 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 775 transitions. Word has length 25 [2021-10-13 00:29:48,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:48,921 INFO L470 AbstractCegarLoop]: Abstraction has 572 states and 775 transitions. [2021-10-13 00:29:48,921 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-13 00:29:48,921 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 775 transitions. [2021-10-13 00:29:48,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 00:29:48,922 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:48,922 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:48,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 00:29:48,923 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 00:29:48,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:48,923 INFO L82 PathProgramCache]: Analyzing trace with hash 2043637155, now seen corresponding path program 1 times [2021-10-13 00:29:48,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:48,923 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906147015] [2021-10-13 00:29:48,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:48,924 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:48,954 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-13 00:29:48,954 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:48,954 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906147015] [2021-10-13 00:29:48,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906147015] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:48,955 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:48,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:29:48,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118392058] [2021-10-13 00:29:48,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:29:48,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:48,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:29:48,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:29:48,956 INFO L87 Difference]: Start difference. First operand 572 states and 775 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:49,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:49,025 INFO L93 Difference]: Finished difference Result 585 states and 787 transitions. [2021-10-13 00:29:49,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:29:49,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-10-13 00:29:49,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:49,029 INFO L225 Difference]: With dead ends: 585 [2021-10-13 00:29:49,029 INFO L226 Difference]: Without dead ends: 570 [2021-10-13 00:29:49,030 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:29:49,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2021-10-13 00:29:49,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2021-10-13 00:29:49,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 556 states have (on average 1.3884892086330936) internal successors, (772), 569 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:49,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 772 transitions. [2021-10-13 00:29:49,073 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 772 transitions. Word has length 25 [2021-10-13 00:29:49,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:49,073 INFO L470 AbstractCegarLoop]: Abstraction has 570 states and 772 transitions. [2021-10-13 00:29:49,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:49,074 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 772 transitions. [2021-10-13 00:29:49,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-13 00:29:49,075 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:49,075 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:49,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 00:29:49,075 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 00:29:49,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:49,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1824640765, now seen corresponding path program 1 times [2021-10-13 00:29:49,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:49,076 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324517827] [2021-10-13 00:29:49,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:49,077 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:49,135 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-13 00:29:49,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:49,135 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324517827] [2021-10-13 00:29:49,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324517827] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:49,136 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:49,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:29:49,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203980930] [2021-10-13 00:29:49,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:29:49,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:49,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:29:49,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:29:49,138 INFO L87 Difference]: Start difference. First operand 570 states and 772 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:49,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:49,382 INFO L93 Difference]: Finished difference Result 870 states and 1155 transitions. [2021-10-13 00:29:49,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:29:49,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-10-13 00:29:49,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:49,386 INFO L225 Difference]: With dead ends: 870 [2021-10-13 00:29:49,386 INFO L226 Difference]: Without dead ends: 611 [2021-10-13 00:29:49,387 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:29:49,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2021-10-13 00:29:49,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 553. [2021-10-13 00:29:49,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 540 states have (on average 1.362962962962963) internal successors, (736), 552 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:49,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 736 transitions. [2021-10-13 00:29:49,429 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 736 transitions. Word has length 26 [2021-10-13 00:29:49,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:49,430 INFO L470 AbstractCegarLoop]: Abstraction has 553 states and 736 transitions. [2021-10-13 00:29:49,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:49,430 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 736 transitions. [2021-10-13 00:29:49,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-13 00:29:49,431 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:49,431 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:49,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 00:29:49,432 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 00:29:49,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:49,432 INFO L82 PathProgramCache]: Analyzing trace with hash -944626100, now seen corresponding path program 1 times [2021-10-13 00:29:49,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:49,433 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254847993] [2021-10-13 00:29:49,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:49,433 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:49,467 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-13 00:29:49,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:49,467 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254847993] [2021-10-13 00:29:49,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254847993] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:49,468 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:49,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:29:49,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128087898] [2021-10-13 00:29:49,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:29:49,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:49,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:29:49,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:49,470 INFO L87 Difference]: Start difference. First operand 553 states and 736 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:49,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:49,613 INFO L93 Difference]: Finished difference Result 761 states and 1012 transitions. [2021-10-13 00:29:49,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:29:49,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-10-13 00:29:49,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:49,616 INFO L225 Difference]: With dead ends: 761 [2021-10-13 00:29:49,617 INFO L226 Difference]: Without dead ends: 555 [2021-10-13 00:29:49,617 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:49,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2021-10-13 00:29:49,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2021-10-13 00:29:49,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 544 states have (on average 1.3584558823529411) internal successors, (739), 554 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:49,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 739 transitions. [2021-10-13 00:29:49,660 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 739 transitions. Word has length 28 [2021-10-13 00:29:49,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:49,660 INFO L470 AbstractCegarLoop]: Abstraction has 555 states and 739 transitions. [2021-10-13 00:29:49,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:49,661 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 739 transitions. [2021-10-13 00:29:49,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-13 00:29:49,661 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:49,662 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:49,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 00:29:49,662 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 00:29:49,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:49,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1312752221, now seen corresponding path program 1 times [2021-10-13 00:29:49,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:49,663 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749959006] [2021-10-13 00:29:49,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:49,663 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:49,703 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-13 00:29:49,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:49,703 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749959006] [2021-10-13 00:29:49,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749959006] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:49,704 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:49,704 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:29:49,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648156626] [2021-10-13 00:29:49,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:29:49,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:49,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:29:49,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:49,705 INFO L87 Difference]: Start difference. First operand 555 states and 739 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:49,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:49,768 INFO L93 Difference]: Finished difference Result 735 states and 969 transitions. [2021-10-13 00:29:49,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:29:49,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-13 00:29:49,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:49,772 INFO L225 Difference]: With dead ends: 735 [2021-10-13 00:29:49,772 INFO L226 Difference]: Without dead ends: 531 [2021-10-13 00:29:49,772 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:49,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2021-10-13 00:29:49,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 515. [2021-10-13 00:29:49,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 504 states have (on average 1.3511904761904763) internal successors, (681), 514 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:49,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 681 transitions. [2021-10-13 00:29:49,814 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 681 transitions. Word has length 29 [2021-10-13 00:29:49,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:49,814 INFO L470 AbstractCegarLoop]: Abstraction has 515 states and 681 transitions. [2021-10-13 00:29:49,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:49,815 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 681 transitions. [2021-10-13 00:29:49,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-13 00:29:49,816 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:49,816 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:49,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 00:29:49,816 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 00:29:49,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:49,817 INFO L82 PathProgramCache]: Analyzing trace with hash 259846608, now seen corresponding path program 1 times [2021-10-13 00:29:49,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:49,817 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319439625] [2021-10-13 00:29:49,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:49,818 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:49,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:29:49,862 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:49,862 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319439625] [2021-10-13 00:29:49,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319439625] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:49,863 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:49,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:29:49,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60425401] [2021-10-13 00:29:49,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 00:29:49,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:49,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 00:29:49,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:29:49,864 INFO L87 Difference]: Start difference. First operand 515 states and 681 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:50,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:50,147 INFO L93 Difference]: Finished difference Result 1326 states and 1752 transitions. [2021-10-13 00:29:50,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:29:50,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-10-13 00:29:50,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:50,153 INFO L225 Difference]: With dead ends: 1326 [2021-10-13 00:29:50,153 INFO L226 Difference]: Without dead ends: 1054 [2021-10-13 00:29:50,154 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 21.3ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:29:50,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2021-10-13 00:29:50,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 554. [2021-10-13 00:29:50,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 543 states have (on average 1.3609576427255985) internal successors, (739), 553 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:50,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 739 transitions. [2021-10-13 00:29:50,203 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 739 transitions. Word has length 32 [2021-10-13 00:29:50,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:50,203 INFO L470 AbstractCegarLoop]: Abstraction has 554 states and 739 transitions. [2021-10-13 00:29:50,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:50,204 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 739 transitions. [2021-10-13 00:29:50,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-13 00:29:50,205 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:50,205 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:50,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 00:29:50,205 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 00:29:50,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:50,206 INFO L82 PathProgramCache]: Analyzing trace with hash 175699761, now seen corresponding path program 1 times [2021-10-13 00:29:50,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:50,206 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611277871] [2021-10-13 00:29:50,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:50,206 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:50,238 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-13 00:29:50,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:50,239 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611277871] [2021-10-13 00:29:50,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611277871] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:50,239 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:50,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:29:50,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615474474] [2021-10-13 00:29:50,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:29:50,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:50,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:29:50,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:50,241 INFO L87 Difference]: Start difference. First operand 554 states and 739 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:50,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:50,327 INFO L93 Difference]: Finished difference Result 814 states and 1074 transitions. [2021-10-13 00:29:50,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:29:50,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-10-13 00:29:50,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:50,330 INFO L225 Difference]: With dead ends: 814 [2021-10-13 00:29:50,331 INFO L226 Difference]: Without dead ends: 615 [2021-10-13 00:29:50,331 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:50,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2021-10-13 00:29:50,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 542. [2021-10-13 00:29:50,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 534 states have (on average 1.350187265917603) internal successors, (721), 541 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:50,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 721 transitions. [2021-10-13 00:29:50,375 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 721 transitions. Word has length 33 [2021-10-13 00:29:50,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:50,375 INFO L470 AbstractCegarLoop]: Abstraction has 542 states and 721 transitions. [2021-10-13 00:29:50,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:50,376 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 721 transitions. [2021-10-13 00:29:50,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-13 00:29:50,377 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:50,377 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:50,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-13 00:29:50,377 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 00:29:50,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:50,378 INFO L82 PathProgramCache]: Analyzing trace with hash -744399452, now seen corresponding path program 1 times [2021-10-13 00:29:50,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:50,378 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880194042] [2021-10-13 00:29:50,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:50,378 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:50,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:29:50,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:50,421 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880194042] [2021-10-13 00:29:50,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880194042] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:50,421 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:50,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:29:50,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527232809] [2021-10-13 00:29:50,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:29:50,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:50,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:29:50,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:29:50,423 INFO L87 Difference]: Start difference. First operand 542 states and 721 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:50,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:50,611 INFO L93 Difference]: Finished difference Result 637 states and 833 transitions. [2021-10-13 00:29:50,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:29:50,611 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-13 00:29:50,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:50,615 INFO L225 Difference]: With dead ends: 637 [2021-10-13 00:29:50,615 INFO L226 Difference]: Without dead ends: 571 [2021-10-13 00:29:50,615 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:29:50,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2021-10-13 00:29:50,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 542. [2021-10-13 00:29:50,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 534 states have (on average 1.3239700374531835) internal successors, (707), 541 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:50,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 707 transitions. [2021-10-13 00:29:50,683 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 707 transitions. Word has length 33 [2021-10-13 00:29:50,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:50,684 INFO L470 AbstractCegarLoop]: Abstraction has 542 states and 707 transitions. [2021-10-13 00:29:50,684 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-13 00:29:50,684 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 707 transitions. [2021-10-13 00:29:50,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-13 00:29:50,686 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:50,686 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:50,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-13 00:29:50,686 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 00:29:50,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:50,687 INFO L82 PathProgramCache]: Analyzing trace with hash 536662182, now seen corresponding path program 1 times [2021-10-13 00:29:50,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:50,687 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785776013] [2021-10-13 00:29:50,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:50,688 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:50,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:29:50,732 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:50,732 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785776013] [2021-10-13 00:29:50,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785776013] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:50,733 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:50,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:29:50,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692411301] [2021-10-13 00:29:50,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 00:29:50,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:50,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 00:29:50,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:29:50,736 INFO L87 Difference]: Start difference. First operand 542 states and 707 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:50,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:50,827 INFO L93 Difference]: Finished difference Result 562 states and 727 transitions. [2021-10-13 00:29:50,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 00:29:50,828 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-10-13 00:29:50,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:50,831 INFO L225 Difference]: With dead ends: 562 [2021-10-13 00:29:50,831 INFO L226 Difference]: Without dead ends: 543 [2021-10-13 00:29:50,832 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.2ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:29:50,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2021-10-13 00:29:50,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 540. [2021-10-13 00:29:50,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 532 states have (on average 1.3195488721804511) internal successors, (702), 539 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:50,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 702 transitions. [2021-10-13 00:29:50,890 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 702 transitions. Word has length 34 [2021-10-13 00:29:50,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:50,890 INFO L470 AbstractCegarLoop]: Abstraction has 540 states and 702 transitions. [2021-10-13 00:29:50,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:50,890 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 702 transitions. [2021-10-13 00:29:50,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-13 00:29:50,891 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:50,891 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:50,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-13 00:29:50,892 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 00:29:50,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:50,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1675490409, now seen corresponding path program 1 times [2021-10-13 00:29:50,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:50,893 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298833650] [2021-10-13 00:29:50,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:50,893 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:50,918 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-13 00:29:50,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:50,919 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298833650] [2021-10-13 00:29:50,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298833650] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:50,919 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:50,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:29:50,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936614545] [2021-10-13 00:29:50,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:29:50,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:50,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:29:50,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:50,921 INFO L87 Difference]: Start difference. First operand 540 states and 702 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:51,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:51,011 INFO L93 Difference]: Finished difference Result 759 states and 970 transitions. [2021-10-13 00:29:51,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:29:51,012 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-13 00:29:51,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:51,016 INFO L225 Difference]: With dead ends: 759 [2021-10-13 00:29:51,016 INFO L226 Difference]: Without dead ends: 650 [2021-10-13 00:29:51,017 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:51,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2021-10-13 00:29:51,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 541. [2021-10-13 00:29:51,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 533 states have (on average 1.3189493433395871) internal successors, (703), 540 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:51,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 703 transitions. [2021-10-13 00:29:51,069 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 703 transitions. Word has length 34 [2021-10-13 00:29:51,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:51,069 INFO L470 AbstractCegarLoop]: Abstraction has 541 states and 703 transitions. [2021-10-13 00:29:51,069 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-13 00:29:51,069 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 703 transitions. [2021-10-13 00:29:51,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-13 00:29:51,070 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:51,071 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:51,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-13 00:29:51,071 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 00:29:51,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:51,072 INFO L82 PathProgramCache]: Analyzing trace with hash -930533145, now seen corresponding path program 1 times [2021-10-13 00:29:51,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:51,072 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764236837] [2021-10-13 00:29:51,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:51,072 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:51,108 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-13 00:29:51,109 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:51,109 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764236837] [2021-10-13 00:29:51,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764236837] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:51,109 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:51,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:29:51,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33629401] [2021-10-13 00:29:51,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:29:51,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:51,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:29:51,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:29:51,111 INFO L87 Difference]: Start difference. First operand 541 states and 703 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:51,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:51,203 INFO L93 Difference]: Finished difference Result 1236 states and 1594 transitions. [2021-10-13 00:29:51,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:29:51,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-10-13 00:29:51,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:51,208 INFO L225 Difference]: With dead ends: 1236 [2021-10-13 00:29:51,208 INFO L226 Difference]: Without dead ends: 704 [2021-10-13 00:29:51,211 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:29:51,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2021-10-13 00:29:51,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 600. [2021-10-13 00:29:51,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 592 states have (on average 1.3057432432432432) internal successors, (773), 599 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:51,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 773 transitions. [2021-10-13 00:29:51,274 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 773 transitions. Word has length 34 [2021-10-13 00:29:51,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:51,274 INFO L470 AbstractCegarLoop]: Abstraction has 600 states and 773 transitions. [2021-10-13 00:29:51,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:51,275 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 773 transitions. [2021-10-13 00:29:51,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-13 00:29:51,276 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:51,276 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:51,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-13 00:29:51,277 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 00:29:51,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:51,277 INFO L82 PathProgramCache]: Analyzing trace with hash -992572759, now seen corresponding path program 1 times [2021-10-13 00:29:51,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:51,277 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245916046] [2021-10-13 00:29:51,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:51,278 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:51,428 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-13 00:29:51,428 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:51,428 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245916046] [2021-10-13 00:29:51,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245916046] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:51,429 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:51,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:29:51,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199640957] [2021-10-13 00:29:51,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:29:51,431 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:51,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:29:51,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:29:51,432 INFO L87 Difference]: Start difference. First operand 600 states and 773 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:51,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:51,588 INFO L93 Difference]: Finished difference Result 789 states and 1014 transitions. [2021-10-13 00:29:51,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:29:51,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-10-13 00:29:51,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:51,592 INFO L225 Difference]: With dead ends: 789 [2021-10-13 00:29:51,592 INFO L226 Difference]: Without dead ends: 570 [2021-10-13 00:29:51,593 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:29:51,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2021-10-13 00:29:51,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 565. [2021-10-13 00:29:51,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 558 states have (on average 1.2939068100358424) internal successors, (722), 564 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:51,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 722 transitions. [2021-10-13 00:29:51,689 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 722 transitions. Word has length 34 [2021-10-13 00:29:51,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:51,690 INFO L470 AbstractCegarLoop]: Abstraction has 565 states and 722 transitions. [2021-10-13 00:29:51,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:51,690 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 722 transitions. [2021-10-13 00:29:51,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-13 00:29:51,691 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:51,692 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:51,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-13 00:29:51,692 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 00:29:51,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:51,693 INFO L82 PathProgramCache]: Analyzing trace with hash 813687739, now seen corresponding path program 1 times [2021-10-13 00:29:51,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:51,693 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592456985] [2021-10-13 00:29:51,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:51,693 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:51,753 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-13 00:29:51,754 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:51,754 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592456985] [2021-10-13 00:29:51,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592456985] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:51,754 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:51,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:29:51,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150238391] [2021-10-13 00:29:51,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:29:51,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:51,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:29:51,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:29:51,756 INFO L87 Difference]: Start difference. First operand 565 states and 722 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:51,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:51,918 INFO L93 Difference]: Finished difference Result 637 states and 807 transitions. [2021-10-13 00:29:51,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:29:51,918 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-13 00:29:51,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:51,921 INFO L225 Difference]: With dead ends: 637 [2021-10-13 00:29:51,921 INFO L226 Difference]: Without dead ends: 538 [2021-10-13 00:29:51,922 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:29:51,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2021-10-13 00:29:51,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 522. [2021-10-13 00:29:51,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 515 states have (on average 1.2699029126213592) internal successors, (654), 521 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:51,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 654 transitions. [2021-10-13 00:29:51,981 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 654 transitions. Word has length 35 [2021-10-13 00:29:51,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:51,982 INFO L470 AbstractCegarLoop]: Abstraction has 522 states and 654 transitions. [2021-10-13 00:29:51,982 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-13 00:29:51,982 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 654 transitions. [2021-10-13 00:29:51,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-13 00:29:51,983 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:51,983 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:51,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-13 00:29:51,984 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 00:29:51,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:51,984 INFO L82 PathProgramCache]: Analyzing trace with hash -759040003, now seen corresponding path program 1 times [2021-10-13 00:29:51,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:51,985 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495075243] [2021-10-13 00:29:51,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:51,985 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:52,014 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-13 00:29:52,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:52,015 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495075243] [2021-10-13 00:29:52,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495075243] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:52,015 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:52,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:29:52,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40006238] [2021-10-13 00:29:52,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:29:52,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:52,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:29:52,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:52,018 INFO L87 Difference]: Start difference. First operand 522 states and 654 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:52,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:52,138 INFO L93 Difference]: Finished difference Result 542 states and 671 transitions. [2021-10-13 00:29:52,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:29:52,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-10-13 00:29:52,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:52,147 INFO L225 Difference]: With dead ends: 542 [2021-10-13 00:29:52,147 INFO L226 Difference]: Without dead ends: 521 [2021-10-13 00:29:52,147 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:52,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2021-10-13 00:29:52,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 515. [2021-10-13 00:29:52,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 509 states have (on average 1.2593320235756384) internal successors, (641), 514 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:52,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 641 transitions. [2021-10-13 00:29:52,208 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 641 transitions. Word has length 35 [2021-10-13 00:29:52,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:52,208 INFO L470 AbstractCegarLoop]: Abstraction has 515 states and 641 transitions. [2021-10-13 00:29:52,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:52,209 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 641 transitions. [2021-10-13 00:29:52,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-13 00:29:52,210 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:52,210 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:52,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-13 00:29:52,212 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 00:29:52,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:52,213 INFO L82 PathProgramCache]: Analyzing trace with hash 111409610, now seen corresponding path program 1 times [2021-10-13 00:29:52,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:52,213 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497804497] [2021-10-13 00:29:52,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:52,213 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:52,268 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-13 00:29:52,268 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:52,269 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497804497] [2021-10-13 00:29:52,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497804497] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:52,269 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:52,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:29:52,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969977547] [2021-10-13 00:29:52,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:29:52,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:52,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:29:52,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:29:52,270 INFO L87 Difference]: Start difference. First operand 515 states and 641 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:52,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:52,452 INFO L93 Difference]: Finished difference Result 720 states and 898 transitions. [2021-10-13 00:29:52,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:29:52,453 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-13 00:29:52,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:52,456 INFO L225 Difference]: With dead ends: 720 [2021-10-13 00:29:52,456 INFO L226 Difference]: Without dead ends: 536 [2021-10-13 00:29:52,457 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:29:52,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2021-10-13 00:29:52,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 512. [2021-10-13 00:29:52,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 506 states have (on average 1.2490118577075098) internal successors, (632), 511 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:52,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 632 transitions. [2021-10-13 00:29:52,514 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 632 transitions. Word has length 35 [2021-10-13 00:29:52,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:52,514 INFO L470 AbstractCegarLoop]: Abstraction has 512 states and 632 transitions. [2021-10-13 00:29:52,514 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-13 00:29:52,514 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 632 transitions. [2021-10-13 00:29:52,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-13 00:29:52,515 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:52,515 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:52,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-13 00:29:52,516 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 00:29:52,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:52,516 INFO L82 PathProgramCache]: Analyzing trace with hash -949179113, now seen corresponding path program 1 times [2021-10-13 00:29:52,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:52,517 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802553773] [2021-10-13 00:29:52,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:52,517 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:52,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:52,540 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-13 00:29:52,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:52,540 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802553773] [2021-10-13 00:29:52,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802553773] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:52,541 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:52,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:29:52,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607361264] [2021-10-13 00:29:52,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:29:52,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:52,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:29:52,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:52,542 INFO L87 Difference]: Start difference. First operand 512 states and 632 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:52,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:52,611 INFO L93 Difference]: Finished difference Result 536 states and 657 transitions. [2021-10-13 00:29:52,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:29:52,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-13 00:29:52,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:52,614 INFO L225 Difference]: With dead ends: 536 [2021-10-13 00:29:52,615 INFO L226 Difference]: Without dead ends: 512 [2021-10-13 00:29:52,615 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:52,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2021-10-13 00:29:52,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 511. [2021-10-13 00:29:52,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 505 states have (on average 1.2396039603960396) internal successors, (626), 510 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:52,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 626 transitions. [2021-10-13 00:29:52,674 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 626 transitions. Word has length 36 [2021-10-13 00:29:52,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:52,675 INFO L470 AbstractCegarLoop]: Abstraction has 511 states and 626 transitions. [2021-10-13 00:29:52,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:52,675 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 626 transitions. [2021-10-13 00:29:52,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-13 00:29:52,676 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:52,676 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:52,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-13 00:29:52,677 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 00:29:52,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:52,677 INFO L82 PathProgramCache]: Analyzing trace with hash -2037812492, now seen corresponding path program 1 times [2021-10-13 00:29:52,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:52,677 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528962595] [2021-10-13 00:29:52,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:52,678 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:52,715 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-13 00:29:52,715 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:52,715 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528962595] [2021-10-13 00:29:52,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528962595] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:52,716 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:52,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 00:29:52,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484077518] [2021-10-13 00:29:52,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 00:29:52,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:52,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:29:52,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:29:52,718 INFO L87 Difference]: Start difference. First operand 511 states and 626 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:52,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:52,909 INFO L93 Difference]: Finished difference Result 529 states and 642 transitions. [2021-10-13 00:29:52,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:29:52,910 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-13 00:29:52,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:52,913 INFO L225 Difference]: With dead ends: 529 [2021-10-13 00:29:52,913 INFO L226 Difference]: Without dead ends: 526 [2021-10-13 00:29:52,914 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.5ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-13 00:29:52,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2021-10-13 00:29:52,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 517. [2021-10-13 00:29:52,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 511 states have (on average 1.2367906066536203) internal successors, (632), 516 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:52,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 632 transitions. [2021-10-13 00:29:52,995 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 632 transitions. Word has length 36 [2021-10-13 00:29:52,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:52,995 INFO L470 AbstractCegarLoop]: Abstraction has 517 states and 632 transitions. [2021-10-13 00:29:52,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:52,995 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 632 transitions. [2021-10-13 00:29:52,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-13 00:29:52,996 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:52,996 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:52,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-13 00:29:52,997 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 00:29:52,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:52,997 INFO L82 PathProgramCache]: Analyzing trace with hash -2037824408, now seen corresponding path program 1 times [2021-10-13 00:29:52,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:52,998 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651136304] [2021-10-13 00:29:52,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:52,998 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:53,038 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-13 00:29:53,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:53,039 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651136304] [2021-10-13 00:29:53,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651136304] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:53,039 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:53,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:29:53,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382947728] [2021-10-13 00:29:53,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:29:53,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:53,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:29:53,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:29:53,041 INFO L87 Difference]: Start difference. First operand 517 states and 632 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:53,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:53,187 INFO L93 Difference]: Finished difference Result 526 states and 639 transitions. [2021-10-13 00:29:53,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:29:53,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-13 00:29:53,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:53,190 INFO L225 Difference]: With dead ends: 526 [2021-10-13 00:29:53,191 INFO L226 Difference]: Without dead ends: 501 [2021-10-13 00:29:53,191 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:29:53,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2021-10-13 00:29:53,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 497. [2021-10-13 00:29:53,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 491 states have (on average 1.2382892057026476) internal successors, (608), 496 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:53,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 608 transitions. [2021-10-13 00:29:53,250 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 608 transitions. Word has length 36 [2021-10-13 00:29:53,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:53,250 INFO L470 AbstractCegarLoop]: Abstraction has 497 states and 608 transitions. [2021-10-13 00:29:53,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:53,251 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 608 transitions. [2021-10-13 00:29:53,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-13 00:29:53,251 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:53,252 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:53,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-13 00:29:53,252 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 00:29:53,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:53,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1481841291, now seen corresponding path program 1 times [2021-10-13 00:29:53,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:53,253 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133217023] [2021-10-13 00:29:53,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:53,253 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:53,284 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-13 00:29:53,284 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:53,284 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133217023] [2021-10-13 00:29:53,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133217023] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:53,285 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:53,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:29:53,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042082890] [2021-10-13 00:29:53,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:29:53,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:53,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:29:53,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:29:53,286 INFO L87 Difference]: Start difference. First operand 497 states and 608 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:53,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:53,358 INFO L93 Difference]: Finished difference Result 513 states and 622 transitions. [2021-10-13 00:29:53,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 00:29:53,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-13 00:29:53,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:53,362 INFO L225 Difference]: With dead ends: 513 [2021-10-13 00:29:53,362 INFO L226 Difference]: Without dead ends: 492 [2021-10-13 00:29:53,362 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:29:53,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2021-10-13 00:29:53,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 480. [2021-10-13 00:29:53,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 474 states have (on average 1.240506329113924) internal successors, (588), 479 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:53,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 588 transitions. [2021-10-13 00:29:53,421 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 588 transitions. Word has length 38 [2021-10-13 00:29:53,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:53,422 INFO L470 AbstractCegarLoop]: Abstraction has 480 states and 588 transitions. [2021-10-13 00:29:53,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:53,422 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 588 transitions. [2021-10-13 00:29:53,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-13 00:29:53,423 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:53,423 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:53,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-13 00:29:53,424 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 00:29:53,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:53,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1021756590, now seen corresponding path program 1 times [2021-10-13 00:29:53,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:53,425 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076388938] [2021-10-13 00:29:53,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:53,425 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:53,468 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-13 00:29:53,469 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:53,469 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076388938] [2021-10-13 00:29:53,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076388938] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:53,469 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:53,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:29:53,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271369941] [2021-10-13 00:29:53,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:29:53,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:53,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:29:53,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:53,471 INFO L87 Difference]: Start difference. First operand 480 states and 588 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:53,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:53,611 INFO L93 Difference]: Finished difference Result 839 states and 1026 transitions. [2021-10-13 00:29:53,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:29:53,613 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-13 00:29:53,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:53,617 INFO L225 Difference]: With dead ends: 839 [2021-10-13 00:29:53,617 INFO L226 Difference]: Without dead ends: 658 [2021-10-13 00:29:53,618 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:53,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2021-10-13 00:29:53,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 483. [2021-10-13 00:29:53,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 477 states have (on average 1.2389937106918238) internal successors, (591), 482 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:53,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 591 transitions. [2021-10-13 00:29:53,680 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 591 transitions. Word has length 38 [2021-10-13 00:29:53,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:53,681 INFO L470 AbstractCegarLoop]: Abstraction has 483 states and 591 transitions. [2021-10-13 00:29:53,681 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-13 00:29:53,681 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 591 transitions. [2021-10-13 00:29:53,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-13 00:29:53,682 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:53,682 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:53,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-13 00:29:53,683 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 00:29:53,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:53,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1329794158, now seen corresponding path program 1 times [2021-10-13 00:29:53,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:53,684 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485622341] [2021-10-13 00:29:53,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:53,684 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:53,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:53,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:29:53,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:53,735 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485622341] [2021-10-13 00:29:53,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485622341] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:53,736 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:53,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:29:53,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731989709] [2021-10-13 00:29:53,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 00:29:53,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:53,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 00:29:53,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:29:53,737 INFO L87 Difference]: Start difference. First operand 483 states and 591 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:53,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:53,946 INFO L93 Difference]: Finished difference Result 824 states and 994 transitions. [2021-10-13 00:29:53,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 00:29:53,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-13 00:29:53,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:53,950 INFO L225 Difference]: With dead ends: 824 [2021-10-13 00:29:53,950 INFO L226 Difference]: Without dead ends: 668 [2021-10-13 00:29:53,951 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.8ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:29:53,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2021-10-13 00:29:54,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 483. [2021-10-13 00:29:54,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 477 states have (on average 1.230607966457023) internal successors, (587), 482 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:54,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 587 transitions. [2021-10-13 00:29:54,035 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 587 transitions. Word has length 38 [2021-10-13 00:29:54,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:54,036 INFO L470 AbstractCegarLoop]: Abstraction has 483 states and 587 transitions. [2021-10-13 00:29:54,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:54,036 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 587 transitions. [2021-10-13 00:29:54,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-13 00:29:54,037 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:54,038 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:54,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-13 00:29:54,038 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 00:29:54,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:54,039 INFO L82 PathProgramCache]: Analyzing trace with hash 595887759, now seen corresponding path program 1 times [2021-10-13 00:29:54,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:54,039 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494096557] [2021-10-13 00:29:54,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:54,040 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:54,097 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-13 00:29:54,097 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:54,097 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494096557] [2021-10-13 00:29:54,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494096557] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:54,098 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:54,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:29:54,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221509747] [2021-10-13 00:29:54,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 00:29:54,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:54,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 00:29:54,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:29:54,100 INFO L87 Difference]: Start difference. First operand 483 states and 587 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:54,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:54,382 INFO L93 Difference]: Finished difference Result 946 states and 1156 transitions. [2021-10-13 00:29:54,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:29:54,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-10-13 00:29:54,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:54,387 INFO L225 Difference]: With dead ends: 946 [2021-10-13 00:29:54,387 INFO L226 Difference]: Without dead ends: 816 [2021-10-13 00:29:54,388 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 34.9ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:29:54,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2021-10-13 00:29:54,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 483. [2021-10-13 00:29:54,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 477 states have (on average 1.228511530398323) internal successors, (586), 482 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:54,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 586 transitions. [2021-10-13 00:29:54,456 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 586 transitions. Word has length 41 [2021-10-13 00:29:54,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:54,456 INFO L470 AbstractCegarLoop]: Abstraction has 483 states and 586 transitions. [2021-10-13 00:29:54,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:54,457 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 586 transitions. [2021-10-13 00:29:54,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-13 00:29:54,458 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:54,458 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:54,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-13 00:29:54,458 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 00:29:54,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:54,459 INFO L82 PathProgramCache]: Analyzing trace with hash 768333102, now seen corresponding path program 1 times [2021-10-13 00:29:54,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:54,459 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828759430] [2021-10-13 00:29:54,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:54,460 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:54,502 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-13 00:29:54,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:54,503 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828759430] [2021-10-13 00:29:54,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828759430] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:54,503 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:54,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 00:29:54,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736018315] [2021-10-13 00:29:54,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 00:29:54,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:54,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 00:29:54,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:29:54,505 INFO L87 Difference]: Start difference. First operand 483 states and 586 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:54,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:54,713 INFO L93 Difference]: Finished difference Result 501 states and 603 transitions. [2021-10-13 00:29:54,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 00:29:54,713 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-10-13 00:29:54,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:54,715 INFO L225 Difference]: With dead ends: 501 [2021-10-13 00:29:54,716 INFO L226 Difference]: Without dead ends: 385 [2021-10-13 00:29:54,716 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.4ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-13 00:29:54,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2021-10-13 00:29:54,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 367. [2021-10-13 00:29:54,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 362 states have (on average 1.2320441988950277) internal successors, (446), 366 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:54,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 446 transitions. [2021-10-13 00:29:54,768 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 446 transitions. Word has length 41 [2021-10-13 00:29:54,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:54,769 INFO L470 AbstractCegarLoop]: Abstraction has 367 states and 446 transitions. [2021-10-13 00:29:54,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:54,769 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 446 transitions. [2021-10-13 00:29:54,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-13 00:29:54,770 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:54,770 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:54,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-13 00:29:54,770 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 00:29:54,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:54,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1022149612, now seen corresponding path program 1 times [2021-10-13 00:29:54,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:54,771 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678208903] [2021-10-13 00:29:54,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:54,772 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:54,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-13 00:29:54,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:54,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678208903] [2021-10-13 00:29:54,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678208903] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:54,799 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:54,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:29:54,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714707499] [2021-10-13 00:29:54,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:29:54,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:54,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:29:54,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:54,800 INFO L87 Difference]: Start difference. First operand 367 states and 446 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:54,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:54,913 INFO L93 Difference]: Finished difference Result 500 states and 615 transitions. [2021-10-13 00:29:54,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:29:54,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-10-13 00:29:54,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:54,915 INFO L225 Difference]: With dead ends: 500 [2021-10-13 00:29:54,916 INFO L226 Difference]: Without dead ends: 329 [2021-10-13 00:29:54,916 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:54,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2021-10-13 00:29:54,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2021-10-13 00:29:54,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 326 states have (on average 1.2177914110429449) internal successors, (397), 328 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:54,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 397 transitions. [2021-10-13 00:29:54,960 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 397 transitions. Word has length 45 [2021-10-13 00:29:54,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:54,961 INFO L470 AbstractCegarLoop]: Abstraction has 329 states and 397 transitions. [2021-10-13 00:29:54,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:54,961 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 397 transitions. [2021-10-13 00:29:54,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-13 00:29:54,962 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:54,962 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:54,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-13 00:29:54,963 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 00:29:54,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:54,963 INFO L82 PathProgramCache]: Analyzing trace with hash 632304062, now seen corresponding path program 1 times [2021-10-13 00:29:54,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:54,963 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080813113] [2021-10-13 00:29:54,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:54,964 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:55,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:29:55,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:55,013 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080813113] [2021-10-13 00:29:55,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080813113] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:55,013 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:55,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 00:29:55,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849736372] [2021-10-13 00:29:55,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 00:29:55,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:55,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 00:29:55,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:29:55,015 INFO L87 Difference]: Start difference. First operand 329 states and 397 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:55,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:55,211 INFO L93 Difference]: Finished difference Result 459 states and 546 transitions. [2021-10-13 00:29:55,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 00:29:55,212 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-10-13 00:29:55,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:55,215 INFO L225 Difference]: With dead ends: 459 [2021-10-13 00:29:55,215 INFO L226 Difference]: Without dead ends: 441 [2021-10-13 00:29:55,215 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 56.2ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-10-13 00:29:55,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2021-10-13 00:29:55,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 335. [2021-10-13 00:29:55,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 332 states have (on average 1.213855421686747) internal successors, (403), 334 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:55,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 403 transitions. [2021-10-13 00:29:55,264 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 403 transitions. Word has length 51 [2021-10-13 00:29:55,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:55,264 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 403 transitions. [2021-10-13 00:29:55,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:55,264 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 403 transitions. [2021-10-13 00:29:55,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-13 00:29:55,265 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:55,265 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:55,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-13 00:29:55,266 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 00:29:55,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:55,266 INFO L82 PathProgramCache]: Analyzing trace with hash -605199811, now seen corresponding path program 1 times [2021-10-13 00:29:55,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:55,267 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253859058] [2021-10-13 00:29:55,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:55,267 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:55,316 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-13 00:29:55,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:55,317 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253859058] [2021-10-13 00:29:55,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253859058] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:55,317 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:55,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 00:29:55,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320560504] [2021-10-13 00:29:55,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 00:29:55,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:55,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 00:29:55,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:29:55,319 INFO L87 Difference]: Start difference. First operand 335 states and 403 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:55,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:55,504 INFO L93 Difference]: Finished difference Result 464 states and 551 transitions. [2021-10-13 00:29:55,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:29:55,505 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-10-13 00:29:55,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:55,507 INFO L225 Difference]: With dead ends: 464 [2021-10-13 00:29:55,507 INFO L226 Difference]: Without dead ends: 446 [2021-10-13 00:29:55,508 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 42.4ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-13 00:29:55,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2021-10-13 00:29:55,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 329. [2021-10-13 00:29:55,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 326 states have (on average 1.2147239263803682) internal successors, (396), 328 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:55,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 396 transitions. [2021-10-13 00:29:55,556 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 396 transitions. Word has length 52 [2021-10-13 00:29:55,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:55,557 INFO L470 AbstractCegarLoop]: Abstraction has 329 states and 396 transitions. [2021-10-13 00:29:55,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:55,557 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 396 transitions. [2021-10-13 00:29:55,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-13 00:29:55,558 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:55,558 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:55,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-13 00:29:55,558 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 00:29:55,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:55,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1054423066, now seen corresponding path program 1 times [2021-10-13 00:29:55,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:55,559 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589800835] [2021-10-13 00:29:55,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:55,560 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:29:55,602 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-13 00:29:55,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:29:55,603 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589800835] [2021-10-13 00:29:55,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589800835] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:29:55,603 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:29:55,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:29:55,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456727940] [2021-10-13 00:29:55,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:29:55,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:29:55,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:29:55,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:55,605 INFO L87 Difference]: Start difference. First operand 329 states and 396 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:55,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:29:55,675 INFO L93 Difference]: Finished difference Result 575 states and 698 transitions. [2021-10-13 00:29:55,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:29:55,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-10-13 00:29:55,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:29:55,678 INFO L225 Difference]: With dead ends: 575 [2021-10-13 00:29:55,678 INFO L226 Difference]: Without dead ends: 383 [2021-10-13 00:29:55,679 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:29:55,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2021-10-13 00:29:55,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 329. [2021-10-13 00:29:55,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 326 states have (on average 1.2024539877300613) internal successors, (392), 328 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:55,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 392 transitions. [2021-10-13 00:29:55,727 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 392 transitions. Word has length 54 [2021-10-13 00:29:55,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:29:55,728 INFO L470 AbstractCegarLoop]: Abstraction has 329 states and 392 transitions. [2021-10-13 00:29:55,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:29:55,728 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 392 transitions. [2021-10-13 00:29:55,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-10-13 00:29:55,729 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:29:55,729 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:29:55,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-13 00:29:55,729 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2021-10-13 00:29:55,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:29:55,730 INFO L82 PathProgramCache]: Analyzing trace with hash 273758220, now seen corresponding path program 1 times [2021-10-13 00:29:55,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:29:55,730 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832718615] [2021-10-13 00:29:55,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:29:55,730 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:29:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:29:55,747 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:29:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:29:55,805 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:29:55,806 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-13 00:29:55,807 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,808 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,809 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,809 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,809 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,809 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,809 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,810 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,810 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,810 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,810 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,810 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,811 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,811 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,811 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,811 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,811 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,812 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,812 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,812 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,812 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,812 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,812 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,813 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,813 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,813 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,813 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,813 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,814 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,814 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,814 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,814 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,814 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,815 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,815 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,815 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,815 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,815 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,816 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,816 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,816 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:29:55,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-13 00:29:55,822 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 00:29:55,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:29:55 BoogieIcfgContainer [2021-10-13 00:29:55,966 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 00:29:55,967 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 00:29:55,967 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 00:29:55,967 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 00:29:55,968 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:29:45" (3/4) ... [2021-10-13 00:29:55,969 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-13 00:29:56,109 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45438020-1b08-4a87-bf90-b961836db963/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-13 00:29:56,111 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 00:29:56,112 INFO L168 Benchmark]: Toolchain (without parser) took 12341.93 ms. Allocated memory was 123.7 MB in the beginning and 348.1 MB in the end (delta: 224.4 MB). Free memory was 83.5 MB in the beginning and 215.6 MB in the end (delta: -132.1 MB). Peak memory consumption was 90.3 MB. Max. memory is 16.1 GB. [2021-10-13 00:29:56,113 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 123.7 MB. Free memory is still 100.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 00:29:56,113 INFO L168 Benchmark]: CACSL2BoogieTranslator took 527.15 ms. Allocated memory is still 123.7 MB. Free memory was 83.2 MB in the beginning and 90.1 MB in the end (delta: -6.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-13 00:29:56,114 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.02 ms. Allocated memory is still 123.7 MB. Free memory was 90.1 MB in the beginning and 82.5 MB in the end (delta: 7.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-13 00:29:56,114 INFO L168 Benchmark]: Boogie Preprocessor took 76.05 ms. Allocated memory is still 123.7 MB. Free memory was 82.5 MB in the beginning and 77.5 MB in the end (delta: 5.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 00:29:56,115 INFO L168 Benchmark]: RCFGBuilder took 1430.31 ms. Allocated memory is still 123.7 MB. Free memory was 77.5 MB in the beginning and 64.2 MB in the end (delta: 13.3 MB). Peak memory consumption was 43.7 MB. Max. memory is 16.1 GB. [2021-10-13 00:29:56,115 INFO L168 Benchmark]: TraceAbstraction took 10054.42 ms. Allocated memory was 123.7 MB in the beginning and 348.1 MB in the end (delta: 224.4 MB). Free memory was 63.7 MB in the beginning and 233.4 MB in the end (delta: -169.7 MB). Peak memory consumption was 55.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:29:56,116 INFO L168 Benchmark]: Witness Printer took 144.04 ms. Allocated memory is still 348.1 MB. Free memory was 233.4 MB in the beginning and 215.6 MB in the end (delta: 17.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-10-13 00:29:56,118 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.22 ms. Allocated memory is still 123.7 MB. Free memory is still 100.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 527.15 ms. Allocated memory is still 123.7 MB. Free memory was 83.2 MB in the beginning and 90.1 MB in the end (delta: -6.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 103.02 ms. Allocated memory is still 123.7 MB. Free memory was 90.1 MB in the beginning and 82.5 MB in the end (delta: 7.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 76.05 ms. Allocated memory is still 123.7 MB. Free memory was 82.5 MB in the beginning and 77.5 MB in the end (delta: 5.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1430.31 ms. Allocated memory is still 123.7 MB. Free memory was 77.5 MB in the beginning and 64.2 MB in the end (delta: 13.3 MB). Peak memory consumption was 43.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 10054.42 ms. Allocated memory was 123.7 MB in the beginning and 348.1 MB in the end (delta: 224.4 MB). Free memory was 63.7 MB in the beginning and 233.4 MB in the end (delta: -169.7 MB). Peak memory consumption was 55.1 MB. Max. memory is 16.1 GB. * Witness Printer took 144.04 ms. Allocated memory is still 348.1 MB. Free memory was 233.4 MB in the beginning and 215.6 MB in the end (delta: 17.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 65]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L36] int FloppyThread ; [L37] int KernelMode ; [L38] int Suspended ; [L39] int Executive ; [L40] int DiskController ; [L41] int FloppyDiskPeripheral ; [L42] int FlConfigCallBack ; [L43] int MaximumInterfaceType ; [L44] int MOUNTDEV_MOUNTED_DEVICE_GUID ; [L45] int myStatus ; [L46] int s ; [L47] int UNLOADED ; [L48] int NP ; [L49] int DC ; [L50] int SKIP1 ; [L51] int SKIP2 ; [L52] int MPR1 ; [L53] int MPR3 ; [L54] int IPC ; [L55] int pended ; [L56] int compRegistered ; [L57] int lowerDriverReturn ; [L58] int setEventCalled ; [L59] int customIrp ; [L91] int PagingReferenceCount = 0; [L92] int PagingMutex = 0; VAL [compRegistered=0, customIrp=0, DC=0, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=0, MPR3=0, myStatus=0, NP=0, PagingMutex=0, PagingReferenceCount=0, pended=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, Suspended=0, UNLOADED=0] [L671] int status ; [L672] int irp = __VERIFIER_nondet_int() ; [L673] int pirp ; [L674] int pirp__IoStatus__Status ; [L675] int irp_choice = __VERIFIER_nondet_int() ; [L676] int devobj = __VERIFIER_nondet_int() ; [L677] int __cil_tmp8 ; [L679] FloppyThread = 0 [L680] KernelMode = 0 [L681] Suspended = 0 [L682] Executive = 0 [L683] DiskController = 0 [L684] FloppyDiskPeripheral = 0 [L685] FlConfigCallBack = 0 [L686] MaximumInterfaceType = 0 [L687] MOUNTDEV_MOUNTED_DEVICE_GUID = 0 [L688] myStatus = 0 [L689] s = 0 [L690] UNLOADED = 0 [L691] NP = 0 [L692] DC = 0 [L693] SKIP1 = 0 [L694] SKIP2 = 0 [L695] MPR1 = 0 [L696] MPR3 = 0 [L697] IPC = 0 [L698] pended = 0 [L699] compRegistered = 0 [L700] lowerDriverReturn = 0 [L701] setEventCalled = 0 [L702] customIrp = 0 [L706] status = 0 [L707] pirp = irp [L74] UNLOADED = 0 [L75] NP = 1 [L76] DC = 2 [L77] SKIP1 = 3 [L78] SKIP2 = 4 [L79] MPR1 = 5 [L80] MPR3 = 6 [L81] IPC = 7 [L82] s = UNLOADED [L83] pended = 0 [L84] compRegistered = 0 [L85] lowerDriverReturn = 0 [L86] setEventCalled = 0 [L87] customIrp = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L710] COND TRUE status >= 0 [L711] s = NP [L712] customIrp = 0 [L713] setEventCalled = customIrp [L714] lowerDriverReturn = setEventCalled [L715] compRegistered = lowerDriverReturn [L716] pended = compRegistered [L717] pirp__IoStatus__Status = 0 [L718] myStatus = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L719] COND TRUE irp_choice == 0 [L720] pirp__IoStatus__Status = -1073741637 [L721] myStatus = -1073741637 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L661] s = NP [L662] pended = 0 [L663] compRegistered = 0 [L664] lowerDriverReturn = 0 [L665] setEventCalled = 0 [L666] customIrp = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L727] COND FALSE !(status < 0) [L731] int tmp_ndt_1; [L732] tmp_ndt_1 = __VERIFIER_nondet_int() [L733] COND TRUE tmp_ndt_1 == 3 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L164] int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ; [L165] int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ; [L166] int Irp__IoStatus__Information ; [L167] int Irp__IoStatus__Status ; [L168] int Irp__CurrentLocation = __VERIFIER_nondet_int() ; [L169] int disketteExtension__IsRemoved = __VERIFIER_nondet_int() ; [L170] int disketteExtension__IsStarted = __VERIFIER_nondet_int() ; [L171] int disketteExtension__TargetObject = __VERIFIER_nondet_int() ; [L172] int disketteExtension__HoldNewRequests ; [L173] int disketteExtension__FloppyThread = __VERIFIER_nondet_int() ; [L174] int disketteExtension__InterfaceString__Buffer = __VERIFIER_nondet_int() ; [L175] int disketteExtension__InterfaceString = __VERIFIER_nondet_int() ; [L176] int disketteExtension__ArcName__Length = __VERIFIER_nondet_int() ; [L177] int disketteExtension__ArcName = __VERIFIER_nondet_int() ; [L178] int irpSp__MinorFunction = __VERIFIER_nondet_int() ; [L179] int IoGetConfigurationInformation__FloppyCount = __VERIFIER_nondet_int() ; [L180] int irpSp ; [L181] int disketteExtension ; [L182] int ntStatus ; [L183] int doneEvent = __VERIFIER_nondet_int() ; [L184] int irpSp___0 ; [L185] int nextIrpSp ; [L186] int nextIrpSp__Control ; [L187] int irpSp___1 ; [L188] int irpSp__Context ; [L189] int irpSp__Control ; [L190] long __cil_tmp29 ; [L191] long __cil_tmp30 ; [L194] ntStatus = 0 [L195] PagingReferenceCount ++ VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L196] COND TRUE PagingReferenceCount == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L199] disketteExtension = DeviceObject__DeviceExtension [L200] irpSp = Irp__Tail__Overlay__CurrentStackLocation VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L201] COND FALSE !(\read(disketteExtension__IsRemoved)) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L210] COND FALSE !(irpSp__MinorFunction == 0) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L213] COND TRUE irpSp__MinorFunction == 5 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L239] COND TRUE irpSp__MinorFunction == 5 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L242] COND FALSE !(! disketteExtension__IsStarted) [L258] disketteExtension__HoldNewRequests = 1 [L101] int status ; [L102] int threadHandle = __VERIFIER_nondet_int() ; [L103] int DisketteExtension__PoweringDown = __VERIFIER_nondet_int() ; [L104] int DisketteExtension__ThreadReferenceCount = __VERIFIER_nondet_int() ; [L105] int DisketteExtension__FloppyThread = __VERIFIER_nondet_int() ; [L106] int Irp__IoStatus__Status ; [L107] int Irp__IoStatus__Information ; [L108] int Irp__Tail__Overlay__CurrentStackLocation__Control ; [L109] int ObjAttributes = __VERIFIER_nondet_int() ; [L110] int __cil_tmp12 ; [L111] int __cil_tmp13 ; VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L114] COND FALSE !(DisketteExtension__PoweringDown == 1) [L120] DisketteExtension__ThreadReferenceCount ++ VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L121] COND FALSE !(DisketteExtension__ThreadReferenceCount == 0) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L153] COND TRUE pended == 0 [L154] pended = 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L160] return (259); VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L259] ntStatus = FlQueueIrpToThread(Irp, disketteExtension) [L262] __cil_tmp29 = (long )ntStatus VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L263] COND TRUE __cil_tmp29 == 259L [L1036] COND FALSE !(s == MPR3) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1045] COND FALSE !(customIrp == 1) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1049] COND FALSE !(s == MPR3) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1056] int tmp_ndt_8; [L1057] tmp_ndt_8 = __VERIFIER_nondet_int() [L1058] COND TRUE tmp_ndt_8 == 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1064] return (0); VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L268] COND TRUE disketteExtension__FloppyThread != 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L271] disketteExtension__FloppyThread = 0 [L272] Irp__IoStatus__Status = 0 [L273] myStatus = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L274] COND TRUE s == NP [L275] s = SKIP1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L282] Irp__CurrentLocation ++ [L283] Irp__Tail__Overlay__CurrentStackLocation ++ [L938] int returnVal2 ; [L939] int compRetStatus1 ; [L940] int lcontext = __VERIFIER_nondet_int() ; [L941] unsigned long __cil_tmp7 ; VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L944] COND FALSE !(\read(compRegistered)) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L957] int tmp_ndt_12; [L958] tmp_ndt_12 = __VERIFIER_nondet_int() [L959] COND TRUE tmp_ndt_12 == 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L970] returnVal2 = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L983] COND FALSE !(s == NP) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L987] COND FALSE !(s == MPR1) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L996] COND TRUE s == SKIP1 [L997] s = SKIP2 [L998] lowerDriverReturn = returnVal2 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1006] return (returnVal2); VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L284] ntStatus = IofCallDriver(disketteExtension__TargetObject, Irp) [L430] PagingReferenceCount -- VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L431] COND TRUE PagingReferenceCount == 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L434] return (ntStatus); VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L740] status = FloppyPnp(devobj, pirp) [L750] COND TRUE pended == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L751] COND FALSE !(s == NP) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L758] COND TRUE pended == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L759] COND FALSE !(s == MPR3) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L766] COND TRUE s != UNLOADED VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L767] COND TRUE status != -1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L768] COND FALSE !(s != SKIP2) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L782] COND TRUE pended == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L783] COND TRUE status != 259 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L65] reach_error() VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 421 locations, 41 error locations. Started 1 CEGAR loops. OverallTime: 9830.9ms, OverallIterations: 37, TraceHistogramMax: 1, EmptinessCheckTime: 50.1ms, AutomataDifference: 5531.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 26.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 15759 SDtfs, 11084 SDslu, 19554 SDs, 0 SdLazy, 3079 SolverSat, 405 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2150.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 184 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 478.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=600occurred in iteration=20, InterpolantAutomatonStates: 155, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1915.0ms AutomataMinimizationTime, 36 MinimizatonAttempts, 2440 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 115.9ms SsaConstructionTime, 434.8ms SatisfiabilityAnalysisTime, 1286.2ms InterpolantComputationTime, 1208 NumberOfCodeBlocks, 1208 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1117 ConstructedInterpolants, 0 QuantifiedInterpolants, 2752 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-10-13 00:29:56,178 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45438020-1b08-4a87-bf90-b961836db963/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...