./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a133bf31-4f16-4e31-969a-0fe798cad9d7/bin/uautomizer-j4sWxH34Be/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a133bf31-4f16-4e31-969a-0fe798cad9d7/bin/uautomizer-j4sWxH34Be/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a133bf31-4f16-4e31-969a-0fe798cad9d7/bin/uautomizer-j4sWxH34Be/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a133bf31-4f16-4e31-969a-0fe798cad9d7/bin/uautomizer-j4sWxH34Be/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a133bf31-4f16-4e31-969a-0fe798cad9d7/bin/uautomizer-j4sWxH34Be/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a133bf31-4f16-4e31-969a-0fe798cad9d7/bin/uautomizer-j4sWxH34Be --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bfc29f03d3be9b41eb07ac14f0f7eac45bf3a60a4a6601e3132f720b72534d53 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-e943c26 [2021-10-21 19:27:24,496 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-21 19:27:24,498 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-21 19:27:24,543 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-21 19:27:24,544 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-21 19:27:24,548 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-21 19:27:24,550 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-21 19:27:24,554 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-21 19:27:24,557 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-21 19:27:24,562 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-21 19:27:24,564 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-21 19:27:24,566 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-21 19:27:24,566 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-21 19:27:24,570 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-21 19:27:24,574 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-21 19:27:24,579 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-21 19:27:24,582 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-21 19:27:24,583 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-21 19:27:24,587 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-21 19:27:24,598 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-21 19:27:24,600 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-21 19:27:24,602 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-21 19:27:24,606 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-21 19:27:24,607 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-21 19:27:24,616 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-21 19:27:24,616 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-21 19:27:24,617 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-21 19:27:24,619 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-21 19:27:24,620 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-21 19:27:24,622 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-21 19:27:24,623 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-21 19:27:24,624 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-21 19:27:24,626 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-21 19:27:24,628 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-21 19:27:24,629 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-21 19:27:24,630 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-21 19:27:24,631 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-21 19:27:24,631 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-21 19:27:24,631 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-21 19:27:24,632 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-21 19:27:24,634 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-21 19:27:24,635 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a133bf31-4f16-4e31-969a-0fe798cad9d7/bin/uautomizer-j4sWxH34Be/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-21 19:27:24,676 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-21 19:27:24,676 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-21 19:27:24,677 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-21 19:27:24,677 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-21 19:27:24,678 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-21 19:27:24,678 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-21 19:27:24,678 INFO L138 SettingsManager]: * Use SBE=true [2021-10-21 19:27:24,678 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-21 19:27:24,678 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-21 19:27:24,679 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-21 19:27:24,679 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-21 19:27:24,679 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-21 19:27:24,679 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-21 19:27:24,679 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-21 19:27:24,684 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-21 19:27:24,684 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-21 19:27:24,684 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-21 19:27:24,684 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-21 19:27:24,685 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-21 19:27:24,685 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-21 19:27:24,685 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-21 19:27:24,685 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-21 19:27:24,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 19:27:24,686 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-21 19:27:24,686 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-21 19:27:24,686 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-21 19:27:24,687 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-21 19:27:24,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-21 19:27:24,687 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-21 19:27:24,689 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-21 19:27:24,689 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-21 19:27:24,689 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-21 19:27:24,690 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_a133bf31-4f16-4e31-969a-0fe798cad9d7/bin/uautomizer-j4sWxH34Be/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_a133bf31-4f16-4e31-969a-0fe798cad9d7/bin/uautomizer-j4sWxH34Be Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bfc29f03d3be9b41eb07ac14f0f7eac45bf3a60a4a6601e3132f720b72534d53 [2021-10-21 19:27:24,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-21 19:27:24,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-21 19:27:24,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-21 19:27:24,978 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-21 19:27:24,979 INFO L275 PluginConnector]: CDTParser initialized [2021-10-21 19:27:24,980 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a133bf31-4f16-4e31-969a-0fe798cad9d7/bin/uautomizer-j4sWxH34Be/../../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2021-10-21 19:27:25,067 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a133bf31-4f16-4e31-969a-0fe798cad9d7/bin/uautomizer-j4sWxH34Be/data/9e1e8e76f/cc448356c18248819d349dff8b69aad8/FLAGc25e5653c [2021-10-21 19:27:25,727 INFO L306 CDTParser]: Found 1 translation units. [2021-10-21 19:27:25,733 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a133bf31-4f16-4e31-969a-0fe798cad9d7/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2021-10-21 19:27:25,764 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a133bf31-4f16-4e31-969a-0fe798cad9d7/bin/uautomizer-j4sWxH34Be/data/9e1e8e76f/cc448356c18248819d349dff8b69aad8/FLAGc25e5653c [2021-10-21 19:27:25,907 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a133bf31-4f16-4e31-969a-0fe798cad9d7/bin/uautomizer-j4sWxH34Be/data/9e1e8e76f/cc448356c18248819d349dff8b69aad8 [2021-10-21 19:27:25,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-21 19:27:25,910 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-21 19:27:25,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-21 19:27:25,920 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-21 19:27:25,924 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-21 19:27:25,925 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:27:25" (1/1) ... [2021-10-21 19:27:25,926 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@628166fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:27:25, skipping insertion in model container [2021-10-21 19:27:25,926 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:27:25" (1/1) ... [2021-10-21 19:27:25,932 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-21 19:27:25,993 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-21 19:27:26,184 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_a133bf31-4f16-4e31-969a-0fe798cad9d7/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c[2074,2087] [2021-10-21 19:27:26,448 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:27:26,457 INFO L203 MainTranslator]: Completed pre-run [2021-10-21 19:27:26,485 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_a133bf31-4f16-4e31-969a-0fe798cad9d7/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c[2074,2087] [2021-10-21 19:27:26,629 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:27:26,646 INFO L208 MainTranslator]: Completed translation [2021-10-21 19:27:26,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:27:26 WrapperNode [2021-10-21 19:27:26,647 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-21 19:27:26,648 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-21 19:27:26,648 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-21 19:27:26,648 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-21 19:27:26,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:27:26" (1/1) ... [2021-10-21 19:27:26,681 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:27:26" (1/1) ... [2021-10-21 19:27:26,858 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-21 19:27:26,859 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-21 19:27:26,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-21 19:27:26,860 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-21 19:27:26,869 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:27:26" (1/1) ... [2021-10-21 19:27:26,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:27:26" (1/1) ... [2021-10-21 19:27:26,884 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:27:26" (1/1) ... [2021-10-21 19:27:26,884 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:27:26" (1/1) ... [2021-10-21 19:27:26,943 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:27:26" (1/1) ... [2021-10-21 19:27:26,968 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:27:26" (1/1) ... [2021-10-21 19:27:26,977 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:27:26" (1/1) ... [2021-10-21 19:27:27,010 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-21 19:27:27,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-21 19:27:27,013 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-21 19:27:27,014 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-21 19:27:27,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:27:26" (1/1) ... [2021-10-21 19:27:27,026 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 19:27:27,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a133bf31-4f16-4e31-969a-0fe798cad9d7/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:27:27,057 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a133bf31-4f16-4e31-969a-0fe798cad9d7/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-21 19:27:27,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a133bf31-4f16-4e31-969a-0fe798cad9d7/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-21 19:27:27,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-21 19:27:27,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-21 19:27:27,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-21 19:27:27,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-21 19:27:27,381 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,390 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,412 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,418 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,432 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,441 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,449 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,472 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,480 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,509 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,513 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,516 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,521 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,533 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,535 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,538 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,548 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,562 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,564 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,569 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,571 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,574 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,577 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,578 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,580 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,583 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,585 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,588 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,590 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,593 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,596 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,599 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,600 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,602 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,603 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,606 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,607 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,609 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,611 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,613 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,614 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,617 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:27,619 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:27:29,470 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1271: assume false; [2021-10-21 19:27:29,470 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1272: assume !false; [2021-10-21 19:27:29,470 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2021-10-21 19:27:29,471 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2021-10-21 19:27:29,471 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1230: assume !false; [2021-10-21 19:27:29,471 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##287: assume false; [2021-10-21 19:27:29,471 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##288: assume !false; [2021-10-21 19:27:29,471 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1229: assume false; [2021-10-21 19:27:29,471 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1210: assume false; [2021-10-21 19:27:29,472 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1211: assume !false; [2021-10-21 19:27:29,472 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##319: assume false; [2021-10-21 19:27:29,472 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##320: assume !false; [2021-10-21 19:27:29,472 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1160: assume !false; [2021-10-21 19:27:29,472 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1159: assume false; [2021-10-21 19:27:29,472 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##371: assume false; [2021-10-21 19:27:29,473 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##372: assume !false; [2021-10-21 19:27:29,473 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1108: assume false; [2021-10-21 19:27:29,473 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1109: assume !false; [2021-10-21 19:27:29,473 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##346: assume false; [2021-10-21 19:27:29,473 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##347: assume !false; [2021-10-21 19:27:29,474 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##416: assume false; [2021-10-21 19:27:29,474 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##417: assume !false; [2021-10-21 19:27:29,474 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1050: assume !false; [2021-10-21 19:27:29,474 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: CdAudioPnp_#res := 0; [2021-10-21 19:27:29,474 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1049: assume false; [2021-10-21 19:27:29,475 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1003: assume false; [2021-10-21 19:27:29,475 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1004: assume !false; [2021-10-21 19:27:29,475 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##461: assume !false; [2021-10-21 19:27:29,475 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##460: assume false; [2021-10-21 19:27:29,475 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##487: assume !false; [2021-10-21 19:27:29,475 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##486: assume false; [2021-10-21 19:27:29,476 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##526: assume !false; [2021-10-21 19:27:29,476 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##525: assume false; [2021-10-21 19:27:29,476 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##71: assume !false; [2021-10-21 19:27:29,476 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##70: assume false; [2021-10-21 19:27:29,476 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume !false; [2021-10-21 19:27:29,477 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume false; [2021-10-21 19:27:29,477 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume !false; [2021-10-21 19:27:29,477 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume false; [2021-10-21 19:27:29,477 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2021-10-21 19:27:29,477 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2021-10-21 19:27:29,477 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##573: assume !false; [2021-10-21 19:27:29,478 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##572: assume false; [2021-10-21 19:27:29,478 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##685: assume !false; [2021-10-21 19:27:29,478 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##684: assume false; [2021-10-21 19:27:29,478 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##609: assume false; [2021-10-21 19:27:29,478 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##610: assume !false; [2021-10-21 19:27:29,478 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##639: assume !false; [2021-10-21 19:27:29,479 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##638: assume false; [2021-10-21 19:27:29,479 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1612: assume false; [2021-10-21 19:27:29,479 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1613: assume !false; [2021-10-21 19:27:29,479 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##757: assume !false; [2021-10-21 19:27:29,479 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##756: assume false; [2021-10-21 19:27:29,480 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##717: assume !false; [2021-10-21 19:27:29,480 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##716: assume false; [2021-10-21 19:27:29,480 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1506: assume false; [2021-10-21 19:27:29,480 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1507: assume !false; [2021-10-21 19:27:29,480 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1564: assume false; [2021-10-21 19:27:29,481 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1565: assume !false; [2021-10-21 19:27:29,481 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##856: assume false; [2021-10-21 19:27:29,481 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##857: assume !false; [2021-10-21 19:27:29,481 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##801: assume false; [2021-10-21 19:27:29,481 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##802: assume !false; [2021-10-21 19:27:29,481 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##832: assume !false; [2021-10-21 19:27:29,482 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##831: assume false; [2021-10-21 19:27:29,482 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1426: assume false; [2021-10-21 19:27:29,482 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1427: assume !false; [2021-10-21 19:27:29,482 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1476: assume false; [2021-10-21 19:27:29,482 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1477: assume !false; [2021-10-21 19:27:29,482 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1398: assume false; [2021-10-21 19:27:29,483 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1399: assume !false; [2021-10-21 19:27:29,483 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##961: assume !false; [2021-10-21 19:27:29,483 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##960: assume false; [2021-10-21 19:27:29,483 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##909: assume false; [2021-10-21 19:27:29,483 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##910: assume !false; [2021-10-21 19:27:29,484 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1301: assume false; [2021-10-21 19:27:29,484 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1302: assume !false; [2021-10-21 19:27:29,484 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##188: assume !false; [2021-10-21 19:27:29,484 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##187: assume false; [2021-10-21 19:27:29,484 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##148: assume false; [2021-10-21 19:27:29,485 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##149: assume !false; [2021-10-21 19:27:29,485 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1354: assume false; [2021-10-21 19:27:29,485 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1355: assume !false; [2021-10-21 19:27:29,485 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1341: assume false; [2021-10-21 19:27:29,485 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1342: assume !false; [2021-10-21 19:27:29,485 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##111: assume false; [2021-10-21 19:27:29,486 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##112: assume !false; [2021-10-21 19:27:29,504 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-21 19:27:29,504 INFO L299 CfgBuilder]: Removed 555 assume(true) statements. [2021-10-21 19:27:29,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:27:29 BoogieIcfgContainer [2021-10-21 19:27:29,508 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-21 19:27:29,510 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-21 19:27:29,510 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-21 19:27:29,514 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-21 19:27:29,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 07:27:25" (1/3) ... [2021-10-21 19:27:29,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11621f18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 07:27:29, skipping insertion in model container [2021-10-21 19:27:29,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:27:26" (2/3) ... [2021-10-21 19:27:29,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11621f18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 07:27:29, skipping insertion in model container [2021-10-21 19:27:29,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:27:29" (3/3) ... [2021-10-21 19:27:29,517 INFO L111 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-1.c [2021-10-21 19:27:29,522 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-21 19:27:29,523 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 103 error locations. [2021-10-21 19:27:29,580 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-21 19:27:29,585 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-21 19:27:29,586 INFO L340 AbstractCegarLoop]: Starting to check reachability of 103 error locations. [2021-10-21 19:27:29,626 INFO L276 IsEmpty]: Start isEmpty. Operand has 1185 states, 1081 states have (on average 1.6327474560592043) internal successors, (1765), 1184 states have internal predecessors, (1765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:29,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-21 19:27:29,632 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:29,632 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:27:29,633 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:29,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:29,638 INFO L82 PathProgramCache]: Analyzing trace with hash -630605601, now seen corresponding path program 1 times [2021-10-21 19:27:29,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:29,648 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457632159] [2021-10-21 19:27:29,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:29,649 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:29,874 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-21 19:27:29,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:29,875 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457632159] [2021-10-21 19:27:29,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457632159] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:29,876 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:29,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:27:29,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73121579] [2021-10-21 19:27:29,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:27:29,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:29,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:27:29,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:27:29,916 INFO L87 Difference]: Start difference. First operand has 1185 states, 1081 states have (on average 1.6327474560592043) internal successors, (1765), 1184 states have internal predecessors, (1765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:30,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:30,490 INFO L93 Difference]: Finished difference Result 2072 states and 3036 transitions. [2021-10-21 19:27:30,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:27:30,498 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-21 19:27:30,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:30,533 INFO L225 Difference]: With dead ends: 2072 [2021-10-21 19:27:30,533 INFO L226 Difference]: Without dead ends: 1180 [2021-10-21 19:27:30,544 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:27:30,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2021-10-21 19:27:30,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1180. [2021-10-21 19:27:30,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 1077 states have (on average 1.5273909006499535) internal successors, (1645), 1179 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:30,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1645 transitions. [2021-10-21 19:27:30,669 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1645 transitions. Word has length 11 [2021-10-21 19:27:30,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:30,669 INFO L470 AbstractCegarLoop]: Abstraction has 1180 states and 1645 transitions. [2021-10-21 19:27:30,669 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-21 19:27:30,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1645 transitions. [2021-10-21 19:27:30,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-21 19:27:30,671 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:30,671 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:27:30,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-21 19:27:30,671 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr95ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:30,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:30,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1724813645, now seen corresponding path program 1 times [2021-10-21 19:27:30,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:30,675 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109129711] [2021-10-21 19:27:30,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:30,675 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:30,795 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-21 19:27:30,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:30,796 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109129711] [2021-10-21 19:27:30,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109129711] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:30,797 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:30,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:27:30,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709813144] [2021-10-21 19:27:30,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:27:30,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:30,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:27:30,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:27:30,803 INFO L87 Difference]: Start difference. First operand 1180 states and 1645 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:31,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:31,277 INFO L93 Difference]: Finished difference Result 1458 states and 2013 transitions. [2021-10-21 19:27:31,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:27:31,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-10-21 19:27:31,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:31,286 INFO L225 Difference]: With dead ends: 1458 [2021-10-21 19:27:31,286 INFO L226 Difference]: Without dead ends: 1261 [2021-10-21 19:27:31,288 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-21 19:27:31,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2021-10-21 19:27:31,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1235. [2021-10-21 19:27:31,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 1168 states have (on average 1.4931506849315068) internal successors, (1744), 1234 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:31,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1744 transitions. [2021-10-21 19:27:31,344 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1744 transitions. Word has length 12 [2021-10-21 19:27:31,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:31,345 INFO L470 AbstractCegarLoop]: Abstraction has 1235 states and 1744 transitions. [2021-10-21 19:27:31,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:31,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1744 transitions. [2021-10-21 19:27:31,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-21 19:27:31,350 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:31,350 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:27:31,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-21 19:27:31,351 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr72ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:31,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:31,352 INFO L82 PathProgramCache]: Analyzing trace with hash 375851837, now seen corresponding path program 1 times [2021-10-21 19:27:31,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:31,352 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108045558] [2021-10-21 19:27:31,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:31,354 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:31,491 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-21 19:27:31,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:31,495 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108045558] [2021-10-21 19:27:31,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108045558] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:31,496 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:31,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:27:31,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753827373] [2021-10-21 19:27:31,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:27:31,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:31,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:27:31,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:27:31,503 INFO L87 Difference]: Start difference. First operand 1235 states and 1744 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:31,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:31,577 INFO L93 Difference]: Finished difference Result 1625 states and 2261 transitions. [2021-10-21 19:27:31,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:27:31,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-10-21 19:27:31,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:31,586 INFO L225 Difference]: With dead ends: 1625 [2021-10-21 19:27:31,587 INFO L226 Difference]: Without dead ends: 1265 [2021-10-21 19:27:31,588 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-21 19:27:31,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2021-10-21 19:27:31,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1076. [2021-10-21 19:27:31,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1076 states, 1030 states have (on average 1.4776699029126215) internal successors, (1522), 1075 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:31,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1522 transitions. [2021-10-21 19:27:31,666 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1522 transitions. Word has length 14 [2021-10-21 19:27:31,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:31,666 INFO L470 AbstractCegarLoop]: Abstraction has 1076 states and 1522 transitions. [2021-10-21 19:27:31,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:31,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1522 transitions. [2021-10-21 19:27:31,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-21 19:27:31,673 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:31,673 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:27:31,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-21 19:27:31,674 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:31,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:31,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1788319990, now seen corresponding path program 1 times [2021-10-21 19:27:31,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:31,676 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480246802] [2021-10-21 19:27:31,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:31,676 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:31,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:31,739 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-21 19:27:31,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:31,739 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480246802] [2021-10-21 19:27:31,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480246802] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:31,740 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:31,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:27:31,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427363860] [2021-10-21 19:27:31,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:27:31,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:31,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:27:31,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:27:31,742 INFO L87 Difference]: Start difference. First operand 1076 states and 1522 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:32,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:32,153 INFO L93 Difference]: Finished difference Result 1775 states and 2478 transitions. [2021-10-21 19:27:32,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:27:32,154 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-21 19:27:32,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:32,164 INFO L225 Difference]: With dead ends: 1775 [2021-10-21 19:27:32,165 INFO L226 Difference]: Without dead ends: 1539 [2021-10-21 19:27:32,166 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-21 19:27:32,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2021-10-21 19:27:32,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1245. [2021-10-21 19:27:32,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1245 states, 1199 states have (on average 1.4795663052543786) internal successors, (1774), 1244 states have internal predecessors, (1774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:32,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1774 transitions. [2021-10-21 19:27:32,235 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1774 transitions. Word has length 16 [2021-10-21 19:27:32,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:32,236 INFO L470 AbstractCegarLoop]: Abstraction has 1245 states and 1774 transitions. [2021-10-21 19:27:32,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-21 19:27:32,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1774 transitions. [2021-10-21 19:27:32,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-21 19:27:32,238 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:32,238 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:27:32,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-21 19:27:32,238 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:32,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:32,239 INFO L82 PathProgramCache]: Analyzing trace with hash 388999750, now seen corresponding path program 1 times [2021-10-21 19:27:32,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:32,240 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626059490] [2021-10-21 19:27:32,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:32,240 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:32,356 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-21 19:27:32,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:32,356 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626059490] [2021-10-21 19:27:32,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626059490] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:32,357 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:32,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:27:32,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789301020] [2021-10-21 19:27:32,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:27:32,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:32,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:27:32,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:27:32,359 INFO L87 Difference]: Start difference. First operand 1245 states and 1774 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:32,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:32,765 INFO L93 Difference]: Finished difference Result 1870 states and 2623 transitions. [2021-10-21 19:27:32,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:27:32,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-10-21 19:27:32,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:32,773 INFO L225 Difference]: With dead ends: 1870 [2021-10-21 19:27:32,774 INFO L226 Difference]: Without dead ends: 1146 [2021-10-21 19:27:32,775 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:27:32,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2021-10-21 19:27:32,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1028. [2021-10-21 19:27:32,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 1004 states have (on average 1.4262948207171315) internal successors, (1432), 1027 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:32,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1432 transitions. [2021-10-21 19:27:32,839 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1432 transitions. Word has length 17 [2021-10-21 19:27:32,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:32,839 INFO L470 AbstractCegarLoop]: Abstraction has 1028 states and 1432 transitions. [2021-10-21 19:27:32,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:32,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1432 transitions. [2021-10-21 19:27:32,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-21 19:27:32,841 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:32,841 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-21 19:27:32,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-21 19:27:32,842 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr73ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:32,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:32,843 INFO L82 PathProgramCache]: Analyzing trace with hash 79997488, now seen corresponding path program 1 times [2021-10-21 19:27:32,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:32,843 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313851013] [2021-10-21 19:27:32,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:32,844 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:32,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:32,912 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-21 19:27:32,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:32,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313851013] [2021-10-21 19:27:32,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313851013] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:32,913 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:32,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:27:32,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697517661] [2021-10-21 19:27:32,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:27:32,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:32,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:27:32,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:27:32,916 INFO L87 Difference]: Start difference. First operand 1028 states and 1432 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:33,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:33,020 INFO L93 Difference]: Finished difference Result 1343 states and 1857 transitions. [2021-10-21 19:27:33,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 19:27:33,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-21 19:27:33,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:33,030 INFO L225 Difference]: With dead ends: 1343 [2021-10-21 19:27:33,030 INFO L226 Difference]: Without dead ends: 1093 [2021-10-21 19:27:33,031 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:27:33,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2021-10-21 19:27:33,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1012. [2021-10-21 19:27:33,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 990 states have (on average 1.4202020202020202) internal successors, (1406), 1011 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:33,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1406 transitions. [2021-10-21 19:27:33,092 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1406 transitions. Word has length 19 [2021-10-21 19:27:33,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:33,093 INFO L470 AbstractCegarLoop]: Abstraction has 1012 states and 1406 transitions. [2021-10-21 19:27:33,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:33,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1406 transitions. [2021-10-21 19:27:33,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-21 19:27:33,095 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:33,095 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:27:33,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-21 19:27:33,096 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:33,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:33,097 INFO L82 PathProgramCache]: Analyzing trace with hash 2053267823, now seen corresponding path program 1 times [2021-10-21 19:27:33,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:33,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382841405] [2021-10-21 19:27:33,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:33,102 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:33,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:33,156 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-21 19:27:33,156 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:33,157 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382841405] [2021-10-21 19:27:33,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382841405] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:33,157 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:33,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:27:33,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367564368] [2021-10-21 19:27:33,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:27:33,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:33,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:27:33,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:27:33,159 INFO L87 Difference]: Start difference. First operand 1012 states and 1406 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:33,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:33,403 INFO L93 Difference]: Finished difference Result 1012 states and 1406 transitions. [2021-10-21 19:27:33,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:27:33,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-10-21 19:27:33,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:33,410 INFO L225 Difference]: With dead ends: 1012 [2021-10-21 19:27:33,410 INFO L226 Difference]: Without dead ends: 994 [2021-10-21 19:27:33,411 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-21 19:27:33,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2021-10-21 19:27:33,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 994. [2021-10-21 19:27:33,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 981 states have (on average 1.4148827726809379) internal successors, (1388), 993 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:33,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1388 transitions. [2021-10-21 19:27:33,475 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1388 transitions. Word has length 20 [2021-10-21 19:27:33,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:33,475 INFO L470 AbstractCegarLoop]: Abstraction has 994 states and 1388 transitions. [2021-10-21 19:27:33,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:33,476 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1388 transitions. [2021-10-21 19:27:33,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-21 19:27:33,478 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:33,478 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-21 19:27:33,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-21 19:27:33,478 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:33,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:33,479 INFO L82 PathProgramCache]: Analyzing trace with hash -99023241, now seen corresponding path program 1 times [2021-10-21 19:27:33,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:33,479 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571313828] [2021-10-21 19:27:33,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:33,480 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:33,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:27:33,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:33,512 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571313828] [2021-10-21 19:27:33,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571313828] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:33,512 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:33,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:27:33,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193561150] [2021-10-21 19:27:33,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:27:33,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:33,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:27:33,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:27:33,514 INFO L87 Difference]: Start difference. First operand 994 states and 1388 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:33,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:33,581 INFO L93 Difference]: Finished difference Result 1071 states and 1485 transitions. [2021-10-21 19:27:33,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:27:33,582 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-21 19:27:33,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:33,588 INFO L225 Difference]: With dead ends: 1071 [2021-10-21 19:27:33,588 INFO L226 Difference]: Without dead ends: 1048 [2021-10-21 19:27:33,589 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-21 19:27:33,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2021-10-21 19:27:33,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 999. [2021-10-21 19:27:33,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 987 states have (on average 1.4285714285714286) internal successors, (1410), 998 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:33,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1410 transitions. [2021-10-21 19:27:33,646 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1410 transitions. Word has length 22 [2021-10-21 19:27:33,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:33,647 INFO L470 AbstractCegarLoop]: Abstraction has 999 states and 1410 transitions. [2021-10-21 19:27:33,647 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-21 19:27:33,647 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1410 transitions. [2021-10-21 19:27:33,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-21 19:27:33,649 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:33,649 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-21 19:27:33,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-21 19:27:33,650 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:33,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:33,650 INFO L82 PathProgramCache]: Analyzing trace with hash 85424501, now seen corresponding path program 1 times [2021-10-21 19:27:33,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:33,651 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175054793] [2021-10-21 19:27:33,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:33,651 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:33,682 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-21 19:27:33,682 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:33,683 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175054793] [2021-10-21 19:27:33,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175054793] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:33,683 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:33,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:27:33,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021795253] [2021-10-21 19:27:33,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:27:33,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:33,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:27:33,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:27:33,685 INFO L87 Difference]: Start difference. First operand 999 states and 1410 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:33,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:33,756 INFO L93 Difference]: Finished difference Result 1274 states and 1786 transitions. [2021-10-21 19:27:33,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:27:33,757 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-21 19:27:33,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:33,765 INFO L225 Difference]: With dead ends: 1274 [2021-10-21 19:27:33,765 INFO L226 Difference]: Without dead ends: 1045 [2021-10-21 19:27:33,767 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-21 19:27:33,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2021-10-21 19:27:33,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 999. [2021-10-21 19:27:33,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 987 states have (on average 1.426545086119554) internal successors, (1408), 998 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:33,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1408 transitions. [2021-10-21 19:27:33,829 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1408 transitions. Word has length 25 [2021-10-21 19:27:33,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:33,830 INFO L470 AbstractCegarLoop]: Abstraction has 999 states and 1408 transitions. [2021-10-21 19:27:33,830 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-21 19:27:33,830 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1408 transitions. [2021-10-21 19:27:33,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-21 19:27:33,832 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:33,832 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:27:33,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-21 19:27:33,834 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr75ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:33,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:33,834 INFO L82 PathProgramCache]: Analyzing trace with hash -105580495, now seen corresponding path program 1 times [2021-10-21 19:27:33,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:33,836 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319705538] [2021-10-21 19:27:33,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:33,836 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:33,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:27:33,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:33,884 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319705538] [2021-10-21 19:27:33,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319705538] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:33,884 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:33,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:27:33,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346253264] [2021-10-21 19:27:33,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:27:33,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:33,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:27:33,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:27:33,886 INFO L87 Difference]: Start difference. First operand 999 states and 1408 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:34,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:34,130 INFO L93 Difference]: Finished difference Result 1196 states and 1676 transitions. [2021-10-21 19:27:34,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:27:34,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-10-21 19:27:34,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:34,137 INFO L225 Difference]: With dead ends: 1196 [2021-10-21 19:27:34,137 INFO L226 Difference]: Without dead ends: 989 [2021-10-21 19:27:34,138 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-21 19:27:34,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2021-10-21 19:27:34,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 989. [2021-10-21 19:27:34,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 980 states have (on average 1.4214285714285715) internal successors, (1393), 988 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:34,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1393 transitions. [2021-10-21 19:27:34,194 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1393 transitions. Word has length 27 [2021-10-21 19:27:34,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:34,194 INFO L470 AbstractCegarLoop]: Abstraction has 989 states and 1393 transitions. [2021-10-21 19:27:34,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:34,195 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1393 transitions. [2021-10-21 19:27:34,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-21 19:27:34,199 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:34,199 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-21 19:27:34,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-21 19:27:34,200 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:34,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:34,201 INFO L82 PathProgramCache]: Analyzing trace with hash 333752835, now seen corresponding path program 1 times [2021-10-21 19:27:34,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:34,203 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448381194] [2021-10-21 19:27:34,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:34,203 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:34,275 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-21 19:27:34,275 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:34,275 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448381194] [2021-10-21 19:27:34,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448381194] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:34,276 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:34,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:27:34,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473857592] [2021-10-21 19:27:34,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:27:34,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:34,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:27:34,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:27:34,278 INFO L87 Difference]: Start difference. First operand 989 states and 1393 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:34,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:34,577 INFO L93 Difference]: Finished difference Result 1061 states and 1469 transitions. [2021-10-21 19:27:34,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:27:34,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-10-21 19:27:34,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:34,583 INFO L225 Difference]: With dead ends: 1061 [2021-10-21 19:27:34,583 INFO L226 Difference]: Without dead ends: 1009 [2021-10-21 19:27:34,584 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-21 19:27:34,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2021-10-21 19:27:34,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 989. [2021-10-21 19:27:34,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 980 states have (on average 1.4122448979591837) internal successors, (1384), 988 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:34,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1384 transitions. [2021-10-21 19:27:34,641 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1384 transitions. Word has length 29 [2021-10-21 19:27:34,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:34,642 INFO L470 AbstractCegarLoop]: Abstraction has 989 states and 1384 transitions. [2021-10-21 19:27:34,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:34,642 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1384 transitions. [2021-10-21 19:27:34,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-21 19:27:34,644 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:34,644 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] [2021-10-21 19:27:34,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-21 19:27:34,645 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:34,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:34,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1053614682, now seen corresponding path program 1 times [2021-10-21 19:27:34,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:34,646 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209018917] [2021-10-21 19:27:34,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:34,646 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:34,679 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-21 19:27:34,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:34,680 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209018917] [2021-10-21 19:27:34,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209018917] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:34,680 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:34,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:27:34,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011286616] [2021-10-21 19:27:34,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:27:34,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:34,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:27:34,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:27:34,682 INFO L87 Difference]: Start difference. First operand 989 states and 1384 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:34,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:34,898 INFO L93 Difference]: Finished difference Result 1014 states and 1412 transitions. [2021-10-21 19:27:34,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:27:34,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-10-21 19:27:34,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:34,904 INFO L225 Difference]: With dead ends: 1014 [2021-10-21 19:27:34,904 INFO L226 Difference]: Without dead ends: 1009 [2021-10-21 19:27:34,905 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-21 19:27:34,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2021-10-21 19:27:34,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1006. [2021-10-21 19:27:34,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 997 states have (on average 1.4092276830491475) internal successors, (1405), 1005 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:34,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1405 transitions. [2021-10-21 19:27:34,996 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1405 transitions. Word has length 30 [2021-10-21 19:27:34,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:34,997 INFO L470 AbstractCegarLoop]: Abstraction has 1006 states and 1405 transitions. [2021-10-21 19:27:34,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:34,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1405 transitions. [2021-10-21 19:27:34,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-21 19:27:35,000 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:35,000 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:27:35,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-21 19:27:35,000 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:35,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:35,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1714895974, now seen corresponding path program 1 times [2021-10-21 19:27:35,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:35,001 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442248925] [2021-10-21 19:27:35,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:35,002 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:35,070 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-21 19:27:35,070 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:35,070 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442248925] [2021-10-21 19:27:35,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442248925] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:35,071 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:35,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:27:35,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416632720] [2021-10-21 19:27:35,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:27:35,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:35,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:27:35,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:27:35,073 INFO L87 Difference]: Start difference. First operand 1006 states and 1405 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:35,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:35,361 INFO L93 Difference]: Finished difference Result 1014 states and 1411 transitions. [2021-10-21 19:27:35,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:27:35,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-10-21 19:27:35,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:35,368 INFO L225 Difference]: With dead ends: 1014 [2021-10-21 19:27:35,368 INFO L226 Difference]: Without dead ends: 1009 [2021-10-21 19:27:35,369 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:27:35,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2021-10-21 19:27:35,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1006. [2021-10-21 19:27:35,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 997 states have (on average 1.4082246740220663) internal successors, (1404), 1005 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:35,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1404 transitions. [2021-10-21 19:27:35,433 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1404 transitions. Word has length 31 [2021-10-21 19:27:35,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:35,433 INFO L470 AbstractCegarLoop]: Abstraction has 1006 states and 1404 transitions. [2021-10-21 19:27:35,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:35,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1404 transitions. [2021-10-21 19:27:35,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-21 19:27:35,436 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:35,436 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:27:35,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-21 19:27:35,436 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:35,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:35,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1557214583, now seen corresponding path program 1 times [2021-10-21 19:27:35,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:35,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42418833] [2021-10-21 19:27:35,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:35,438 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:35,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:27:35,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:35,471 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42418833] [2021-10-21 19:27:35,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42418833] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:35,471 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:35,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:27:35,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680619140] [2021-10-21 19:27:35,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:27:35,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:35,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:27:35,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:27:35,473 INFO L87 Difference]: Start difference. First operand 1006 states and 1404 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:35,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:35,558 INFO L93 Difference]: Finished difference Result 1237 states and 1712 transitions. [2021-10-21 19:27:35,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:27:35,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-10-21 19:27:35,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:35,565 INFO L225 Difference]: With dead ends: 1237 [2021-10-21 19:27:35,565 INFO L226 Difference]: Without dead ends: 1099 [2021-10-21 19:27:35,566 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-21 19:27:35,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2021-10-21 19:27:35,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 994. [2021-10-21 19:27:35,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 988 states have (on average 1.402834008097166) internal successors, (1386), 993 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:35,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1386 transitions. [2021-10-21 19:27:35,630 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1386 transitions. Word has length 31 [2021-10-21 19:27:35,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:35,630 INFO L470 AbstractCegarLoop]: Abstraction has 994 states and 1386 transitions. [2021-10-21 19:27:35,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:35,631 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1386 transitions. [2021-10-21 19:27:35,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-21 19:27:35,633 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:35,633 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:27:35,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-21 19:27:35,633 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:35,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:35,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1095917288, now seen corresponding path program 1 times [2021-10-21 19:27:35,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:35,634 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898961271] [2021-10-21 19:27:35,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:35,635 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:35,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:35,676 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-21 19:27:35,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:35,676 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898961271] [2021-10-21 19:27:35,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898961271] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:35,677 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:35,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:27:35,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785498034] [2021-10-21 19:27:35,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:27:35,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:35,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:27:35,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:27:35,678 INFO L87 Difference]: Start difference. First operand 994 states and 1386 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:35,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:35,900 INFO L93 Difference]: Finished difference Result 1060 states and 1453 transitions. [2021-10-21 19:27:35,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:27:35,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-10-21 19:27:35,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:35,906 INFO L225 Difference]: With dead ends: 1060 [2021-10-21 19:27:35,906 INFO L226 Difference]: Without dead ends: 1046 [2021-10-21 19:27:35,907 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-21 19:27:35,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2021-10-21 19:27:35,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1034. [2021-10-21 19:27:35,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1028 states have (on average 1.3881322957198443) internal successors, (1427), 1033 states have internal predecessors, (1427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:35,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1427 transitions. [2021-10-21 19:27:35,975 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1427 transitions. Word has length 31 [2021-10-21 19:27:35,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:35,975 INFO L470 AbstractCegarLoop]: Abstraction has 1034 states and 1427 transitions. [2021-10-21 19:27:35,975 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:35,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1427 transitions. [2021-10-21 19:27:35,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-21 19:27:35,978 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:35,978 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:27:35,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-21 19:27:35,978 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:35,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:35,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1102324248, now seen corresponding path program 1 times [2021-10-21 19:27:35,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:35,979 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698617163] [2021-10-21 19:27:35,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:35,980 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:36,011 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-21 19:27:36,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:36,011 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698617163] [2021-10-21 19:27:36,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698617163] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:36,012 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:36,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:27:36,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629177725] [2021-10-21 19:27:36,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:27:36,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:36,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:27:36,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:27:36,014 INFO L87 Difference]: Start difference. First operand 1034 states and 1427 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:36,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:36,108 INFO L93 Difference]: Finished difference Result 1101 states and 1500 transitions. [2021-10-21 19:27:36,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:27:36,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-10-21 19:27:36,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:36,115 INFO L225 Difference]: With dead ends: 1101 [2021-10-21 19:27:36,115 INFO L226 Difference]: Without dead ends: 1078 [2021-10-21 19:27:36,116 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:27:36,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2021-10-21 19:27:36,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 1037. [2021-10-21 19:27:36,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 1031 states have (on average 1.3879728419010668) internal successors, (1431), 1036 states have internal predecessors, (1431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:36,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1431 transitions. [2021-10-21 19:27:36,187 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1431 transitions. Word has length 31 [2021-10-21 19:27:36,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:36,187 INFO L470 AbstractCegarLoop]: Abstraction has 1037 states and 1431 transitions. [2021-10-21 19:27:36,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:36,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1431 transitions. [2021-10-21 19:27:36,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-21 19:27:36,190 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:36,190 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:27:36,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-21 19:27:36,191 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:36,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:36,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1689130262, now seen corresponding path program 1 times [2021-10-21 19:27:36,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:36,191 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59052158] [2021-10-21 19:27:36,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:36,192 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:36,224 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-21 19:27:36,224 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:36,224 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59052158] [2021-10-21 19:27:36,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59052158] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:36,225 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:36,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:27:36,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176437926] [2021-10-21 19:27:36,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:27:36,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:36,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:27:36,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:27:36,226 INFO L87 Difference]: Start difference. First operand 1037 states and 1431 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:36,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:36,499 INFO L93 Difference]: Finished difference Result 1060 states and 1456 transitions. [2021-10-21 19:27:36,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:27:36,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-10-21 19:27:36,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:36,505 INFO L225 Difference]: With dead ends: 1060 [2021-10-21 19:27:36,505 INFO L226 Difference]: Without dead ends: 996 [2021-10-21 19:27:36,506 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-21 19:27:36,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2021-10-21 19:27:36,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 994. [2021-10-21 19:27:36,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 988 states have (on average 1.3856275303643724) internal successors, (1369), 993 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:36,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1369 transitions. [2021-10-21 19:27:36,576 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1369 transitions. Word has length 31 [2021-10-21 19:27:36,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:36,577 INFO L470 AbstractCegarLoop]: Abstraction has 994 states and 1369 transitions. [2021-10-21 19:27:36,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:36,577 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1369 transitions. [2021-10-21 19:27:36,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-21 19:27:36,579 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:36,580 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-21 19:27:36,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-21 19:27:36,580 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:36,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:36,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1100290421, now seen corresponding path program 1 times [2021-10-21 19:27:36,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:36,581 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518061436] [2021-10-21 19:27:36,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:36,581 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:36,660 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-21 19:27:36,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:36,661 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518061436] [2021-10-21 19:27:36,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518061436] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:36,661 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:36,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:27:36,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957202494] [2021-10-21 19:27:36,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:27:36,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:36,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:27:36,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:27:36,665 INFO L87 Difference]: Start difference. First operand 994 states and 1369 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:36,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:36,930 INFO L93 Difference]: Finished difference Result 1002 states and 1375 transitions. [2021-10-21 19:27:36,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:27:36,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-10-21 19:27:36,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:36,936 INFO L225 Difference]: With dead ends: 1002 [2021-10-21 19:27:36,936 INFO L226 Difference]: Without dead ends: 997 [2021-10-21 19:27:36,937 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:27:36,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2021-10-21 19:27:37,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 994. [2021-10-21 19:27:37,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 988 states have (on average 1.3846153846153846) internal successors, (1368), 993 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:37,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1368 transitions. [2021-10-21 19:27:37,008 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1368 transitions. Word has length 32 [2021-10-21 19:27:37,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:37,008 INFO L470 AbstractCegarLoop]: Abstraction has 994 states and 1368 transitions. [2021-10-21 19:27:37,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:37,009 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1368 transitions. [2021-10-21 19:27:37,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-21 19:27:37,011 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:37,011 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-21 19:27:37,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-21 19:27:37,011 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:37,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:37,012 INFO L82 PathProgramCache]: Analyzing trace with hash 635619136, now seen corresponding path program 1 times [2021-10-21 19:27:37,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:37,012 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264091183] [2021-10-21 19:27:37,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:37,013 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:37,048 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-21 19:27:37,048 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:37,048 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264091183] [2021-10-21 19:27:37,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264091183] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:37,049 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:37,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:27:37,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949465682] [2021-10-21 19:27:37,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:27:37,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:37,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:27:37,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:27:37,052 INFO L87 Difference]: Start difference. First operand 994 states and 1368 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:37,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:37,139 INFO L93 Difference]: Finished difference Result 1095 states and 1504 transitions. [2021-10-21 19:27:37,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:27:37,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-10-21 19:27:37,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:37,145 INFO L225 Difference]: With dead ends: 1095 [2021-10-21 19:27:37,145 INFO L226 Difference]: Without dead ends: 978 [2021-10-21 19:27:37,146 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-21 19:27:37,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2021-10-21 19:27:37,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 978. [2021-10-21 19:27:37,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 972 states have (on average 1.3775720164609053) internal successors, (1339), 977 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:37,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1339 transitions. [2021-10-21 19:27:37,214 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1339 transitions. Word has length 32 [2021-10-21 19:27:37,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:37,214 INFO L470 AbstractCegarLoop]: Abstraction has 978 states and 1339 transitions. [2021-10-21 19:27:37,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:37,215 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1339 transitions. [2021-10-21 19:27:37,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-21 19:27:37,217 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:37,217 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:27:37,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-21 19:27:37,217 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:37,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:37,218 INFO L82 PathProgramCache]: Analyzing trace with hash -369077776, now seen corresponding path program 1 times [2021-10-21 19:27:37,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:37,218 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583328123] [2021-10-21 19:27:37,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:37,218 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:37,262 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-21 19:27:37,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:37,262 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583328123] [2021-10-21 19:27:37,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583328123] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:37,263 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:37,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 19:27:37,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069420827] [2021-10-21 19:27:37,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:27:37,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:37,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:27:37,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:27:37,264 INFO L87 Difference]: Start difference. First operand 978 states and 1339 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:37,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:37,419 INFO L93 Difference]: Finished difference Result 992 states and 1353 transitions. [2021-10-21 19:27:37,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-21 19:27:37,420 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-10-21 19:27:37,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:37,425 INFO L225 Difference]: With dead ends: 992 [2021-10-21 19:27:37,426 INFO L226 Difference]: Without dead ends: 989 [2021-10-21 19:27:37,426 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-21 19:27:37,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2021-10-21 19:27:37,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 984. [2021-10-21 19:27:37,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 978 states have (on average 1.3762781186094069) internal successors, (1346), 983 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:37,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1346 transitions. [2021-10-21 19:27:37,497 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1346 transitions. Word has length 32 [2021-10-21 19:27:37,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:37,497 INFO L470 AbstractCegarLoop]: Abstraction has 984 states and 1346 transitions. [2021-10-21 19:27:37,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:37,498 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1346 transitions. [2021-10-21 19:27:37,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-21 19:27:37,502 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:37,502 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-21 19:27:37,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-21 19:27:37,503 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:37,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:37,503 INFO L82 PathProgramCache]: Analyzing trace with hash -369089692, now seen corresponding path program 1 times [2021-10-21 19:27:37,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:37,504 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111181314] [2021-10-21 19:27:37,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:37,504 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:37,550 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-21 19:27:37,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:37,551 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111181314] [2021-10-21 19:27:37,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111181314] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:37,551 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:37,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 19:27:37,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361932893] [2021-10-21 19:27:37,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:27:37,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:37,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:27:37,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:27:37,554 INFO L87 Difference]: Start difference. First operand 984 states and 1346 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:37,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:37,678 INFO L93 Difference]: Finished difference Result 1001 states and 1363 transitions. [2021-10-21 19:27:37,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-21 19:27:37,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-10-21 19:27:37,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:37,684 INFO L225 Difference]: With dead ends: 1001 [2021-10-21 19:27:37,684 INFO L226 Difference]: Without dead ends: 983 [2021-10-21 19:27:37,685 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.4ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-21 19:27:37,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2021-10-21 19:27:37,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 983. [2021-10-21 19:27:37,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 977 states have (on average 1.375639713408393) internal successors, (1344), 982 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:37,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1344 transitions. [2021-10-21 19:27:37,752 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1344 transitions. Word has length 32 [2021-10-21 19:27:37,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:37,752 INFO L470 AbstractCegarLoop]: Abstraction has 983 states and 1344 transitions. [2021-10-21 19:27:37,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:37,752 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1344 transitions. [2021-10-21 19:27:37,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-21 19:27:37,754 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:37,755 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-21 19:27:37,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-21 19:27:37,755 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:37,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:37,756 INFO L82 PathProgramCache]: Analyzing trace with hash -603608195, now seen corresponding path program 1 times [2021-10-21 19:27:37,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:37,756 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336402585] [2021-10-21 19:27:37,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:37,756 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:37,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:27:37,827 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:37,827 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336402585] [2021-10-21 19:27:37,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336402585] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:37,828 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:37,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-21 19:27:37,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351842145] [2021-10-21 19:27:37,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-21 19:27:37,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:37,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-21 19:27:37,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-21 19:27:37,829 INFO L87 Difference]: Start difference. First operand 983 states and 1344 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:38,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:38,050 INFO L93 Difference]: Finished difference Result 1004 states and 1366 transitions. [2021-10-21 19:27:38,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-21 19:27:38,050 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-10-21 19:27:38,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:38,056 INFO L225 Difference]: With dead ends: 1004 [2021-10-21 19:27:38,056 INFO L226 Difference]: Without dead ends: 974 [2021-10-21 19:27:38,057 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 47.9ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-21 19:27:38,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2021-10-21 19:27:38,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2021-10-21 19:27:38,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 968 states have (on average 1.365702479338843) internal successors, (1322), 973 states have internal predecessors, (1322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:38,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1322 transitions. [2021-10-21 19:27:38,142 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1322 transitions. Word has length 33 [2021-10-21 19:27:38,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:38,142 INFO L470 AbstractCegarLoop]: Abstraction has 974 states and 1322 transitions. [2021-10-21 19:27:38,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:38,143 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1322 transitions. [2021-10-21 19:27:38,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-21 19:27:38,146 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:38,146 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-21 19:27:38,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-21 19:27:38,146 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:38,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:38,147 INFO L82 PathProgramCache]: Analyzing trace with hash -691762275, now seen corresponding path program 1 times [2021-10-21 19:27:38,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:38,147 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406572280] [2021-10-21 19:27:38,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:38,147 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:38,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:38,252 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-21 19:27:38,253 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:38,253 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406572280] [2021-10-21 19:27:38,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406572280] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:38,253 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:38,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-21 19:27:38,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732580247] [2021-10-21 19:27:38,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-21 19:27:38,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:38,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-21 19:27:38,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-21 19:27:38,258 INFO L87 Difference]: Start difference. First operand 974 states and 1322 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:38,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:38,681 INFO L93 Difference]: Finished difference Result 1009 states and 1356 transitions. [2021-10-21 19:27:38,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-21 19:27:38,682 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-10-21 19:27:38,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:38,687 INFO L225 Difference]: With dead ends: 1009 [2021-10-21 19:27:38,687 INFO L226 Difference]: Without dead ends: 1006 [2021-10-21 19:27:38,688 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 85.7ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-21 19:27:38,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2021-10-21 19:27:38,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 974. [2021-10-21 19:27:38,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 968 states have (on average 1.365702479338843) internal successors, (1322), 973 states have internal predecessors, (1322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:38,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1322 transitions. [2021-10-21 19:27:38,772 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1322 transitions. Word has length 33 [2021-10-21 19:27:38,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:38,773 INFO L470 AbstractCegarLoop]: Abstraction has 974 states and 1322 transitions. [2021-10-21 19:27:38,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:38,773 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1322 transitions. [2021-10-21 19:27:38,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-21 19:27:38,775 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:38,775 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-21 19:27:38,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-21 19:27:38,776 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:38,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:38,776 INFO L82 PathProgramCache]: Analyzing trace with hash -691774191, now seen corresponding path program 1 times [2021-10-21 19:27:38,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:38,776 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167793830] [2021-10-21 19:27:38,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:38,777 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:38,841 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-21 19:27:38,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:38,841 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167793830] [2021-10-21 19:27:38,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167793830] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:38,842 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:38,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:27:38,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283394076] [2021-10-21 19:27:38,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:27:38,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:38,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:27:38,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:27:38,843 INFO L87 Difference]: Start difference. First operand 974 states and 1322 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:39,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:39,107 INFO L93 Difference]: Finished difference Result 985 states and 1333 transitions. [2021-10-21 19:27:39,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:27:39,107 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-21 19:27:39,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:39,123 INFO L225 Difference]: With dead ends: 985 [2021-10-21 19:27:39,128 INFO L226 Difference]: Without dead ends: 926 [2021-10-21 19:27:39,129 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:27:39,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2021-10-21 19:27:39,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 923. [2021-10-21 19:27:39,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 917 states have (on average 1.3751363140676118) internal successors, (1261), 922 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:39,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1261 transitions. [2021-10-21 19:27:39,205 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1261 transitions. Word has length 33 [2021-10-21 19:27:39,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:39,205 INFO L470 AbstractCegarLoop]: Abstraction has 923 states and 1261 transitions. [2021-10-21 19:27:39,205 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-21 19:27:39,206 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1261 transitions. [2021-10-21 19:27:39,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-21 19:27:39,208 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:39,208 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-21 19:27:39,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-21 19:27:39,208 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:39,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:39,209 INFO L82 PathProgramCache]: Analyzing trace with hash -2061346662, now seen corresponding path program 1 times [2021-10-21 19:27:39,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:39,209 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868167503] [2021-10-21 19:27:39,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:39,210 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:39,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:39,307 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-21 19:27:39,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:39,307 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868167503] [2021-10-21 19:27:39,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868167503] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:39,308 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:39,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-21 19:27:39,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943223849] [2021-10-21 19:27:39,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-21 19:27:39,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:39,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-21 19:27:39,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-21 19:27:39,309 INFO L87 Difference]: Start difference. First operand 923 states and 1261 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:39,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:39,580 INFO L93 Difference]: Finished difference Result 945 states and 1284 transitions. [2021-10-21 19:27:39,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-21 19:27:39,581 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-10-21 19:27:39,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:39,595 INFO L225 Difference]: With dead ends: 945 [2021-10-21 19:27:39,596 INFO L226 Difference]: Without dead ends: 917 [2021-10-21 19:27:39,597 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 84.2ms TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2021-10-21 19:27:39,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2021-10-21 19:27:39,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 917. [2021-10-21 19:27:39,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 911 states have (on average 1.3644346871569704) internal successors, (1243), 916 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:39,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1243 transitions. [2021-10-21 19:27:39,663 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1243 transitions. Word has length 34 [2021-10-21 19:27:39,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:39,664 INFO L470 AbstractCegarLoop]: Abstraction has 917 states and 1243 transitions. [2021-10-21 19:27:39,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:39,664 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1243 transitions. [2021-10-21 19:27:39,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-21 19:27:39,666 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:39,666 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-21 19:27:39,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-21 19:27:39,667 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:39,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:39,667 INFO L82 PathProgramCache]: Analyzing trace with hash -842658898, now seen corresponding path program 1 times [2021-10-21 19:27:39,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:39,667 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089407226] [2021-10-21 19:27:39,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:39,668 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:39,692 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-21 19:27:39,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:39,693 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089407226] [2021-10-21 19:27:39,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089407226] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:39,694 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:39,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:27:39,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325144965] [2021-10-21 19:27:39,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:27:39,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:39,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:27:39,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:27:39,696 INFO L87 Difference]: Start difference. First operand 917 states and 1243 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:39,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:39,826 INFO L93 Difference]: Finished difference Result 1290 states and 1738 transitions. [2021-10-21 19:27:39,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:27:39,827 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-21 19:27:39,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:39,830 INFO L225 Difference]: With dead ends: 1290 [2021-10-21 19:27:39,830 INFO L226 Difference]: Without dead ends: 1114 [2021-10-21 19:27:39,831 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:27:39,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2021-10-21 19:27:39,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 917. [2021-10-21 19:27:39,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 911 states have (on average 1.353457738748628) internal successors, (1233), 916 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:39,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1233 transitions. [2021-10-21 19:27:39,906 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1233 transitions. Word has length 34 [2021-10-21 19:27:39,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:39,906 INFO L470 AbstractCegarLoop]: Abstraction has 917 states and 1233 transitions. [2021-10-21 19:27:39,906 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-21 19:27:39,906 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1233 transitions. [2021-10-21 19:27:39,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-21 19:27:39,908 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:39,908 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-21 19:27:39,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-21 19:27:39,909 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:39,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:39,909 INFO L82 PathProgramCache]: Analyzing trace with hash -419957072, now seen corresponding path program 1 times [2021-10-21 19:27:39,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:39,910 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421993217] [2021-10-21 19:27:39,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:39,910 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:40,001 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-21 19:27:40,002 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:40,002 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421993217] [2021-10-21 19:27:40,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421993217] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:40,002 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:40,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-21 19:27:40,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837539069] [2021-10-21 19:27:40,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-21 19:27:40,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:40,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-21 19:27:40,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-21 19:27:40,004 INFO L87 Difference]: Start difference. First operand 917 states and 1233 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:40,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:40,167 INFO L93 Difference]: Finished difference Result 933 states and 1249 transitions. [2021-10-21 19:27:40,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-21 19:27:40,168 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-10-21 19:27:40,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:40,171 INFO L225 Difference]: With dead ends: 933 [2021-10-21 19:27:40,171 INFO L226 Difference]: Without dead ends: 915 [2021-10-21 19:27:40,172 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 50.3ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-21 19:27:40,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2021-10-21 19:27:40,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 915. [2021-10-21 19:27:40,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 909 states have (on average 1.353135313531353) internal successors, (1230), 914 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:40,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1230 transitions. [2021-10-21 19:27:40,252 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1230 transitions. Word has length 34 [2021-10-21 19:27:40,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:40,253 INFO L470 AbstractCegarLoop]: Abstraction has 915 states and 1230 transitions. [2021-10-21 19:27:40,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:40,253 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1230 transitions. [2021-10-21 19:27:40,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-21 19:27:40,255 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:40,255 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-21 19:27:40,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-21 19:27:40,256 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:40,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:40,256 INFO L82 PathProgramCache]: Analyzing trace with hash 732400922, now seen corresponding path program 1 times [2021-10-21 19:27:40,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:40,257 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146312383] [2021-10-21 19:27:40,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:40,258 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:40,288 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-21 19:27:40,288 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:40,288 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146312383] [2021-10-21 19:27:40,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146312383] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:40,288 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:40,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:27:40,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031766682] [2021-10-21 19:27:40,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:27:40,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:40,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:27:40,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:27:40,290 INFO L87 Difference]: Start difference. First operand 915 states and 1230 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:40,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:40,377 INFO L93 Difference]: Finished difference Result 967 states and 1286 transitions. [2021-10-21 19:27:40,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:27:40,377 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-21 19:27:40,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:40,379 INFO L225 Difference]: With dead ends: 967 [2021-10-21 19:27:40,380 INFO L226 Difference]: Without dead ends: 933 [2021-10-21 19:27:40,380 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-21 19:27:40,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2021-10-21 19:27:40,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 915. [2021-10-21 19:27:40,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 909 states have (on average 1.352035203520352) internal successors, (1229), 914 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:40,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1229 transitions. [2021-10-21 19:27:40,450 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1229 transitions. Word has length 34 [2021-10-21 19:27:40,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:40,450 INFO L470 AbstractCegarLoop]: Abstraction has 915 states and 1229 transitions. [2021-10-21 19:27:40,451 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-21 19:27:40,451 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1229 transitions. [2021-10-21 19:27:40,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-21 19:27:40,453 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:40,453 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-21 19:27:40,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-21 19:27:40,454 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:40,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:40,454 INFO L82 PathProgramCache]: Analyzing trace with hash 908827288, now seen corresponding path program 1 times [2021-10-21 19:27:40,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:40,454 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836452917] [2021-10-21 19:27:40,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:40,455 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:40,483 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-21 19:27:40,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:40,484 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836452917] [2021-10-21 19:27:40,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836452917] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:40,484 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:40,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:27:40,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413971320] [2021-10-21 19:27:40,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:27:40,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:40,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:27:40,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:27:40,486 INFO L87 Difference]: Start difference. First operand 915 states and 1229 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:40,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:40,672 INFO L93 Difference]: Finished difference Result 1074 states and 1434 transitions. [2021-10-21 19:27:40,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:27:40,673 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-21 19:27:40,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:40,675 INFO L225 Difference]: With dead ends: 1074 [2021-10-21 19:27:40,675 INFO L226 Difference]: Without dead ends: 1053 [2021-10-21 19:27:40,675 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:27:40,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2021-10-21 19:27:40,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 915. [2021-10-21 19:27:40,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 909 states have (on average 1.350935093509351) internal successors, (1228), 914 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:40,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1228 transitions. [2021-10-21 19:27:40,746 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1228 transitions. Word has length 35 [2021-10-21 19:27:40,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:40,747 INFO L470 AbstractCegarLoop]: Abstraction has 915 states and 1228 transitions. [2021-10-21 19:27:40,747 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-21 19:27:40,747 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1228 transitions. [2021-10-21 19:27:40,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-21 19:27:40,749 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:40,749 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-21 19:27:40,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-21 19:27:40,749 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:40,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:40,750 INFO L82 PathProgramCache]: Analyzing trace with hash 479003308, now seen corresponding path program 1 times [2021-10-21 19:27:40,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:40,751 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921002085] [2021-10-21 19:27:40,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:40,751 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:40,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:40,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:27:40,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:40,826 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921002085] [2021-10-21 19:27:40,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921002085] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:40,827 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:40,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 19:27:40,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697607198] [2021-10-21 19:27:40,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-21 19:27:40,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:40,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-21 19:27:40,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:27:40,828 INFO L87 Difference]: Start difference. First operand 915 states and 1228 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:41,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:41,166 INFO L93 Difference]: Finished difference Result 946 states and 1258 transitions. [2021-10-21 19:27:41,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-21 19:27:41,167 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-10-21 19:27:41,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:41,169 INFO L225 Difference]: With dead ends: 946 [2021-10-21 19:27:41,169 INFO L226 Difference]: Without dead ends: 917 [2021-10-21 19:27:41,170 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 87.5ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-10-21 19:27:41,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2021-10-21 19:27:41,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 899. [2021-10-21 19:27:41,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 893 states have (on average 1.3527435610302352) internal successors, (1208), 898 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:41,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1208 transitions. [2021-10-21 19:27:41,241 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1208 transitions. Word has length 35 [2021-10-21 19:27:41,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:41,242 INFO L470 AbstractCegarLoop]: Abstraction has 899 states and 1208 transitions. [2021-10-21 19:27:41,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:41,242 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1208 transitions. [2021-10-21 19:27:41,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-21 19:27:41,245 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:41,245 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-21 19:27:41,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-21 19:27:41,245 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:41,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:41,246 INFO L82 PathProgramCache]: Analyzing trace with hash 290487121, now seen corresponding path program 1 times [2021-10-21 19:27:41,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:41,246 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417685336] [2021-10-21 19:27:41,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:41,246 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:41,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:41,307 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-21 19:27:41,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:41,308 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417685336] [2021-10-21 19:27:41,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417685336] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:41,309 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:41,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 19:27:41,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155207282] [2021-10-21 19:27:41,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-21 19:27:41,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:41,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-21 19:27:41,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:27:41,311 INFO L87 Difference]: Start difference. First operand 899 states and 1208 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:41,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:41,490 INFO L93 Difference]: Finished difference Result 915 states and 1224 transitions. [2021-10-21 19:27:41,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-21 19:27:41,491 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-21 19:27:41,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:41,493 INFO L225 Difference]: With dead ends: 915 [2021-10-21 19:27:41,493 INFO L226 Difference]: Without dead ends: 884 [2021-10-21 19:27:41,494 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 58.7ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-10-21 19:27:41,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2021-10-21 19:27:41,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 884. [2021-10-21 19:27:41,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 878 states have (on average 1.3519362186788155) internal successors, (1187), 883 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:41,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1187 transitions. [2021-10-21 19:27:41,586 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1187 transitions. Word has length 36 [2021-10-21 19:27:41,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:41,586 INFO L470 AbstractCegarLoop]: Abstraction has 884 states and 1187 transitions. [2021-10-21 19:27:41,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:41,587 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1187 transitions. [2021-10-21 19:27:41,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-21 19:27:41,588 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:41,589 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-21 19:27:41,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-21 19:27:41,589 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:41,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:41,590 INFO L82 PathProgramCache]: Analyzing trace with hash 2146304349, now seen corresponding path program 1 times [2021-10-21 19:27:41,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:41,590 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086759718] [2021-10-21 19:27:41,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:41,591 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:41,665 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-21 19:27:41,665 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:41,665 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086759718] [2021-10-21 19:27:41,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086759718] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:41,666 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:41,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-21 19:27:41,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335424710] [2021-10-21 19:27:41,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-21 19:27:41,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:41,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-21 19:27:41,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-21 19:27:41,668 INFO L87 Difference]: Start difference. First operand 884 states and 1187 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:41,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:41,848 INFO L93 Difference]: Finished difference Result 900 states and 1203 transitions. [2021-10-21 19:27:41,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-21 19:27:41,848 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-21 19:27:41,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:41,850 INFO L225 Difference]: With dead ends: 900 [2021-10-21 19:27:41,850 INFO L226 Difference]: Without dead ends: 872 [2021-10-21 19:27:41,852 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 41.5ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-21 19:27:41,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2021-10-21 19:27:41,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2021-10-21 19:27:41,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 866 states have (on average 1.3498845265588915) internal successors, (1169), 871 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:41,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1169 transitions. [2021-10-21 19:27:41,916 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1169 transitions. Word has length 36 [2021-10-21 19:27:41,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:41,917 INFO L470 AbstractCegarLoop]: Abstraction has 872 states and 1169 transitions. [2021-10-21 19:27:41,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:41,917 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1169 transitions. [2021-10-21 19:27:41,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-21 19:27:41,919 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:41,919 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-21 19:27:41,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-21 19:27:41,919 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:41,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:41,920 INFO L82 PathProgramCache]: Analyzing trace with hash -700544509, now seen corresponding path program 1 times [2021-10-21 19:27:41,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:41,920 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547967231] [2021-10-21 19:27:41,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:41,921 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:42,040 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-21 19:27:42,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:42,040 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547967231] [2021-10-21 19:27:42,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547967231] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:42,041 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:42,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-21 19:27:42,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846367431] [2021-10-21 19:27:42,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-21 19:27:42,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:42,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-21 19:27:42,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-21 19:27:42,042 INFO L87 Difference]: Start difference. First operand 872 states and 1169 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:42,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:42,461 INFO L93 Difference]: Finished difference Result 903 states and 1199 transitions. [2021-10-21 19:27:42,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-21 19:27:42,461 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-21 19:27:42,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:42,463 INFO L225 Difference]: With dead ends: 903 [2021-10-21 19:27:42,463 INFO L226 Difference]: Without dead ends: 874 [2021-10-21 19:27:42,466 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 167.3ms TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2021-10-21 19:27:42,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2021-10-21 19:27:42,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 856. [2021-10-21 19:27:42,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 850 states have (on average 1.351764705882353) internal successors, (1149), 855 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:42,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1149 transitions. [2021-10-21 19:27:42,545 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1149 transitions. Word has length 36 [2021-10-21 19:27:42,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:42,546 INFO L470 AbstractCegarLoop]: Abstraction has 856 states and 1149 transitions. [2021-10-21 19:27:42,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:42,546 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1149 transitions. [2021-10-21 19:27:42,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-21 19:27:42,548 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:42,548 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:27:42,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-21 19:27:42,549 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:42,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:42,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1075516100, now seen corresponding path program 1 times [2021-10-21 19:27:42,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:42,550 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282566997] [2021-10-21 19:27:42,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:42,550 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:42,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:27:42,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:42,576 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282566997] [2021-10-21 19:27:42,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282566997] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:42,576 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:42,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:27:42,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664651088] [2021-10-21 19:27:42,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:27:42,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:42,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:27:42,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:27:42,578 INFO L87 Difference]: Start difference. First operand 856 states and 1149 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:42,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:42,674 INFO L93 Difference]: Finished difference Result 1052 states and 1409 transitions. [2021-10-21 19:27:42,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:27:42,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-21 19:27:42,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:42,676 INFO L225 Difference]: With dead ends: 1052 [2021-10-21 19:27:42,676 INFO L226 Difference]: Without dead ends: 716 [2021-10-21 19:27:42,677 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-21 19:27:42,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2021-10-21 19:27:42,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 666. [2021-10-21 19:27:42,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 660 states have (on average 1.343939393939394) internal successors, (887), 665 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:42,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 887 transitions. [2021-10-21 19:27:42,725 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 887 transitions. Word has length 37 [2021-10-21 19:27:42,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:42,726 INFO L470 AbstractCegarLoop]: Abstraction has 666 states and 887 transitions. [2021-10-21 19:27:42,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:42,726 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 887 transitions. [2021-10-21 19:27:42,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-21 19:27:42,727 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:42,728 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:27:42,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-21 19:27:42,729 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:42,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:42,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1405976500, now seen corresponding path program 1 times [2021-10-21 19:27:42,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:42,730 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144323892] [2021-10-21 19:27:42,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:42,730 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:42,846 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-21 19:27:42,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:42,846 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144323892] [2021-10-21 19:27:42,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144323892] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:42,847 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:42,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-21 19:27:42,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942863337] [2021-10-21 19:27:42,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-21 19:27:42,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:42,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-21 19:27:42,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-21 19:27:42,848 INFO L87 Difference]: Start difference. First operand 666 states and 887 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:43,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:43,298 INFO L93 Difference]: Finished difference Result 700 states and 920 transitions. [2021-10-21 19:27:43,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-21 19:27:43,299 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-10-21 19:27:43,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:43,300 INFO L225 Difference]: With dead ends: 700 [2021-10-21 19:27:43,301 INFO L226 Difference]: Without dead ends: 668 [2021-10-21 19:27:43,301 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 237.5ms TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2021-10-21 19:27:43,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2021-10-21 19:27:43,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 647. [2021-10-21 19:27:43,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 641 states have (on average 1.3416536661466458) internal successors, (860), 646 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:43,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 860 transitions. [2021-10-21 19:27:43,350 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 860 transitions. Word has length 37 [2021-10-21 19:27:43,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:43,350 INFO L470 AbstractCegarLoop]: Abstraction has 647 states and 860 transitions. [2021-10-21 19:27:43,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:43,350 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 860 transitions. [2021-10-21 19:27:43,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-21 19:27:43,352 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:43,352 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:27:43,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-21 19:27:43,352 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:43,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:43,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1404147991, now seen corresponding path program 1 times [2021-10-21 19:27:43,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:43,353 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885210715] [2021-10-21 19:27:43,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:43,354 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:43,399 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-21 19:27:43,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:43,400 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885210715] [2021-10-21 19:27:43,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885210715] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:43,400 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:43,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-21 19:27:43,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087079446] [2021-10-21 19:27:43,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-21 19:27:43,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:43,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-21 19:27:43,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-21 19:27:43,402 INFO L87 Difference]: Start difference. First operand 647 states and 860 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:43,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:43,575 INFO L93 Difference]: Finished difference Result 672 states and 889 transitions. [2021-10-21 19:27:43,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-21 19:27:43,576 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-10-21 19:27:43,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:43,577 INFO L225 Difference]: With dead ends: 672 [2021-10-21 19:27:43,577 INFO L226 Difference]: Without dead ends: 639 [2021-10-21 19:27:43,578 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.6ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-21 19:27:43,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2021-10-21 19:27:43,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2021-10-21 19:27:43,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 633 states have (on average 1.3364928909952607) internal successors, (846), 638 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:43,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 846 transitions. [2021-10-21 19:27:43,638 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 846 transitions. Word has length 38 [2021-10-21 19:27:43,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:43,638 INFO L470 AbstractCegarLoop]: Abstraction has 639 states and 846 transitions. [2021-10-21 19:27:43,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:43,638 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 846 transitions. [2021-10-21 19:27:43,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-21 19:27:43,644 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:43,644 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-21 19:27:43,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-21 19:27:43,644 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:43,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:43,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1025315248, now seen corresponding path program 1 times [2021-10-21 19:27:43,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:43,647 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747281767] [2021-10-21 19:27:43,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:43,647 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:43,671 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-21 19:27:43,671 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:43,671 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747281767] [2021-10-21 19:27:43,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747281767] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:43,672 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:43,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:27:43,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603501380] [2021-10-21 19:27:43,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:27:43,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:43,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:27:43,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:27:43,674 INFO L87 Difference]: Start difference. First operand 639 states and 846 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:43,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:43,745 INFO L93 Difference]: Finished difference Result 691 states and 908 transitions. [2021-10-21 19:27:43,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:27:43,746 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-21 19:27:43,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:43,747 INFO L225 Difference]: With dead ends: 691 [2021-10-21 19:27:43,748 INFO L226 Difference]: Without dead ends: 649 [2021-10-21 19:27:43,748 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:27:43,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2021-10-21 19:27:43,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 636. [2021-10-21 19:27:43,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 630 states have (on average 1.3349206349206348) internal successors, (841), 635 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:43,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 841 transitions. [2021-10-21 19:27:43,794 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 841 transitions. Word has length 38 [2021-10-21 19:27:43,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:43,795 INFO L470 AbstractCegarLoop]: Abstraction has 636 states and 841 transitions. [2021-10-21 19:27:43,795 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-21 19:27:43,795 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 841 transitions. [2021-10-21 19:27:43,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-21 19:27:43,796 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:43,797 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:27:43,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-21 19:27:43,797 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:43,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:43,797 INFO L82 PathProgramCache]: Analyzing trace with hash -2131208369, now seen corresponding path program 1 times [2021-10-21 19:27:43,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:43,798 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487111642] [2021-10-21 19:27:43,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:43,798 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:43,831 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-21 19:27:43,831 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:43,831 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487111642] [2021-10-21 19:27:43,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487111642] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:43,831 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:43,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:27:43,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963740031] [2021-10-21 19:27:43,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:27:43,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:43,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:27:43,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:27:43,834 INFO L87 Difference]: Start difference. First operand 636 states and 841 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:43,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:43,969 INFO L93 Difference]: Finished difference Result 730 states and 951 transitions. [2021-10-21 19:27:43,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 19:27:43,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-10-21 19:27:43,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:43,972 INFO L225 Difference]: With dead ends: 730 [2021-10-21 19:27:43,972 INFO L226 Difference]: Without dead ends: 688 [2021-10-21 19:27:43,972 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:27:43,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2021-10-21 19:27:44,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 626. [2021-10-21 19:27:44,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 620 states have (on average 1.3258064516129033) internal successors, (822), 625 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:44,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 822 transitions. [2021-10-21 19:27:44,020 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 822 transitions. Word has length 39 [2021-10-21 19:27:44,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:44,020 INFO L470 AbstractCegarLoop]: Abstraction has 626 states and 822 transitions. [2021-10-21 19:27:44,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:44,021 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 822 transitions. [2021-10-21 19:27:44,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-21 19:27:44,022 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:44,022 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:27:44,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-10-21 19:27:44,023 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:44,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:44,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1912353651, now seen corresponding path program 1 times [2021-10-21 19:27:44,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:44,024 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050083151] [2021-10-21 19:27:44,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:44,024 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:44,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:44,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:27:44,063 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:44,063 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050083151] [2021-10-21 19:27:44,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050083151] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:44,063 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:44,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:27:44,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903105283] [2021-10-21 19:27:44,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 19:27:44,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:44,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:27:44,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:27:44,065 INFO L87 Difference]: Start difference. First operand 626 states and 822 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:44,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:44,166 INFO L93 Difference]: Finished difference Result 713 states and 913 transitions. [2021-10-21 19:27:44,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 19:27:44,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-10-21 19:27:44,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:44,169 INFO L225 Difference]: With dead ends: 713 [2021-10-21 19:27:44,169 INFO L226 Difference]: Without dead ends: 693 [2021-10-21 19:27:44,169 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.3ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-21 19:27:44,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2021-10-21 19:27:44,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 633. [2021-10-21 19:27:44,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 627 states have (on average 1.3221690590111643) internal successors, (829), 632 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:44,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 829 transitions. [2021-10-21 19:27:44,220 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 829 transitions. Word has length 39 [2021-10-21 19:27:44,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:44,220 INFO L470 AbstractCegarLoop]: Abstraction has 633 states and 829 transitions. [2021-10-21 19:27:44,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:44,221 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 829 transitions. [2021-10-21 19:27:44,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-21 19:27:44,222 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:44,222 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:27:44,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-10-21 19:27:44,223 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:44,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:44,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1059382494, now seen corresponding path program 1 times [2021-10-21 19:27:44,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:44,223 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620879443] [2021-10-21 19:27:44,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:44,224 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:44,376 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-21 19:27:44,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:44,377 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620879443] [2021-10-21 19:27:44,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620879443] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:44,377 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:44,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:27:44,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174330912] [2021-10-21 19:27:44,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 19:27:44,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:44,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:27:44,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:27:44,380 INFO L87 Difference]: Start difference. First operand 633 states and 829 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:44,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:44,521 INFO L93 Difference]: Finished difference Result 766 states and 1000 transitions. [2021-10-21 19:27:44,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 19:27:44,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-10-21 19:27:44,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:44,523 INFO L225 Difference]: With dead ends: 766 [2021-10-21 19:27:44,523 INFO L226 Difference]: Without dead ends: 632 [2021-10-21 19:27:44,524 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 45.3ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-21 19:27:44,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2021-10-21 19:27:44,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 619. [2021-10-21 19:27:44,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 613 states have (on average 1.3164763458401305) internal successors, (807), 618 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:44,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 807 transitions. [2021-10-21 19:27:44,591 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 807 transitions. Word has length 39 [2021-10-21 19:27:44,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:44,591 INFO L470 AbstractCegarLoop]: Abstraction has 619 states and 807 transitions. [2021-10-21 19:27:44,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:44,592 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 807 transitions. [2021-10-21 19:27:44,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-21 19:27:44,593 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:44,593 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:27:44,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-10-21 19:27:44,594 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:44,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:44,594 INFO L82 PathProgramCache]: Analyzing trace with hash -494516766, now seen corresponding path program 1 times [2021-10-21 19:27:44,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:44,595 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515405615] [2021-10-21 19:27:44,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:44,595 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:44,651 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-21 19:27:44,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:44,651 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515405615] [2021-10-21 19:27:44,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515405615] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:44,652 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:44,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-21 19:27:44,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763111475] [2021-10-21 19:27:44,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-21 19:27:44,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:44,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-21 19:27:44,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-21 19:27:44,654 INFO L87 Difference]: Start difference. First operand 619 states and 807 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:44,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:44,818 INFO L93 Difference]: Finished difference Result 640 states and 829 transitions. [2021-10-21 19:27:44,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-21 19:27:44,819 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-10-21 19:27:44,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:44,820 INFO L225 Difference]: With dead ends: 640 [2021-10-21 19:27:44,820 INFO L226 Difference]: Without dead ends: 532 [2021-10-21 19:27:44,821 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 42.3ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-10-21 19:27:44,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-10-21 19:27:44,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2021-10-21 19:27:44,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 526 states have (on average 1.3193916349809887) internal successors, (694), 531 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:44,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 694 transitions. [2021-10-21 19:27:44,878 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 694 transitions. Word has length 40 [2021-10-21 19:27:44,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:44,878 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 694 transitions. [2021-10-21 19:27:44,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:44,878 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 694 transitions. [2021-10-21 19:27:44,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-21 19:27:44,880 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:44,880 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:27:44,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-10-21 19:27:44,880 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:44,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:44,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1734827187, now seen corresponding path program 1 times [2021-10-21 19:27:44,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:44,881 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72629675] [2021-10-21 19:27:44,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:44,881 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:44,930 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-21 19:27:44,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:44,930 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72629675] [2021-10-21 19:27:44,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72629675] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:44,931 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:44,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:27:44,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236007362] [2021-10-21 19:27:44,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:27:44,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:44,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:27:44,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:27:44,932 INFO L87 Difference]: Start difference. First operand 532 states and 694 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:45,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:45,091 INFO L93 Difference]: Finished difference Result 705 states and 915 transitions. [2021-10-21 19:27:45,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:27:45,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-10-21 19:27:45,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:45,094 INFO L225 Difference]: With dead ends: 705 [2021-10-21 19:27:45,094 INFO L226 Difference]: Without dead ends: 550 [2021-10-21 19:27:45,094 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:27:45,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2021-10-21 19:27:45,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 532. [2021-10-21 19:27:45,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 526 states have (on average 1.311787072243346) internal successors, (690), 531 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:45,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 690 transitions. [2021-10-21 19:27:45,156 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 690 transitions. Word has length 40 [2021-10-21 19:27:45,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:45,157 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 690 transitions. [2021-10-21 19:27:45,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:45,157 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 690 transitions. [2021-10-21 19:27:45,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-21 19:27:45,158 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:45,158 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-21 19:27:45,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-10-21 19:27:45,159 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:45,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:45,159 INFO L82 PathProgramCache]: Analyzing trace with hash 289296501, now seen corresponding path program 1 times [2021-10-21 19:27:45,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:45,159 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111728336] [2021-10-21 19:27:45,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:45,160 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:45,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:27:45,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:45,263 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111728336] [2021-10-21 19:27:45,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111728336] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:45,263 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:45,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-21 19:27:45,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782241207] [2021-10-21 19:27:45,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-21 19:27:45,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:45,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-21 19:27:45,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-10-21 19:27:45,265 INFO L87 Difference]: Start difference. First operand 532 states and 690 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:45,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:45,575 INFO L93 Difference]: Finished difference Result 624 states and 800 transitions. [2021-10-21 19:27:45,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-21 19:27:45,576 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-10-21 19:27:45,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:45,577 INFO L225 Difference]: With dead ends: 624 [2021-10-21 19:27:45,577 INFO L226 Difference]: Without dead ends: 479 [2021-10-21 19:27:45,578 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 122.5ms TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2021-10-21 19:27:45,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2021-10-21 19:27:45,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 432. [2021-10-21 19:27:45,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 426 states have (on average 1.2863849765258215) internal successors, (548), 431 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:45,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 548 transitions. [2021-10-21 19:27:45,625 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 548 transitions. Word has length 41 [2021-10-21 19:27:45,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:45,627 INFO L470 AbstractCegarLoop]: Abstraction has 432 states and 548 transitions. [2021-10-21 19:27:45,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:45,627 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 548 transitions. [2021-10-21 19:27:45,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-21 19:27:45,628 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:45,629 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-21 19:27:45,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-10-21 19:27:45,631 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:45,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:45,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1488645827, now seen corresponding path program 1 times [2021-10-21 19:27:45,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:45,631 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090383016] [2021-10-21 19:27:45,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:45,632 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:45,667 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-21 19:27:45,667 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:45,667 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090383016] [2021-10-21 19:27:45,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090383016] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:45,668 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:45,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:27:45,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570382051] [2021-10-21 19:27:45,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:27:45,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:45,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:27:45,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:27:45,669 INFO L87 Difference]: Start difference. First operand 432 states and 548 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:45,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:45,781 INFO L93 Difference]: Finished difference Result 481 states and 603 transitions. [2021-10-21 19:27:45,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:27:45,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-10-21 19:27:45,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:45,783 INFO L225 Difference]: With dead ends: 481 [2021-10-21 19:27:45,783 INFO L226 Difference]: Without dead ends: 468 [2021-10-21 19:27:45,783 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-21 19:27:45,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2021-10-21 19:27:45,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 458. [2021-10-21 19:27:45,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 452 states have (on average 1.2809734513274336) internal successors, (579), 457 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:45,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 579 transitions. [2021-10-21 19:27:45,835 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 579 transitions. Word has length 41 [2021-10-21 19:27:45,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:45,835 INFO L470 AbstractCegarLoop]: Abstraction has 458 states and 579 transitions. [2021-10-21 19:27:45,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:45,836 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 579 transitions. [2021-10-21 19:27:45,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-10-21 19:27:45,837 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:45,837 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:27:45,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-10-21 19:27:45,837 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:45,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:45,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1202346494, now seen corresponding path program 1 times [2021-10-21 19:27:45,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:45,838 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523725453] [2021-10-21 19:27:45,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:45,838 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:45,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:27:45,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:45,864 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523725453] [2021-10-21 19:27:45,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523725453] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:45,864 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:45,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:27:45,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098770390] [2021-10-21 19:27:45,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:27:45,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:45,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:27:45,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:27:45,865 INFO L87 Difference]: Start difference. First operand 458 states and 579 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:45,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:45,927 INFO L93 Difference]: Finished difference Result 484 states and 608 transitions. [2021-10-21 19:27:45,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:27:45,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-10-21 19:27:45,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:45,929 INFO L225 Difference]: With dead ends: 484 [2021-10-21 19:27:45,929 INFO L226 Difference]: Without dead ends: 453 [2021-10-21 19:27:45,929 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:27:45,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2021-10-21 19:27:45,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 450. [2021-10-21 19:27:45,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 444 states have (on average 1.2702702702702702) internal successors, (564), 449 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:45,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 564 transitions. [2021-10-21 19:27:45,979 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 564 transitions. Word has length 42 [2021-10-21 19:27:45,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:45,980 INFO L470 AbstractCegarLoop]: Abstraction has 450 states and 564 transitions. [2021-10-21 19:27:45,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:45,980 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 564 transitions. [2021-10-21 19:27:45,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-10-21 19:27:45,981 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:45,981 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:27:45,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-10-21 19:27:45,981 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:45,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:45,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1198792050, now seen corresponding path program 1 times [2021-10-21 19:27:45,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:45,982 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295630520] [2021-10-21 19:27:45,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:45,982 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:46,007 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-21 19:27:46,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:46,007 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295630520] [2021-10-21 19:27:46,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295630520] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:46,007 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:46,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:27:46,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559166857] [2021-10-21 19:27:46,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:27:46,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:46,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:27:46,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:27:46,009 INFO L87 Difference]: Start difference. First operand 450 states and 564 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:46,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:46,115 INFO L93 Difference]: Finished difference Result 535 states and 665 transitions. [2021-10-21 19:27:46,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:27:46,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-10-21 19:27:46,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:46,116 INFO L225 Difference]: With dead ends: 535 [2021-10-21 19:27:46,117 INFO L226 Difference]: Without dead ends: 394 [2021-10-21 19:27:46,117 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:27:46,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2021-10-21 19:27:46,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 374. [2021-10-21 19:27:46,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 370 states have (on average 1.2405405405405405) internal successors, (459), 373 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:46,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 459 transitions. [2021-10-21 19:27:46,179 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 459 transitions. Word has length 42 [2021-10-21 19:27:46,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:46,179 INFO L470 AbstractCegarLoop]: Abstraction has 374 states and 459 transitions. [2021-10-21 19:27:46,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:46,179 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 459 transitions. [2021-10-21 19:27:46,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-21 19:27:46,180 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:46,181 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] [2021-10-21 19:27:46,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-10-21 19:27:46,181 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:46,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:46,181 INFO L82 PathProgramCache]: Analyzing trace with hash 888562187, now seen corresponding path program 1 times [2021-10-21 19:27:46,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:46,182 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186088851] [2021-10-21 19:27:46,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:46,182 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:46,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:46,242 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-21 19:27:46,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:46,243 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186088851] [2021-10-21 19:27:46,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186088851] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:46,243 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:46,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 19:27:46,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463416240] [2021-10-21 19:27:46,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-21 19:27:46,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:46,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-21 19:27:46,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:27:46,245 INFO L87 Difference]: Start difference. First operand 374 states and 459 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:46,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:46,380 INFO L93 Difference]: Finished difference Result 417 states and 508 transitions. [2021-10-21 19:27:46,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-21 19:27:46,381 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-10-21 19:27:46,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:46,382 INFO L225 Difference]: With dead ends: 417 [2021-10-21 19:27:46,382 INFO L226 Difference]: Without dead ends: 392 [2021-10-21 19:27:46,383 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 60.9ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-10-21 19:27:46,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2021-10-21 19:27:46,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 362. [2021-10-21 19:27:46,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 358 states have (on average 1.2430167597765363) internal successors, (445), 361 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:46,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 445 transitions. [2021-10-21 19:27:46,421 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 445 transitions. Word has length 43 [2021-10-21 19:27:46,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:46,422 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 445 transitions. [2021-10-21 19:27:46,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:46,422 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 445 transitions. [2021-10-21 19:27:46,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-21 19:27:46,423 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:46,423 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:27:46,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-10-21 19:27:46,424 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:46,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:46,424 INFO L82 PathProgramCache]: Analyzing trace with hash -352812212, now seen corresponding path program 1 times [2021-10-21 19:27:46,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:46,424 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847746465] [2021-10-21 19:27:46,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:46,425 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:46,483 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-21 19:27:46,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:46,483 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847746465] [2021-10-21 19:27:46,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847746465] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:46,484 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:46,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:27:46,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25693836] [2021-10-21 19:27:46,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:27:46,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:46,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:27:46,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:27:46,485 INFO L87 Difference]: Start difference. First operand 362 states and 445 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:46,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:46,598 INFO L93 Difference]: Finished difference Result 367 states and 449 transitions. [2021-10-21 19:27:46,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:27:46,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-10-21 19:27:46,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:46,600 INFO L225 Difference]: With dead ends: 367 [2021-10-21 19:27:46,600 INFO L226 Difference]: Without dead ends: 343 [2021-10-21 19:27:46,600 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:27:46,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2021-10-21 19:27:46,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2021-10-21 19:27:46,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 339 states have (on average 1.238938053097345) internal successors, (420), 342 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:46,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 420 transitions. [2021-10-21 19:27:46,637 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 420 transitions. Word has length 43 [2021-10-21 19:27:46,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:46,637 INFO L470 AbstractCegarLoop]: Abstraction has 343 states and 420 transitions. [2021-10-21 19:27:46,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:46,638 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 420 transitions. [2021-10-21 19:27:46,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-21 19:27:46,639 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:46,639 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:27:46,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-10-21 19:27:46,640 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:46,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:46,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1424724662, now seen corresponding path program 1 times [2021-10-21 19:27:46,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:46,640 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348966179] [2021-10-21 19:27:46,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:46,641 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:46,750 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-21 19:27:46,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:46,750 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348966179] [2021-10-21 19:27:46,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348966179] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:46,751 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:46,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-21 19:27:46,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052342786] [2021-10-21 19:27:46,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-21 19:27:46,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:46,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-21 19:27:46,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-21 19:27:46,752 INFO L87 Difference]: Start difference. First operand 343 states and 420 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:47,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:47,053 INFO L93 Difference]: Finished difference Result 356 states and 433 transitions. [2021-10-21 19:27:47,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-21 19:27:47,054 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-10-21 19:27:47,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:47,055 INFO L225 Difference]: With dead ends: 356 [2021-10-21 19:27:47,055 INFO L226 Difference]: Without dead ends: 298 [2021-10-21 19:27:47,056 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 120.6ms TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2021-10-21 19:27:47,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-10-21 19:27:47,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2021-10-21 19:27:47,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 294 states have (on average 1.2312925170068028) internal successors, (362), 297 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:47,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 362 transitions. [2021-10-21 19:27:47,093 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 362 transitions. Word has length 44 [2021-10-21 19:27:47,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:47,093 INFO L470 AbstractCegarLoop]: Abstraction has 298 states and 362 transitions. [2021-10-21 19:27:47,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:47,095 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 362 transitions. [2021-10-21 19:27:47,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-21 19:27:47,096 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:47,096 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:27:47,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-10-21 19:27:47,096 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:47,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:47,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1904668637, now seen corresponding path program 1 times [2021-10-21 19:27:47,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:47,097 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506534614] [2021-10-21 19:27:47,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:47,097 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:47,171 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-21 19:27:47,172 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:47,172 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506534614] [2021-10-21 19:27:47,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506534614] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:47,172 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:47,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 19:27:47,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292358468] [2021-10-21 19:27:47,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:27:47,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:47,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:27:47,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:27:47,174 INFO L87 Difference]: Start difference. First operand 298 states and 362 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:47,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:47,338 INFO L93 Difference]: Finished difference Result 628 states and 758 transitions. [2021-10-21 19:27:47,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-21 19:27:47,339 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-10-21 19:27:47,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:47,340 INFO L225 Difference]: With dead ends: 628 [2021-10-21 19:27:47,340 INFO L226 Difference]: Without dead ends: 558 [2021-10-21 19:27:47,341 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 57.3ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-21 19:27:47,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2021-10-21 19:27:47,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 316. [2021-10-21 19:27:47,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 312 states have (on average 1.2243589743589745) internal successors, (382), 315 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:47,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 382 transitions. [2021-10-21 19:27:47,407 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 382 transitions. Word has length 44 [2021-10-21 19:27:47,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:47,407 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 382 transitions. [2021-10-21 19:27:47,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:47,407 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 382 transitions. [2021-10-21 19:27:47,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-21 19:27:47,408 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:47,409 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:27:47,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-10-21 19:27:47,409 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:47,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:47,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1732054660, now seen corresponding path program 1 times [2021-10-21 19:27:47,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:47,410 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622212784] [2021-10-21 19:27:47,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:47,410 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:47,443 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-21 19:27:47,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:47,444 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622212784] [2021-10-21 19:27:47,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622212784] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:47,444 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:47,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:27:47,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182251416] [2021-10-21 19:27:47,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:27:47,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:47,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:27:47,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:27:47,446 INFO L87 Difference]: Start difference. First operand 316 states and 382 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:47,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:47,555 INFO L93 Difference]: Finished difference Result 320 states and 385 transitions. [2021-10-21 19:27:47,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:27:47,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-10-21 19:27:47,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:47,557 INFO L225 Difference]: With dead ends: 320 [2021-10-21 19:27:47,558 INFO L226 Difference]: Without dead ends: 316 [2021-10-21 19:27:47,558 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:27:47,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-10-21 19:27:47,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2021-10-21 19:27:47,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 312 states have (on average 1.2211538461538463) internal successors, (381), 315 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:47,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 381 transitions. [2021-10-21 19:27:47,602 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 381 transitions. Word has length 44 [2021-10-21 19:27:47,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:47,603 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 381 transitions. [2021-10-21 19:27:47,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:47,604 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 381 transitions. [2021-10-21 19:27:47,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-21 19:27:47,605 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:47,605 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:27:47,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-10-21 19:27:47,605 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:47,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:47,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1966651937, now seen corresponding path program 1 times [2021-10-21 19:27:47,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:47,606 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323823336] [2021-10-21 19:27:47,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:47,606 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:47,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:47,632 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-21 19:27:47,632 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:47,632 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323823336] [2021-10-21 19:27:47,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323823336] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:47,633 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:47,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:27:47,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539735784] [2021-10-21 19:27:47,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:27:47,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:47,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:27:47,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:27:47,635 INFO L87 Difference]: Start difference. First operand 316 states and 381 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:47,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:47,729 INFO L93 Difference]: Finished difference Result 621 states and 743 transitions. [2021-10-21 19:27:47,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:27:47,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-10-21 19:27:47,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:47,731 INFO L225 Difference]: With dead ends: 621 [2021-10-21 19:27:47,731 INFO L226 Difference]: Without dead ends: 558 [2021-10-21 19:27:47,731 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:27:47,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2021-10-21 19:27:47,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 316. [2021-10-21 19:27:47,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 312 states have (on average 1.2147435897435896) internal successors, (379), 315 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:47,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 379 transitions. [2021-10-21 19:27:47,779 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 379 transitions. Word has length 44 [2021-10-21 19:27:47,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:47,780 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 379 transitions. [2021-10-21 19:27:47,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:47,780 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 379 transitions. [2021-10-21 19:27:47,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-21 19:27:47,781 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:47,782 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-21 19:27:47,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-10-21 19:27:47,782 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:47,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:47,783 INFO L82 PathProgramCache]: Analyzing trace with hash 2123245657, now seen corresponding path program 1 times [2021-10-21 19:27:47,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:47,783 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423198832] [2021-10-21 19:27:47,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:47,783 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:47,869 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-21 19:27:47,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:47,870 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423198832] [2021-10-21 19:27:47,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423198832] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:47,870 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:47,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 19:27:47,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214262579] [2021-10-21 19:27:47,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-21 19:27:47,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:47,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-21 19:27:47,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:27:47,872 INFO L87 Difference]: Start difference. First operand 316 states and 379 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:48,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:48,121 INFO L93 Difference]: Finished difference Result 535 states and 638 transitions. [2021-10-21 19:27:48,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-21 19:27:48,121 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-10-21 19:27:48,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:48,122 INFO L225 Difference]: With dead ends: 535 [2021-10-21 19:27:48,122 INFO L226 Difference]: Without dead ends: 429 [2021-10-21 19:27:48,123 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 79.9ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-10-21 19:27:48,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2021-10-21 19:27:48,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 324. [2021-10-21 19:27:48,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 320 states have (on average 1.203125) internal successors, (385), 323 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:48,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 385 transitions. [2021-10-21 19:27:48,171 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 385 transitions. Word has length 45 [2021-10-21 19:27:48,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:48,172 INFO L470 AbstractCegarLoop]: Abstraction has 324 states and 385 transitions. [2021-10-21 19:27:48,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:48,172 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 385 transitions. [2021-10-21 19:27:48,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-21 19:27:48,174 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:48,174 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-21 19:27:48,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-10-21 19:27:48,175 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:48,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:48,175 INFO L82 PathProgramCache]: Analyzing trace with hash -970126947, now seen corresponding path program 1 times [2021-10-21 19:27:48,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:48,176 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665015443] [2021-10-21 19:27:48,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:48,176 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:48,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:48,226 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-21 19:27:48,226 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:48,226 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665015443] [2021-10-21 19:27:48,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665015443] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:48,227 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:48,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 19:27:48,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809072656] [2021-10-21 19:27:48,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:27:48,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:48,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:27:48,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:27:48,228 INFO L87 Difference]: Start difference. First operand 324 states and 385 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:48,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:48,393 INFO L93 Difference]: Finished difference Result 576 states and 684 transitions. [2021-10-21 19:27:48,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-21 19:27:48,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-10-21 19:27:48,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:48,395 INFO L225 Difference]: With dead ends: 576 [2021-10-21 19:27:48,395 INFO L226 Difference]: Without dead ends: 537 [2021-10-21 19:27:48,396 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.2ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-21 19:27:48,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2021-10-21 19:27:48,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 290. [2021-10-21 19:27:48,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 287 states have (on average 1.1986062717770034) internal successors, (344), 289 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:48,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 344 transitions. [2021-10-21 19:27:48,443 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 344 transitions. Word has length 45 [2021-10-21 19:27:48,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:48,443 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 344 transitions. [2021-10-21 19:27:48,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:48,443 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 344 transitions. [2021-10-21 19:27:48,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-21 19:27:48,444 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:48,445 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] [2021-10-21 19:27:48,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-10-21 19:27:48,445 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:48,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:48,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1018198740, now seen corresponding path program 1 times [2021-10-21 19:27:48,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:48,446 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572939818] [2021-10-21 19:27:48,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:48,446 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:27:48,541 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-21 19:27:48,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:27:48,541 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572939818] [2021-10-21 19:27:48,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572939818] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:27:48,542 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:27:48,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-21 19:27:48,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702089382] [2021-10-21 19:27:48,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-21 19:27:48,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:27:48,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-21 19:27:48,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-21 19:27:48,543 INFO L87 Difference]: Start difference. First operand 290 states and 344 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:48,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:27:48,799 INFO L93 Difference]: Finished difference Result 290 states and 344 transitions. [2021-10-21 19:27:48,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-21 19:27:48,800 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-10-21 19:27:48,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:27:48,801 INFO L225 Difference]: With dead ends: 290 [2021-10-21 19:27:48,801 INFO L226 Difference]: Without dead ends: 214 [2021-10-21 19:27:48,801 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 118.2ms TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2021-10-21 19:27:48,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-10-21 19:27:48,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2021-10-21 19:27:48,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 212 states have (on average 1.1839622641509433) internal successors, (251), 213 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:48,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 251 transitions. [2021-10-21 19:27:48,834 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 251 transitions. Word has length 47 [2021-10-21 19:27:48,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:27:48,834 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 251 transitions. [2021-10-21 19:27:48,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:27:48,835 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 251 transitions. [2021-10-21 19:27:48,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-21 19:27:48,836 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:27:48,836 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] [2021-10-21 19:27:48,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-10-21 19:27:48,836 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 100 more)] === [2021-10-21 19:27:48,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:27:48,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1477898981, now seen corresponding path program 1 times [2021-10-21 19:27:48,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:27:48,837 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775036833] [2021-10-21 19:27:48,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:27:48,837 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:27:48,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:27:48,870 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:27:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:27:48,931 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:27:48,931 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-21 19:27:48,932 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr102ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,934 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,935 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,938 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,938 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,938 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,939 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,939 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,939 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,939 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,940 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,940 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,940 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,940 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,940 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,941 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,941 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,941 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,941 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,941 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,942 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,942 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,942 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,942 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,942 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,943 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,943 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,943 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,943 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,943 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,943 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,945 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,945 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,945 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,945 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,946 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,947 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,948 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,948 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,948 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,948 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,948 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,949 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,949 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,949 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,949 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,949 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,950 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,950 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,950 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,950 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,950 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,950 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,951 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,951 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,951 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,951 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,951 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,952 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,952 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,952 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,952 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,952 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,953 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,953 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,953 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,953 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,953 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,954 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,954 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,954 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,955 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,955 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,955 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,955 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,955 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,956 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,956 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,956 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,956 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,956 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,957 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,957 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,957 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,957 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,957 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,958 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,958 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,958 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,958 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,958 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,958 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,959 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,959 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:27:48,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-10-21 19:27:48,967 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-21 19:27:49,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 07:27:49 BoogieIcfgContainer [2021-10-21 19:27:49,087 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-21 19:27:49,087 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-21 19:27:49,087 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-21 19:27:49,087 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-21 19:27:49,088 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:27:29" (3/4) ... [2021-10-21 19:27:49,090 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-21 19:27:49,205 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a133bf31-4f16-4e31-969a-0fe798cad9d7/bin/uautomizer-j4sWxH34Be/witness.graphml [2021-10-21 19:27:49,206 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-21 19:27:49,207 INFO L168 Benchmark]: Toolchain (without parser) took 23296.28 ms. Allocated memory was 90.2 MB in the beginning and 434.1 MB in the end (delta: 343.9 MB). Free memory was 52.8 MB in the beginning and 225.0 MB in the end (delta: -172.2 MB). Peak memory consumption was 171.0 MB. Max. memory is 16.1 GB. [2021-10-21 19:27:49,209 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 90.2 MB. Free memory was 60.6 MB in the beginning and 60.6 MB in the end (delta: 26.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 19:27:49,210 INFO L168 Benchmark]: CACSL2BoogieTranslator took 727.91 ms. Allocated memory was 90.2 MB in the beginning and 119.5 MB in the end (delta: 29.4 MB). Free memory was 52.5 MB in the beginning and 76.6 MB in the end (delta: -24.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-21 19:27:49,210 INFO L168 Benchmark]: Boogie Procedure Inliner took 211.01 ms. Allocated memory is still 119.5 MB. Free memory was 76.6 MB in the beginning and 56.3 MB in the end (delta: 20.2 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-10-21 19:27:49,210 INFO L168 Benchmark]: Boogie Preprocessor took 152.13 ms. Allocated memory is still 119.5 MB. Free memory was 56.3 MB in the beginning and 43.7 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-21 19:27:49,211 INFO L168 Benchmark]: RCFGBuilder took 2495.67 ms. Allocated memory was 119.5 MB in the beginning and 169.9 MB in the end (delta: 50.3 MB). Free memory was 43.7 MB in the beginning and 87.7 MB in the end (delta: -43.9 MB). Peak memory consumption was 34.7 MB. Max. memory is 16.1 GB. [2021-10-21 19:27:49,212 INFO L168 Benchmark]: TraceAbstraction took 19576.82 ms. Allocated memory was 169.9 MB in the beginning and 434.1 MB in the end (delta: 264.2 MB). Free memory was 87.7 MB in the beginning and 237.6 MB in the end (delta: -149.9 MB). Peak memory consumption was 113.3 MB. Max. memory is 16.1 GB. [2021-10-21 19:27:49,212 INFO L168 Benchmark]: Witness Printer took 118.53 ms. Allocated memory is still 434.1 MB. Free memory was 237.6 MB in the beginning and 225.0 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-21 19:27:49,218 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.25 ms. Allocated memory is still 90.2 MB. Free memory was 60.6 MB in the beginning and 60.6 MB in the end (delta: 26.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 727.91 ms. Allocated memory was 90.2 MB in the beginning and 119.5 MB in the end (delta: 29.4 MB). Free memory was 52.5 MB in the beginning and 76.6 MB in the end (delta: -24.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 211.01 ms. Allocated memory is still 119.5 MB. Free memory was 76.6 MB in the beginning and 56.3 MB in the end (delta: 20.2 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 152.13 ms. Allocated memory is still 119.5 MB. Free memory was 56.3 MB in the beginning and 43.7 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2495.67 ms. Allocated memory was 119.5 MB in the beginning and 169.9 MB in the end (delta: 50.3 MB). Free memory was 43.7 MB in the beginning and 87.7 MB in the end (delta: -43.9 MB). Peak memory consumption was 34.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 19576.82 ms. Allocated memory was 169.9 MB in the beginning and 434.1 MB in the end (delta: 264.2 MB). Free memory was 87.7 MB in the beginning and 237.6 MB in the end (delta: -149.9 MB). Peak memory consumption was 113.3 MB. Max. memory is 16.1 GB. * Witness Printer took 118.53 ms. Allocated memory is still 434.1 MB. Free memory was 237.6 MB in the beginning and 225.0 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.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: 59]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int s ; [L33] int UNLOADED ; [L34] int NP ; [L35] int DC ; [L36] int SKIP1 ; [L37] int SKIP2 ; [L38] int MPR1 ; [L39] int MPR3 ; [L40] int IPC ; [L41] int pended ; [L42] int compFptr ; [L43] int compRegistered ; [L44] int lowerDriverReturn ; [L45] int setEventCalled ; [L46] int customIrp ; [L47] int routine ; [L48] int myStatus ; [L49] int pirp ; [L50] int Executive ; [L51] int Suspended ; [L52] int KernelMode ; [L53] int DeviceUsageTypePaging ; VAL [compFptr=0, compRegistered=0, customIrp=0, DC=0, DeviceUsageTypePaging=0, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, pirp=0, routine=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, Suspended=0, UNLOADED=0] [L1718] int pirp__IoStatus__Status ; [L1719] int d = __VERIFIER_nondet_int() ; [L1720] int status = __VERIFIER_nondet_int() ; [L1721] int irp = __VERIFIER_nondet_int() ; [L1722] int we_should_unload = __VERIFIER_nondet_int() ; [L1723] int irp_choice = __VERIFIER_nondet_int() ; [L1724] int devobj = __VERIFIER_nondet_int() ; [L1725] int __cil_tmp9 ; [L1730] s = 0 [L1731] UNLOADED = 0 [L1732] NP = 0 [L1733] DC = 0 [L1734] SKIP1 = 0 [L1735] SKIP2 = 0 [L1736] MPR1 = 0 [L1737] MPR3 = 0 [L1738] IPC = 0 [L1739] pended = 0 [L1740] compFptr = 0 [L1741] compRegistered = 0 [L1742] lowerDriverReturn = 0 [L1743] setEventCalled = 0 [L1744] customIrp = 0 [L1745] routine = 0 [L1746] myStatus = 0 [L1747] pirp = 0 [L1748] Executive = 0 [L1749] Suspended = 5 [L1750] KernelMode = 0 [L1751] DeviceUsageTypePaging = 1 [L1754] pirp = irp [L67] UNLOADED = 0 [L68] NP = 1 [L69] DC = 2 [L70] SKIP1 = 3 [L71] SKIP2 = 4 [L72] MPR1 = 5 [L73] MPR3 = 6 [L74] IPC = 7 [L75] s = UNLOADED [L76] pended = 0 [L77] compFptr = 0 [L78] compRegistered = 0 [L79] lowerDriverReturn = 0 [L80] setEventCalled = 0 [L81] customIrp = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=-2, routine=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1757] COND TRUE status >= 0 [L1758] s = NP [L1759] customIrp = 0 [L1760] setEventCalled = customIrp [L1761] lowerDriverReturn = setEventCalled [L1762] compRegistered = lowerDriverReturn [L1763] compFptr = compRegistered [L1764] pended = compFptr [L1765] pirp__IoStatus__Status = 0 [L1766] myStatus = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1767] COND TRUE irp_choice == 0 [L1768] pirp__IoStatus__Status = -1073741637 [L1769] myStatus = -1073741637 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1707] s = NP [L1708] customIrp = 0 [L1709] setEventCalled = customIrp [L1710] lowerDriverReturn = setEventCalled [L1711] compRegistered = lowerDriverReturn [L1712] compFptr = compRegistered [L1713] pended = compFptr VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1775] COND FALSE !(status < 0) [L1779] int tmp_ndt_1; [L1780] tmp_ndt_1 = __VERIFIER_nondet_int() [L1781] COND TRUE tmp_ndt_1 == 2 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L313] int deviceExtension__Active = __VERIFIER_nondet_int() ; [L314] int status ; VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L317] COND FALSE !(deviceExtension__Active == 2) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L320] COND FALSE !(deviceExtension__Active == 3) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L323] COND FALSE !(deviceExtension__Active == 1) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L326] COND TRUE deviceExtension__Active == 7 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1591] int currentIrpStack__Parameters__DeviceIoControl__IoControlCode = __VERIFIER_nondet_int() ; [L1592] int deviceExtension__TargetDeviceObject = __VERIFIER_nondet_int() ; [L1593] int irpSp__Control ; [L1594] int tmp ; [L1595] int tmp___0 ; [L1596] int __cil_tmp8 ; [L1597] int __cil_tmp9 ; [L1598] int __cil_tmp10 ; [L1599] int __cil_tmp11 ; [L1600] int __cil_tmp12 ; [L1604] __cil_tmp8 = 56 [L1605] __cil_tmp9 = 16384 [L1606] __cil_tmp10 = 131072 [L1607] __cil_tmp11 = 147456 [L1608] __cil_tmp12 = 147512 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1609] COND TRUE currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp12 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1610] COND FALSE !(s != NP) VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1615] COND FALSE !(compRegistered != 0) [L1620] compRegistered = 1 [L1621] routine = 0 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1625] irpSp__Control = 224 [L1900] int Irp__PendingReturned = __VERIFIER_nondet_int() ; [L1901] int returnVal2 ; [L1902] int compRetStatus ; [L1903] int lcontext = __VERIFIER_nondet_int() ; [L1904] unsigned long __cil_tmp8 ; VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1907] COND TRUE \read(compRegistered) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1908] COND TRUE routine == 0 [L1569] int Irp__PendingReturned = __VERIFIER_nondet_int() ; [L1570] int Irp__AssociatedIrp__SystemBuffer = __VERIFIER_nondet_int() ; [L1573] COND TRUE \read(Irp__PendingReturned) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1574] COND TRUE pended == 0 [L1575] pended = 1 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1582] COND FALSE !(myStatus >= 0) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1587] return (myStatus); VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1910] compRetStatus = HPCdrCompletion(DeviceObject, Irp, lcontext) [L1920] __cil_tmp8 = (unsigned long )compRetStatus VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1921] COND FALSE !(__cil_tmp8 == -1073741802) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1928] COND FALSE !(\read(Irp__PendingReturned)) [L1931] int tmp_ndt_4; [L1932] tmp_ndt_4 = __VERIFIER_nondet_int() [L1933] COND TRUE tmp_ndt_4 == 0 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1944] returnVal2 = 0 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1958] COND TRUE s == NP [L1959] s = IPC [L1960] lowerDriverReturn = returnVal2 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1981] return (returnVal2); VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1626] tmp = IofCallDriver(deviceExtension__TargetDeviceObject, Irp) [L1628] return (tmp); VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L348] status = CdAudioHPCdrDeviceControl(DeviceObject, Irp) [L363] return (status); VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1798] status = CdAudioDeviceControl(devobj, pirp) [L1819] COND TRUE \read(we_should_unload) [L1825] COND TRUE pended == 1 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1826] COND FALSE !(s == NP) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1833] COND TRUE pended == 1 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1834] COND FALSE !(s == MPR3) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1841] COND TRUE s != UNLOADED VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1842] COND TRUE status != -1 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1843] COND TRUE s != SKIP2 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1844] COND FALSE !(s != IPC) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1857] COND FALSE !(pended != 1) VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1869] COND TRUE status != 259 VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L59] reach_error() VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=-2, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1185 locations, 103 error locations. Started 1 CEGAR loops. OverallTime: 19385.5ms, OverallIterations: 56, TraceHistogramMax: 1, EmptinessCheckTime: 124.2ms, AutomataDifference: 11746.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 30.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 49574 SDtfs, 21547 SDslu, 110166 SDs, 0 SdLazy, 7182 SolverSat, 921 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4648.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 392 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1822.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1245occurred in iteration=4, InterpolantAutomatonStates: 283, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 3436.4ms AutomataMinimizationTime, 55 MinimizatonAttempts, 2604 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 164.3ms SsaConstructionTime, 780.7ms SatisfiabilityAnalysisTime, 2382.8ms InterpolantComputationTime, 1897 NumberOfCodeBlocks, 1897 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 1795 ConstructedInterpolants, 0 QuantifiedInterpolants, 4918 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 55 InterpolantComputations, 55 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-10-21 19:27:49,291 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a133bf31-4f16-4e31-969a-0fe798cad9d7/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...