/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/ldv-races/race-2_2-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 14:20:11,662 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 14:20:11,665 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 14:20:11,705 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 14:20:11,706 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 14:20:11,711 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 14:20:11,715 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 14:20:11,725 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 14:20:11,728 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 14:20:11,734 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 14:20:11,735 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 14:20:11,737 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 14:20:11,737 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 14:20:11,741 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 14:20:11,743 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 14:20:11,745 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 14:20:11,746 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 14:20:11,750 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 14:20:11,758 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 14:20:11,766 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 14:20:11,768 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 14:20:11,770 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 14:20:11,772 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 14:20:11,775 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 14:20:11,797 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 14:20:11,798 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 14:20:11,798 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 14:20:11,800 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 14:20:11,801 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 14:20:11,802 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 14:20:11,803 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 14:20:11,804 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 14:20:11,806 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 14:20:11,808 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 14:20:11,809 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 14:20:11,810 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 14:20:11,811 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 14:20:11,812 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 14:20:11,812 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 14:20:11,813 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 14:20:11,814 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 14:20:11,815 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-11-09 14:20:11,857 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 14:20:11,858 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 14:20:11,859 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 14:20:11,860 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 14:20:11,860 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 14:20:11,860 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 14:20:11,861 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 14:20:11,861 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 14:20:11,861 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 14:20:11,861 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 14:20:11,862 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 14:20:11,862 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 14:20:11,862 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 14:20:11,862 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 14:20:11,862 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 14:20:11,863 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 14:20:11,863 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 14:20:11,863 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 14:20:11,863 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 14:20:11,864 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 14:20:11,864 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 14:20:11,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 14:20:11,864 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 14:20:11,865 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-11-09 14:20:11,865 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 14:20:11,865 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 14:20:11,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 14:20:11,866 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-11-09 14:20:11,866 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-09 14:20:12,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 14:20:12,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 14:20:12,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 14:20:12,293 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 14:20:12,293 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 14:20:12,294 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_2-container_of.i [2020-11-09 14:20:12,385 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38bac4af4/2cd88aba6dbd4c0b87147cce9b3806e2/FLAGf59484ec7 [2020-11-09 14:20:13,327 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 14:20:13,328 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_2-container_of.i [2020-11-09 14:20:13,351 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38bac4af4/2cd88aba6dbd4c0b87147cce9b3806e2/FLAGf59484ec7 [2020-11-09 14:20:13,445 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38bac4af4/2cd88aba6dbd4c0b87147cce9b3806e2 [2020-11-09 14:20:13,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 14:20:13,455 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 14:20:13,456 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 14:20:13,457 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 14:20:13,461 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 14:20:13,462 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:20:13" (1/1) ... [2020-11-09 14:20:13,465 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32919b08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:20:13, skipping insertion in model container [2020-11-09 14:20:13,466 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:20:13" (1/1) ... [2020-11-09 14:20:13,474 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 14:20:13,526 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 14:20:13,688 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-11-09 14:20:14,358 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 14:20:14,367 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 14:20:14,382 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-11-09 14:20:14,466 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 14:20:14,836 INFO L208 MainTranslator]: Completed translation [2020-11-09 14:20:14,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:20:14 WrapperNode [2020-11-09 14:20:14,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 14:20:14,838 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 14:20:14,838 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 14:20:14,838 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 14:20:14,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:20:14" (1/1) ... [2020-11-09 14:20:14,882 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:20:14" (1/1) ... [2020-11-09 14:20:14,915 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 14:20:14,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 14:20:14,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 14:20:14,916 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 14:20:14,929 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:20:14" (1/1) ... [2020-11-09 14:20:14,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:20:14" (1/1) ... [2020-11-09 14:20:14,940 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:20:14" (1/1) ... [2020-11-09 14:20:14,940 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:20:14" (1/1) ... [2020-11-09 14:20:14,956 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:20:14" (1/1) ... [2020-11-09 14:20:14,959 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:20:14" (1/1) ... [2020-11-09 14:20:14,966 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:20:14" (1/1) ... [2020-11-09 14:20:14,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 14:20:14,976 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 14:20:14,976 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 14:20:14,976 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 14:20:14,977 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:20:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 14:20:15,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 14:20:15,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 14:20:15,083 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 14:20:15,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-09 14:20:15,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-09 14:20:15,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 14:20:15,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 14:20:15,085 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-11-09 14:20:15,086 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-11-09 14:20:15,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 14:20:15,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 14:20:15,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 14:20:15,089 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-09 14:20:15,779 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 14:20:15,780 INFO L298 CfgBuilder]: Removed 28 assume(true) statements. [2020-11-09 14:20:15,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:20:15 BoogieIcfgContainer [2020-11-09 14:20:15,783 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 14:20:15,785 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 14:20:15,785 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 14:20:15,789 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 14:20:15,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:20:13" (1/3) ... [2020-11-09 14:20:15,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eca815f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:20:15, skipping insertion in model container [2020-11-09 14:20:15,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:20:14" (2/3) ... [2020-11-09 14:20:15,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eca815f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:20:15, skipping insertion in model container [2020-11-09 14:20:15,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:20:15" (3/3) ... [2020-11-09 14:20:15,793 INFO L111 eAbstractionObserver]: Analyzing ICFG race-2_2-container_of.i [2020-11-09 14:20:15,810 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 14:20:15,811 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-09 14:20:15,815 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2020-11-09 14:20:15,816 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 14:20:15,852 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,852 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,853 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,853 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,853 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,853 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,854 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,854 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,854 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,854 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,854 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,854 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,855 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,855 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,855 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,855 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,856 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,856 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,856 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,856 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,856 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,856 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,857 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,857 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,857 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,857 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,857 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,857 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,858 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,858 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,858 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,858 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,858 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,859 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,859 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,859 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,859 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,859 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,860 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,860 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,860 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,860 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,860 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,861 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,861 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,861 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,861 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,862 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,862 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,862 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,862 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,862 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,863 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,863 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,863 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,863 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,863 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,863 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,864 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,864 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,864 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,864 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,864 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,864 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,864 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,865 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,865 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,865 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,865 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,865 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,866 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,866 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,866 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,866 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,866 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,866 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,867 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,867 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,867 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,867 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,867 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,867 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,868 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,868 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,868 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,868 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,868 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,869 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,869 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,869 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,869 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,869 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,870 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,870 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,870 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,870 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,871 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,871 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,871 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,871 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,874 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,874 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,874 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,875 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,875 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,875 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,875 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,875 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,875 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,876 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,876 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,879 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,879 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,879 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,880 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,880 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,880 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,880 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,880 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,881 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,881 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,881 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 14:20:15,893 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2020-11-09 14:20:15,907 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-09 14:20:15,931 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 14:20:15,931 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 14:20:15,931 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-09 14:20:15,931 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-09 14:20:15,931 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 14:20:15,932 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 14:20:15,932 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 14:20:15,932 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 14:20:15,947 INFO L128 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-11-09 14:20:15,948 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 151 transitions, 324 flow [2020-11-09 14:20:15,952 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 151 transitions, 324 flow [2020-11-09 14:20:15,954 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 145 places, 151 transitions, 324 flow [2020-11-09 14:20:16,029 INFO L129 PetriNetUnfolder]: 15/199 cut-off events. [2020-11-09 14:20:16,029 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-11-09 14:20:16,035 INFO L84 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 199 events. 15/199 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 429 event pairs, 0 based on Foata normal form. 0/177 useless extension candidates. Maximal degree in co-relation 98. Up to 4 conditions per place. [2020-11-09 14:20:16,040 INFO L116 LiptonReduction]: Number of co-enabled transitions 2124 [2020-11-09 14:20:19,592 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 14:20:19,623 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 14:20:19,629 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 14:20:19,649 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 14:20:19,650 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 14:20:19,651 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:75 [2020-11-09 14:20:19,760 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 14:20:19,787 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 14:20:19,791 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 14:20:19,814 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 14:20:19,816 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 14:20:19,817 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:75 [2020-11-09 14:20:20,867 WARN L194 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2020-11-09 14:20:22,602 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 14:20:22,627 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 14:20:22,640 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 14:20:22,661 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 14:20:22,663 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 14:20:22,664 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:74 [2020-11-09 14:20:22,735 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 14:20:22,765 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 14:20:22,772 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 14:20:22,791 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 14:20:22,793 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-09 14:20:22,794 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:74 [2020-11-09 14:20:22,943 WARN L194 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2020-11-09 14:20:24,043 WARN L194 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2020-11-09 14:20:24,074 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 14:20:24,143 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 14:20:24,151 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 14:20:24,217 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 14:20:24,218 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-09 14:20:24,219 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:148, output treesize:160 [2020-11-09 14:20:24,536 WARN L194 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2020-11-09 14:20:24,553 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 14:20:24,621 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 14:20:24,628 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-11-09 14:20:24,728 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-09 14:20:24,729 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-11-09 14:20:24,730 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:148, output treesize:160 [2020-11-09 14:20:25,654 WARN L194 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2020-11-09 14:20:25,898 WARN L194 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2020-11-09 14:20:26,312 WARN L194 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2020-11-09 14:20:26,531 WARN L194 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2020-11-09 14:20:26,833 WARN L194 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-11-09 14:20:27,071 WARN L194 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-11-09 14:20:27,305 WARN L194 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-11-09 14:20:27,522 WARN L194 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-11-09 14:20:27,910 WARN L194 SmtUtils]: Spent 385.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-11-09 14:20:28,426 WARN L194 SmtUtils]: Spent 505.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-11-09 14:20:28,859 WARN L194 SmtUtils]: Spent 431.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-11-09 14:20:29,310 WARN L194 SmtUtils]: Spent 447.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-11-09 14:20:30,302 WARN L194 SmtUtils]: Spent 974.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 144 [2020-11-09 14:20:30,747 WARN L194 SmtUtils]: Spent 436.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-11-09 14:20:31,626 WARN L194 SmtUtils]: Spent 876.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 144 [2020-11-09 14:20:32,126 WARN L194 SmtUtils]: Spent 494.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-11-09 14:20:33,788 WARN L194 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 148 DAG size of output: 142 [2020-11-09 14:20:34,484 WARN L194 SmtUtils]: Spent 690.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-11-09 14:20:36,027 WARN L194 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 148 DAG size of output: 142 [2020-11-09 14:20:36,667 WARN L194 SmtUtils]: Spent 634.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2020-11-09 14:20:36,673 INFO L131 LiptonReduction]: Checked pairs total: 3461 [2020-11-09 14:20:36,674 INFO L133 LiptonReduction]: Total number of compositions: 178 [2020-11-09 14:20:36,681 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 32 places, 30 transitions, 82 flow [2020-11-09 14:20:36,697 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 119 states. [2020-11-09 14:20:36,699 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states. [2020-11-09 14:20:36,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-11-09 14:20:36,704 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:20:36,705 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-11-09 14:20:36,706 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:20:36,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:20:36,712 INFO L82 PathProgramCache]: Analyzing trace with hash 17468860, now seen corresponding path program 1 times [2020-11-09 14:20:36,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:20:36,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094067364] [2020-11-09 14:20:36,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:20:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:20:37,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:20:37,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094067364] [2020-11-09 14:20:37,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:20:37,175 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 14:20:37,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137282856] [2020-11-09 14:20:37,181 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 14:20:37,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:20:37,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 14:20:37,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 14:20:37,199 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 3 states. [2020-11-09 14:20:37,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:20:37,315 INFO L93 Difference]: Finished difference Result 149 states and 304 transitions. [2020-11-09 14:20:37,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 14:20:37,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-11-09 14:20:37,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:20:37,331 INFO L225 Difference]: With dead ends: 149 [2020-11-09 14:20:37,332 INFO L226 Difference]: Without dead ends: 138 [2020-11-09 14:20:37,333 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 14:20:37,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-11-09 14:20:37,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 122. [2020-11-09 14:20:37,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-11-09 14:20:37,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 245 transitions. [2020-11-09 14:20:37,390 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 245 transitions. Word has length 4 [2020-11-09 14:20:37,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:20:37,391 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 245 transitions. [2020-11-09 14:20:37,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 14:20:37,391 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 245 transitions. [2020-11-09 14:20:37,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-09 14:20:37,392 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:20:37,392 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-09 14:20:37,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 14:20:37,392 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:20:37,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:20:37,393 INFO L82 PathProgramCache]: Analyzing trace with hash 541532734, now seen corresponding path program 1 times [2020-11-09 14:20:37,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:20:37,394 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342288139] [2020-11-09 14:20:37,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:20:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:20:37,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:20:37,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342288139] [2020-11-09 14:20:37,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:20:37,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 14:20:37,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941839318] [2020-11-09 14:20:37,503 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 14:20:37,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:20:37,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 14:20:37,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 14:20:37,506 INFO L87 Difference]: Start difference. First operand 122 states and 245 transitions. Second operand 3 states. [2020-11-09 14:20:37,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:20:37,634 INFO L93 Difference]: Finished difference Result 144 states and 287 transitions. [2020-11-09 14:20:37,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 14:20:37,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-11-09 14:20:37,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:20:37,638 INFO L225 Difference]: With dead ends: 144 [2020-11-09 14:20:37,638 INFO L226 Difference]: Without dead ends: 137 [2020-11-09 14:20:37,643 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 14:20:37,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-11-09 14:20:37,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 129. [2020-11-09 14:20:37,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-11-09 14:20:37,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 268 transitions. [2020-11-09 14:20:37,672 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 268 transitions. Word has length 5 [2020-11-09 14:20:37,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:20:37,676 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 268 transitions. [2020-11-09 14:20:37,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 14:20:37,677 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 268 transitions. [2020-11-09 14:20:37,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-09 14:20:37,678 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:20:37,678 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:20:37,678 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 14:20:37,679 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:20:37,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:20:37,679 INFO L82 PathProgramCache]: Analyzing trace with hash 889965532, now seen corresponding path program 1 times [2020-11-09 14:20:37,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:20:37,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859359266] [2020-11-09 14:20:37,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:20:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:20:37,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:20:37,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859359266] [2020-11-09 14:20:37,782 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:20:37,783 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 14:20:37,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369494550] [2020-11-09 14:20:37,783 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 14:20:37,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:20:37,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 14:20:37,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 14:20:37,784 INFO L87 Difference]: Start difference. First operand 129 states and 268 transitions. Second operand 3 states. [2020-11-09 14:20:37,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:20:37,808 INFO L93 Difference]: Finished difference Result 57 states and 101 transitions. [2020-11-09 14:20:37,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 14:20:37,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-09 14:20:37,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:20:37,811 INFO L225 Difference]: With dead ends: 57 [2020-11-09 14:20:37,811 INFO L226 Difference]: Without dead ends: 57 [2020-11-09 14:20:37,812 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 14:20:37,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-11-09 14:20:37,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-11-09 14:20:37,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-11-09 14:20:37,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 101 transitions. [2020-11-09 14:20:37,825 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 101 transitions. Word has length 9 [2020-11-09 14:20:37,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:20:37,825 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 101 transitions. [2020-11-09 14:20:37,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 14:20:37,825 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 101 transitions. [2020-11-09 14:20:37,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:20:37,827 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:20:37,828 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:20:37,828 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 14:20:37,828 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:20:37,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:20:37,829 INFO L82 PathProgramCache]: Analyzing trace with hash -511512528, now seen corresponding path program 1 times [2020-11-09 14:20:37,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:20:37,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163918909] [2020-11-09 14:20:37,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:20:37,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:20:38,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:20:38,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163918909] [2020-11-09 14:20:38,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:20:38,388 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-09 14:20:38,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112458574] [2020-11-09 14:20:38,390 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-09 14:20:38,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:20:38,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-09 14:20:38,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-11-09 14:20:38,391 INFO L87 Difference]: Start difference. First operand 57 states and 101 transitions. Second operand 9 states. [2020-11-09 14:20:38,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:20:38,865 INFO L93 Difference]: Finished difference Result 86 states and 147 transitions. [2020-11-09 14:20:38,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-09 14:20:38,867 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-11-09 14:20:38,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:20:38,868 INFO L225 Difference]: With dead ends: 86 [2020-11-09 14:20:38,868 INFO L226 Difference]: Without dead ends: 86 [2020-11-09 14:20:38,868 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2020-11-09 14:20:38,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-11-09 14:20:38,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 70. [2020-11-09 14:20:38,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-11-09 14:20:38,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 118 transitions. [2020-11-09 14:20:38,880 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 118 transitions. Word has length 16 [2020-11-09 14:20:38,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:20:38,880 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 118 transitions. [2020-11-09 14:20:38,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-09 14:20:38,880 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 118 transitions. [2020-11-09 14:20:38,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:20:38,881 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:20:38,881 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:20:38,881 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 14:20:38,882 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:20:38,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:20:38,886 INFO L82 PathProgramCache]: Analyzing trace with hash -511512506, now seen corresponding path program 1 times [2020-11-09 14:20:38,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:20:38,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026433917] [2020-11-09 14:20:38,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:20:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:20:39,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:20:39,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026433917] [2020-11-09 14:20:39,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:20:39,791 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:20:39,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844568327] [2020-11-09 14:20:39,792 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:20:39,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:20:39,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:20:39,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:20:39,793 INFO L87 Difference]: Start difference. First operand 70 states and 118 transitions. Second operand 12 states. [2020-11-09 14:20:40,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:20:40,507 INFO L93 Difference]: Finished difference Result 97 states and 164 transitions. [2020-11-09 14:20:40,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 14:20:40,508 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:20:40,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:20:40,509 INFO L225 Difference]: With dead ends: 97 [2020-11-09 14:20:40,509 INFO L226 Difference]: Without dead ends: 80 [2020-11-09 14:20:40,509 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:20:40,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-11-09 14:20:40,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2020-11-09 14:20:40,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-11-09 14:20:40,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 125 transitions. [2020-11-09 14:20:40,516 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 125 transitions. Word has length 16 [2020-11-09 14:20:40,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:20:40,516 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 125 transitions. [2020-11-09 14:20:40,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:20:40,516 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 125 transitions. [2020-11-09 14:20:40,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:20:40,517 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:20:40,518 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:20:40,518 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 14:20:40,518 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:20:40,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:20:40,518 INFO L82 PathProgramCache]: Analyzing trace with hash 2097849826, now seen corresponding path program 2 times [2020-11-09 14:20:40,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:20:40,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590981294] [2020-11-09 14:20:40,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:20:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:20:41,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:20:41,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590981294] [2020-11-09 14:20:41,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:20:41,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-09 14:20:41,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759837089] [2020-11-09 14:20:41,129 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-09 14:20:41,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:20:41,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-09 14:20:41,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-11-09 14:20:41,130 INFO L87 Difference]: Start difference. First operand 73 states and 125 transitions. Second operand 11 states. [2020-11-09 14:20:42,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:20:42,101 INFO L93 Difference]: Finished difference Result 180 states and 284 transitions. [2020-11-09 14:20:42,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-09 14:20:42,103 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2020-11-09 14:20:42,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:20:42,105 INFO L225 Difference]: With dead ends: 180 [2020-11-09 14:20:42,105 INFO L226 Difference]: Without dead ends: 180 [2020-11-09 14:20:42,106 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2020-11-09 14:20:42,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-11-09 14:20:42,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 82. [2020-11-09 14:20:42,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-11-09 14:20:42,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 140 transitions. [2020-11-09 14:20:42,113 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 140 transitions. Word has length 16 [2020-11-09 14:20:42,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:20:42,114 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 140 transitions. [2020-11-09 14:20:42,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-09 14:20:42,114 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 140 transitions. [2020-11-09 14:20:42,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:20:42,115 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:20:42,115 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:20:42,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 14:20:42,115 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:20:42,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:20:42,116 INFO L82 PathProgramCache]: Analyzing trace with hash 2097849848, now seen corresponding path program 2 times [2020-11-09 14:20:42,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:20:42,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454791688] [2020-11-09 14:20:42,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:20:42,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:20:42,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:20:42,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454791688] [2020-11-09 14:20:42,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:20:42,877 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:20:42,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117944240] [2020-11-09 14:20:42,878 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:20:42,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:20:42,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:20:42,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:20:42,879 INFO L87 Difference]: Start difference. First operand 82 states and 140 transitions. Second operand 12 states. [2020-11-09 14:20:43,521 WARN L194 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2020-11-09 14:20:43,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:20:43,676 INFO L93 Difference]: Finished difference Result 102 states and 171 transitions. [2020-11-09 14:20:43,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 14:20:43,676 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:20:43,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:20:43,678 INFO L225 Difference]: With dead ends: 102 [2020-11-09 14:20:43,678 INFO L226 Difference]: Without dead ends: 89 [2020-11-09 14:20:43,679 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:20:43,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-11-09 14:20:43,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 82. [2020-11-09 14:20:43,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-11-09 14:20:43,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 139 transitions. [2020-11-09 14:20:43,686 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 139 transitions. Word has length 16 [2020-11-09 14:20:43,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:20:43,686 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 139 transitions. [2020-11-09 14:20:43,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:20:43,686 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 139 transitions. [2020-11-09 14:20:43,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:20:43,688 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:20:43,688 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:20:43,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 14:20:43,688 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:20:43,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:20:43,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1185646600, now seen corresponding path program 1 times [2020-11-09 14:20:43,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:20:43,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449009895] [2020-11-09 14:20:43,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:20:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:20:43,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:20:43,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449009895] [2020-11-09 14:20:43,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:20:43,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-09 14:20:43,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888765819] [2020-11-09 14:20:43,845 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 14:20:43,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:20:43,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 14:20:43,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-09 14:20:43,848 INFO L87 Difference]: Start difference. First operand 82 states and 139 transitions. Second operand 8 states. [2020-11-09 14:20:44,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:20:44,077 INFO L93 Difference]: Finished difference Result 102 states and 170 transitions. [2020-11-09 14:20:44,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 14:20:44,078 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-11-09 14:20:44,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:20:44,079 INFO L225 Difference]: With dead ends: 102 [2020-11-09 14:20:44,079 INFO L226 Difference]: Without dead ends: 102 [2020-11-09 14:20:44,080 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2020-11-09 14:20:44,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-11-09 14:20:44,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 92. [2020-11-09 14:20:44,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-11-09 14:20:44,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 154 transitions. [2020-11-09 14:20:44,093 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 154 transitions. Word has length 16 [2020-11-09 14:20:44,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:20:44,093 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 154 transitions. [2020-11-09 14:20:44,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 14:20:44,094 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 154 transitions. [2020-11-09 14:20:44,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:20:44,098 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:20:44,098 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:20:44,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 14:20:44,099 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:20:44,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:20:44,099 INFO L82 PathProgramCache]: Analyzing trace with hash 191288070, now seen corresponding path program 3 times [2020-11-09 14:20:44,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:20:44,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308264700] [2020-11-09 14:20:44,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:20:44,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:20:44,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:20:44,723 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308264700] [2020-11-09 14:20:44,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:20:44,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:20:44,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491707350] [2020-11-09 14:20:44,725 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:20:44,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:20:44,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:20:44,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:20:44,727 INFO L87 Difference]: Start difference. First operand 92 states and 154 transitions. Second operand 12 states. [2020-11-09 14:20:45,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:20:45,491 INFO L93 Difference]: Finished difference Result 105 states and 174 transitions. [2020-11-09 14:20:45,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 14:20:45,492 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:20:45,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:20:45,494 INFO L225 Difference]: With dead ends: 105 [2020-11-09 14:20:45,494 INFO L226 Difference]: Without dead ends: 96 [2020-11-09 14:20:45,495 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:20:45,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-11-09 14:20:45,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 89. [2020-11-09 14:20:45,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-11-09 14:20:45,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 150 transitions. [2020-11-09 14:20:45,499 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 150 transitions. Word has length 16 [2020-11-09 14:20:45,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:20:45,500 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 150 transitions. [2020-11-09 14:20:45,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:20:45,500 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 150 transitions. [2020-11-09 14:20:45,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:20:45,501 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:20:45,501 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:20:45,501 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 14:20:45,501 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:20:45,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:20:45,502 INFO L82 PathProgramCache]: Analyzing trace with hash -529892938, now seen corresponding path program 4 times [2020-11-09 14:20:45,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:20:45,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677545811] [2020-11-09 14:20:45,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:20:45,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:20:46,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:20:46,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677545811] [2020-11-09 14:20:46,119 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:20:46,119 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:20:46,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269647286] [2020-11-09 14:20:46,119 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:20:46,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:20:46,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:20:46,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:20:46,120 INFO L87 Difference]: Start difference. First operand 89 states and 150 transitions. Second operand 12 states. [2020-11-09 14:20:46,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:20:46,784 INFO L93 Difference]: Finished difference Result 119 states and 200 transitions. [2020-11-09 14:20:46,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 14:20:46,785 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:20:46,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:20:46,787 INFO L225 Difference]: With dead ends: 119 [2020-11-09 14:20:46,787 INFO L226 Difference]: Without dead ends: 102 [2020-11-09 14:20:46,788 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:20:46,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-11-09 14:20:46,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 91. [2020-11-09 14:20:46,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-11-09 14:20:46,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 153 transitions. [2020-11-09 14:20:46,793 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 153 transitions. Word has length 16 [2020-11-09 14:20:46,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:20:46,793 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 153 transitions. [2020-11-09 14:20:46,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:20:46,794 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 153 transitions. [2020-11-09 14:20:46,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:20:46,795 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:20:46,795 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:20:46,795 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-09 14:20:46,795 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:20:46,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:20:46,796 INFO L82 PathProgramCache]: Analyzing trace with hash -969164830, now seen corresponding path program 3 times [2020-11-09 14:20:46,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:20:46,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324903668] [2020-11-09 14:20:46,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:20:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:20:47,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:20:47,175 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324903668] [2020-11-09 14:20:47,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:20:47,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-09 14:20:47,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189541854] [2020-11-09 14:20:47,176 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-09 14:20:47,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:20:47,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-09 14:20:47,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-11-09 14:20:47,177 INFO L87 Difference]: Start difference. First operand 91 states and 153 transitions. Second operand 9 states. [2020-11-09 14:20:47,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:20:47,441 INFO L93 Difference]: Finished difference Result 117 states and 186 transitions. [2020-11-09 14:20:47,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 14:20:47,442 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-11-09 14:20:47,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:20:47,443 INFO L225 Difference]: With dead ends: 117 [2020-11-09 14:20:47,444 INFO L226 Difference]: Without dead ends: 117 [2020-11-09 14:20:47,444 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:20:47,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-11-09 14:20:47,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 93. [2020-11-09 14:20:47,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-11-09 14:20:47,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 157 transitions. [2020-11-09 14:20:47,449 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 157 transitions. Word has length 16 [2020-11-09 14:20:47,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:20:47,449 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 157 transitions. [2020-11-09 14:20:47,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-09 14:20:47,449 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 157 transitions. [2020-11-09 14:20:47,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:20:47,450 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:20:47,450 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:20:47,451 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-09 14:20:47,451 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:20:47,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:20:47,451 INFO L82 PathProgramCache]: Analyzing trace with hash -969164808, now seen corresponding path program 5 times [2020-11-09 14:20:47,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:20:47,452 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010590255] [2020-11-09 14:20:47,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:20:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:20:48,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:20:48,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010590255] [2020-11-09 14:20:48,084 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:20:48,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:20:48,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087974346] [2020-11-09 14:20:48,085 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:20:48,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:20:48,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:20:48,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:20:48,086 INFO L87 Difference]: Start difference. First operand 93 states and 157 transitions. Second operand 12 states. [2020-11-09 14:20:48,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:20:48,712 INFO L93 Difference]: Finished difference Result 120 states and 199 transitions. [2020-11-09 14:20:48,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-09 14:20:48,713 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:20:48,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:20:48,714 INFO L225 Difference]: With dead ends: 120 [2020-11-09 14:20:48,714 INFO L226 Difference]: Without dead ends: 107 [2020-11-09 14:20:48,715 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:20:48,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-11-09 14:20:48,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 95. [2020-11-09 14:20:48,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-11-09 14:20:48,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 160 transitions. [2020-11-09 14:20:48,719 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 160 transitions. Word has length 16 [2020-11-09 14:20:48,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:20:48,719 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 160 transitions. [2020-11-09 14:20:48,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:20:48,720 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 160 transitions. [2020-11-09 14:20:48,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:20:48,720 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:20:48,720 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:20:48,721 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-09 14:20:48,721 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:20:48,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:20:48,721 INFO L82 PathProgramCache]: Analyzing trace with hash 766708342, now seen corresponding path program 6 times [2020-11-09 14:20:48,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:20:48,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543961956] [2020-11-09 14:20:48,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:20:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:20:49,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:20:49,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543961956] [2020-11-09 14:20:49,272 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:20:49,272 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:20:49,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902422736] [2020-11-09 14:20:49,273 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:20:49,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:20:49,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:20:49,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:20:49,278 INFO L87 Difference]: Start difference. First operand 95 states and 160 transitions. Second operand 12 states. [2020-11-09 14:20:49,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:20:49,881 INFO L93 Difference]: Finished difference Result 113 states and 187 transitions. [2020-11-09 14:20:49,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 14:20:49,893 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:20:49,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:20:49,894 INFO L225 Difference]: With dead ends: 113 [2020-11-09 14:20:49,894 INFO L226 Difference]: Without dead ends: 98 [2020-11-09 14:20:49,895 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:20:49,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-11-09 14:20:49,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2020-11-09 14:20:49,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-11-09 14:20:49,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 152 transitions. [2020-11-09 14:20:49,898 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 152 transitions. Word has length 16 [2020-11-09 14:20:49,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:20:49,899 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 152 transitions. [2020-11-09 14:20:49,899 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:20:49,899 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 152 transitions. [2020-11-09 14:20:49,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:20:49,900 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:20:49,900 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:20:49,900 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-09 14:20:49,900 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:20:49,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:20:49,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1667139220, now seen corresponding path program 4 times [2020-11-09 14:20:49,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:20:49,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752648993] [2020-11-09 14:20:49,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:20:49,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:20:50,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:20:50,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752648993] [2020-11-09 14:20:50,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:20:50,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-09 14:20:50,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218154061] [2020-11-09 14:20:50,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-09 14:20:50,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:20:50,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-09 14:20:50,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-11-09 14:20:50,449 INFO L87 Difference]: Start difference. First operand 91 states and 152 transitions. Second operand 11 states. [2020-11-09 14:20:51,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:20:51,276 INFO L93 Difference]: Finished difference Result 181 states and 285 transitions. [2020-11-09 14:20:51,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-09 14:20:51,277 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2020-11-09 14:20:51,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:20:51,278 INFO L225 Difference]: With dead ends: 181 [2020-11-09 14:20:51,278 INFO L226 Difference]: Without dead ends: 181 [2020-11-09 14:20:51,279 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2020-11-09 14:20:51,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-11-09 14:20:51,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 94. [2020-11-09 14:20:51,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-11-09 14:20:51,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 160 transitions. [2020-11-09 14:20:51,285 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 160 transitions. Word has length 16 [2020-11-09 14:20:51,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:20:51,285 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 160 transitions. [2020-11-09 14:20:51,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-09 14:20:51,286 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 160 transitions. [2020-11-09 14:20:51,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:20:51,286 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:20:51,286 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:20:51,287 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-09 14:20:51,287 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:20:51,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:20:51,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1667139198, now seen corresponding path program 7 times [2020-11-09 14:20:51,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:20:51,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489752400] [2020-11-09 14:20:51,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:20:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:20:51,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:20:51,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489752400] [2020-11-09 14:20:51,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:20:51,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:20:51,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64314386] [2020-11-09 14:20:51,869 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:20:51,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:20:51,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:20:51,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:20:51,870 INFO L87 Difference]: Start difference. First operand 94 states and 160 transitions. Second operand 12 states. [2020-11-09 14:20:52,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:20:52,533 INFO L93 Difference]: Finished difference Result 111 states and 183 transitions. [2020-11-09 14:20:52,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 14:20:52,533 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:20:52,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:20:52,535 INFO L225 Difference]: With dead ends: 111 [2020-11-09 14:20:52,535 INFO L226 Difference]: Without dead ends: 98 [2020-11-09 14:20:52,536 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:20:52,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-11-09 14:20:52,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2020-11-09 14:20:52,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-11-09 14:20:52,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 159 transitions. [2020-11-09 14:20:52,541 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 159 transitions. Word has length 16 [2020-11-09 14:20:52,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:20:52,541 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 159 transitions. [2020-11-09 14:20:52,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:20:52,542 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 159 transitions. [2020-11-09 14:20:52,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:20:52,542 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:20:52,542 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:20:52,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-09 14:20:52,543 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:20:52,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:20:52,544 INFO L82 PathProgramCache]: Analyzing trace with hash -655668350, now seen corresponding path program 2 times [2020-11-09 14:20:52,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:20:52,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914634610] [2020-11-09 14:20:52,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:20:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:20:52,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:20:52,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914634610] [2020-11-09 14:20:52,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:20:52,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 14:20:52,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22250022] [2020-11-09 14:20:52,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-09 14:20:52,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:20:52,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-09 14:20:52,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-09 14:20:52,683 INFO L87 Difference]: Start difference. First operand 94 states and 159 transitions. Second operand 9 states. [2020-11-09 14:20:52,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:20:52,892 INFO L93 Difference]: Finished difference Result 110 states and 182 transitions. [2020-11-09 14:20:52,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 14:20:52,892 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-11-09 14:20:52,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:20:52,894 INFO L225 Difference]: With dead ends: 110 [2020-11-09 14:20:52,894 INFO L226 Difference]: Without dead ends: 110 [2020-11-09 14:20:52,895 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-11-09 14:20:52,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-11-09 14:20:52,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 93. [2020-11-09 14:20:52,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-11-09 14:20:52,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 156 transitions. [2020-11-09 14:20:52,899 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 156 transitions. Word has length 16 [2020-11-09 14:20:52,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:20:52,899 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 156 transitions. [2020-11-09 14:20:52,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-09 14:20:52,900 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 156 transitions. [2020-11-09 14:20:52,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:20:52,900 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:20:52,900 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:20:52,900 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-09 14:20:52,901 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:20:52,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:20:52,901 INFO L82 PathProgramCache]: Analyzing trace with hash 721266320, now seen corresponding path program 8 times [2020-11-09 14:20:52,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:20:52,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388169010] [2020-11-09 14:20:52,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:20:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:20:53,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:20:53,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388169010] [2020-11-09 14:20:53,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:20:53,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:20:53,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98731928] [2020-11-09 14:20:53,476 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:20:53,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:20:53,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:20:53,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:20:53,477 INFO L87 Difference]: Start difference. First operand 93 states and 156 transitions. Second operand 12 states. [2020-11-09 14:20:54,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:20:54,105 INFO L93 Difference]: Finished difference Result 99 states and 161 transitions. [2020-11-09 14:20:54,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 14:20:54,110 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:20:54,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:20:54,111 INFO L225 Difference]: With dead ends: 99 [2020-11-09 14:20:54,111 INFO L226 Difference]: Without dead ends: 91 [2020-11-09 14:20:54,111 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:20:54,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-11-09 14:20:54,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-11-09 14:20:54,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-11-09 14:20:54,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 153 transitions. [2020-11-09 14:20:54,115 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 153 transitions. Word has length 16 [2020-11-09 14:20:54,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:20:54,115 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 153 transitions. [2020-11-09 14:20:54,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:20:54,115 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 153 transitions. [2020-11-09 14:20:54,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:20:54,116 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:20:54,116 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:20:54,116 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-09 14:20:54,116 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:20:54,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:20:54,116 INFO L82 PathProgramCache]: Analyzing trace with hash -420806126, now seen corresponding path program 9 times [2020-11-09 14:20:54,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:20:54,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193716139] [2020-11-09 14:20:54,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:20:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:20:54,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:20:54,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193716139] [2020-11-09 14:20:54,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:20:54,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:20:54,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726209597] [2020-11-09 14:20:54,703 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:20:54,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:20:54,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:20:54,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:20:54,704 INFO L87 Difference]: Start difference. First operand 91 states and 153 transitions. Second operand 12 states. [2020-11-09 14:20:55,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:20:55,341 INFO L93 Difference]: Finished difference Result 117 states and 190 transitions. [2020-11-09 14:20:55,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-09 14:20:55,342 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:20:55,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:20:55,343 INFO L225 Difference]: With dead ends: 117 [2020-11-09 14:20:55,343 INFO L226 Difference]: Without dead ends: 104 [2020-11-09 14:20:55,344 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:20:55,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-11-09 14:20:55,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 93. [2020-11-09 14:20:55,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-11-09 14:20:55,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 156 transitions. [2020-11-09 14:20:55,348 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 156 transitions. Word has length 16 [2020-11-09 14:20:55,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:20:55,348 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 156 transitions. [2020-11-09 14:20:55,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:20:55,348 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 156 transitions. [2020-11-09 14:20:55,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:20:55,349 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:20:55,349 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:20:55,349 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-09 14:20:55,349 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:20:55,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:20:55,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1315067024, now seen corresponding path program 10 times [2020-11-09 14:20:55,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:20:55,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297246884] [2020-11-09 14:20:55,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:20:55,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:20:55,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:20:55,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297246884] [2020-11-09 14:20:55,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:20:55,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:20:55,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292793847] [2020-11-09 14:20:55,827 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:20:55,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:20:55,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:20:55,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:20:55,828 INFO L87 Difference]: Start difference. First operand 93 states and 156 transitions. Second operand 12 states. [2020-11-09 14:20:56,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:20:56,445 INFO L93 Difference]: Finished difference Result 108 states and 175 transitions. [2020-11-09 14:20:56,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 14:20:56,446 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:20:56,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:20:56,447 INFO L225 Difference]: With dead ends: 108 [2020-11-09 14:20:56,447 INFO L226 Difference]: Without dead ends: 95 [2020-11-09 14:20:56,448 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:20:56,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-11-09 14:20:56,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2020-11-09 14:20:56,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-11-09 14:20:56,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 151 transitions. [2020-11-09 14:20:56,452 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 151 transitions. Word has length 16 [2020-11-09 14:20:56,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:20:56,452 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 151 transitions. [2020-11-09 14:20:56,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:20:56,452 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 151 transitions. [2020-11-09 14:20:56,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:20:56,453 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:20:56,453 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:20:56,453 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-09 14:20:56,453 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:20:56,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:20:56,454 INFO L82 PathProgramCache]: Analyzing trace with hash 19209916, now seen corresponding path program 3 times [2020-11-09 14:20:56,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:20:56,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644650434] [2020-11-09 14:20:56,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:20:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:20:56,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:20:56,593 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644650434] [2020-11-09 14:20:56,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:20:56,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-09 14:20:56,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740254026] [2020-11-09 14:20:56,594 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 14:20:56,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:20:56,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 14:20:56,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-11-09 14:20:56,595 INFO L87 Difference]: Start difference. First operand 91 states and 151 transitions. Second operand 10 states. [2020-11-09 14:20:56,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:20:56,981 INFO L93 Difference]: Finished difference Result 94 states and 151 transitions. [2020-11-09 14:20:56,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-09 14:20:56,982 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 14:20:56,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:20:56,983 INFO L225 Difference]: With dead ends: 94 [2020-11-09 14:20:56,983 INFO L226 Difference]: Without dead ends: 94 [2020-11-09 14:20:56,984 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-11-09 14:20:56,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-11-09 14:20:56,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2020-11-09 14:20:56,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-11-09 14:20:56,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 131 transitions. [2020-11-09 14:20:56,988 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 131 transitions. Word has length 16 [2020-11-09 14:20:56,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:20:56,989 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 131 transitions. [2020-11-09 14:20:56,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 14:20:56,989 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 131 transitions. [2020-11-09 14:20:56,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:20:56,990 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:20:56,990 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:20:56,990 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-09 14:20:56,990 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:20:56,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:20:56,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1396144586, now seen corresponding path program 11 times [2020-11-09 14:20:56,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:20:56,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11236556] [2020-11-09 14:20:56,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:20:57,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:20:57,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:20:57,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11236556] [2020-11-09 14:20:57,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:20:57,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:20:57,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124150126] [2020-11-09 14:20:57,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:20:57,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:20:57,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:20:57,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:20:57,503 INFO L87 Difference]: Start difference. First operand 80 states and 131 transitions. Second operand 12 states. [2020-11-09 14:20:58,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:20:58,127 INFO L93 Difference]: Finished difference Result 100 states and 157 transitions. [2020-11-09 14:20:58,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-09 14:20:58,128 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:20:58,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:20:58,129 INFO L225 Difference]: With dead ends: 100 [2020-11-09 14:20:58,129 INFO L226 Difference]: Without dead ends: 93 [2020-11-09 14:20:58,130 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:20:58,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-11-09 14:20:58,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 82. [2020-11-09 14:20:58,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-11-09 14:20:58,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 134 transitions. [2020-11-09 14:20:58,133 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 134 transitions. Word has length 16 [2020-11-09 14:20:58,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:20:58,133 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 134 transitions. [2020-11-09 14:20:58,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:20:58,134 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 134 transitions. [2020-11-09 14:20:58,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:20:58,134 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:20:58,134 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:20:58,135 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-09 14:20:58,135 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:20:58,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:20:58,135 INFO L82 PathProgramCache]: Analyzing trace with hash 743612218, now seen corresponding path program 12 times [2020-11-09 14:20:58,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:20:58,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010972919] [2020-11-09 14:20:58,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:20:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:20:58,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:20:58,608 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010972919] [2020-11-09 14:20:58,608 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:20:58,608 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:20:58,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515885526] [2020-11-09 14:20:58,609 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:20:58,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:20:58,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:20:58,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:20:58,610 INFO L87 Difference]: Start difference. First operand 82 states and 134 transitions. Second operand 12 states. [2020-11-09 14:20:59,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:20:59,207 INFO L93 Difference]: Finished difference Result 93 states and 145 transitions. [2020-11-09 14:20:59,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 14:20:59,208 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:20:59,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:20:59,209 INFO L225 Difference]: With dead ends: 93 [2020-11-09 14:20:59,209 INFO L226 Difference]: Without dead ends: 76 [2020-11-09 14:20:59,210 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:20:59,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-11-09 14:20:59,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2020-11-09 14:20:59,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-11-09 14:20:59,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 124 transitions. [2020-11-09 14:20:59,213 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 124 transitions. Word has length 16 [2020-11-09 14:20:59,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:20:59,213 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 124 transitions. [2020-11-09 14:20:59,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:20:59,214 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 124 transitions. [2020-11-09 14:20:59,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:20:59,214 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:20:59,214 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:20:59,214 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-09 14:20:59,214 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:20:59,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:20:59,215 INFO L82 PathProgramCache]: Analyzing trace with hash 761924480, now seen corresponding path program 13 times [2020-11-09 14:20:59,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:20:59,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560040773] [2020-11-09 14:20:59,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:20:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:20:59,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:20:59,775 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560040773] [2020-11-09 14:20:59,775 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:20:59,775 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:20:59,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108179484] [2020-11-09 14:20:59,776 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:20:59,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:20:59,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:20:59,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:20:59,777 INFO L87 Difference]: Start difference. First operand 76 states and 124 transitions. Second operand 12 states. [2020-11-09 14:21:00,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:00,433 INFO L93 Difference]: Finished difference Result 101 states and 162 transitions. [2020-11-09 14:21:00,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 14:21:00,434 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:21:00,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:00,435 INFO L225 Difference]: With dead ends: 101 [2020-11-09 14:21:00,435 INFO L226 Difference]: Without dead ends: 84 [2020-11-09 14:21:00,435 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:21:00,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-11-09 14:21:00,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2020-11-09 14:21:00,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-11-09 14:21:00,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 127 transitions. [2020-11-09 14:21:00,439 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 127 transitions. Word has length 16 [2020-11-09 14:21:00,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:00,440 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 127 transitions. [2020-11-09 14:21:00,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:21:00,440 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 127 transitions. [2020-11-09 14:21:00,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:21:00,440 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:00,441 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:00,441 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-09 14:21:00,441 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:00,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:00,441 INFO L82 PathProgramCache]: Analyzing trace with hash 322652610, now seen corresponding path program 14 times [2020-11-09 14:21:00,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:00,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219904759] [2020-11-09 14:21:00,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:01,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:01,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219904759] [2020-11-09 14:21:01,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:01,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:21:01,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655780102] [2020-11-09 14:21:01,016 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:21:01,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:01,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:21:01,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:21:01,017 INFO L87 Difference]: Start difference. First operand 78 states and 127 transitions. Second operand 12 states. [2020-11-09 14:21:01,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:01,632 INFO L93 Difference]: Finished difference Result 98 states and 153 transitions. [2020-11-09 14:21:01,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-09 14:21:01,632 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:21:01,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:01,634 INFO L225 Difference]: With dead ends: 98 [2020-11-09 14:21:01,634 INFO L226 Difference]: Without dead ends: 85 [2020-11-09 14:21:01,634 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:21:01,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-11-09 14:21:01,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2020-11-09 14:21:01,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-11-09 14:21:01,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 130 transitions. [2020-11-09 14:21:01,638 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 130 transitions. Word has length 16 [2020-11-09 14:21:01,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:01,639 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 130 transitions. [2020-11-09 14:21:01,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:21:01,639 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 130 transitions. [2020-11-09 14:21:01,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:21:01,639 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:01,639 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:01,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-09 14:21:01,640 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:01,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:01,640 INFO L82 PathProgramCache]: Analyzing trace with hash 2058525760, now seen corresponding path program 15 times [2020-11-09 14:21:01,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:01,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612332511] [2020-11-09 14:21:01,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:01,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:02,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:02,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612332511] [2020-11-09 14:21:02,144 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:02,144 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:21:02,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62651670] [2020-11-09 14:21:02,144 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:21:02,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:02,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:21:02,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:21:02,145 INFO L87 Difference]: Start difference. First operand 80 states and 130 transitions. Second operand 12 states. [2020-11-09 14:21:02,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:02,705 INFO L93 Difference]: Finished difference Result 91 states and 141 transitions. [2020-11-09 14:21:02,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 14:21:02,706 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:21:02,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:02,707 INFO L225 Difference]: With dead ends: 91 [2020-11-09 14:21:02,707 INFO L226 Difference]: Without dead ends: 72 [2020-11-09 14:21:02,707 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:21:02,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-11-09 14:21:02,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-11-09 14:21:02,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-11-09 14:21:02,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 117 transitions. [2020-11-09 14:21:02,710 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 117 transitions. Word has length 16 [2020-11-09 14:21:02,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:02,710 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 117 transitions. [2020-11-09 14:21:02,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:21:02,711 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 117 transitions. [2020-11-09 14:21:02,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:21:02,711 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:02,711 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:02,711 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-09 14:21:02,712 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:02,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:02,712 INFO L82 PathProgramCache]: Analyzing trace with hash 185049416, now seen corresponding path program 16 times [2020-11-09 14:21:02,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:02,712 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142187778] [2020-11-09 14:21:02,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:02,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:03,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:03,332 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142187778] [2020-11-09 14:21:03,332 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:03,332 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:21:03,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495255520] [2020-11-09 14:21:03,333 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:21:03,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:03,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:21:03,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:21:03,335 INFO L87 Difference]: Start difference. First operand 72 states and 117 transitions. Second operand 12 states. [2020-11-09 14:21:03,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:03,924 INFO L93 Difference]: Finished difference Result 92 states and 147 transitions. [2020-11-09 14:21:03,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 14:21:03,925 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:21:03,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:03,926 INFO L225 Difference]: With dead ends: 92 [2020-11-09 14:21:03,926 INFO L226 Difference]: Without dead ends: 78 [2020-11-09 14:21:03,926 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:21:03,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-11-09 14:21:03,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2020-11-09 14:21:03,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-11-09 14:21:03,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 118 transitions. [2020-11-09 14:21:03,930 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 118 transitions. Word has length 16 [2020-11-09 14:21:03,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:03,930 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 118 transitions. [2020-11-09 14:21:03,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:21:03,930 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 118 transitions. [2020-11-09 14:21:03,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:21:03,930 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:03,930 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:03,930 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-09 14:21:03,931 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:03,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:03,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1500555548, now seen corresponding path program 5 times [2020-11-09 14:21:03,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:03,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448470695] [2020-11-09 14:21:03,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:03,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:04,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:04,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448470695] [2020-11-09 14:21:04,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:04,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-09 14:21:04,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539824955] [2020-11-09 14:21:04,472 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-09 14:21:04,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:04,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-09 14:21:04,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-11-09 14:21:04,473 INFO L87 Difference]: Start difference. First operand 73 states and 118 transitions. Second operand 11 states. [2020-11-09 14:21:05,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:05,322 INFO L93 Difference]: Finished difference Result 115 states and 175 transitions. [2020-11-09 14:21:05,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-09 14:21:05,327 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2020-11-09 14:21:05,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:05,328 INFO L225 Difference]: With dead ends: 115 [2020-11-09 14:21:05,328 INFO L226 Difference]: Without dead ends: 115 [2020-11-09 14:21:05,329 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2020-11-09 14:21:05,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-11-09 14:21:05,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 76. [2020-11-09 14:21:05,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-11-09 14:21:05,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 123 transitions. [2020-11-09 14:21:05,332 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 123 transitions. Word has length 16 [2020-11-09 14:21:05,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:05,332 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 123 transitions. [2020-11-09 14:21:05,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-09 14:21:05,332 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 123 transitions. [2020-11-09 14:21:05,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:21:05,334 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:05,335 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:05,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-11-09 14:21:05,335 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:05,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:05,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1500555526, now seen corresponding path program 17 times [2020-11-09 14:21:05,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:05,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889635189] [2020-11-09 14:21:05,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:05,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:06,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:06,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889635189] [2020-11-09 14:21:06,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:06,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:21:06,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601860991] [2020-11-09 14:21:06,039 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:21:06,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:06,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:21:06,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:21:06,040 INFO L87 Difference]: Start difference. First operand 76 states and 123 transitions. Second operand 12 states. [2020-11-09 14:21:06,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:06,699 INFO L93 Difference]: Finished difference Result 89 states and 140 transitions. [2020-11-09 14:21:06,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 14:21:06,700 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:21:06,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:06,701 INFO L225 Difference]: With dead ends: 89 [2020-11-09 14:21:06,701 INFO L226 Difference]: Without dead ends: 79 [2020-11-09 14:21:06,702 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:21:06,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-11-09 14:21:06,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2020-11-09 14:21:06,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-11-09 14:21:06,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 124 transitions. [2020-11-09 14:21:06,705 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 124 transitions. Word has length 16 [2020-11-09 14:21:06,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:06,705 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 124 transitions. [2020-11-09 14:21:06,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:21:06,705 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 124 transitions. [2020-11-09 14:21:06,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:21:06,706 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:06,706 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:06,706 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-11-09 14:21:06,706 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:06,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:06,707 INFO L82 PathProgramCache]: Analyzing trace with hash 887849992, now seen corresponding path program 18 times [2020-11-09 14:21:06,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:06,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550200541] [2020-11-09 14:21:06,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:07,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:07,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550200541] [2020-11-09 14:21:07,287 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:07,287 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:21:07,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868267269] [2020-11-09 14:21:07,288 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:21:07,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:07,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:21:07,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:21:07,288 INFO L87 Difference]: Start difference. First operand 77 states and 124 transitions. Second operand 12 states. [2020-11-09 14:21:07,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:07,936 INFO L93 Difference]: Finished difference Result 93 states and 146 transitions. [2020-11-09 14:21:07,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 14:21:07,937 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:21:07,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:07,938 INFO L225 Difference]: With dead ends: 93 [2020-11-09 14:21:07,938 INFO L226 Difference]: Without dead ends: 84 [2020-11-09 14:21:07,939 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:21:07,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-11-09 14:21:07,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2020-11-09 14:21:07,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-11-09 14:21:07,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 121 transitions. [2020-11-09 14:21:07,942 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 121 transitions. Word has length 16 [2020-11-09 14:21:07,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:07,942 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 121 transitions. [2020-11-09 14:21:07,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:21:07,943 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 121 transitions. [2020-11-09 14:21:07,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:21:07,943 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:07,943 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:07,943 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-11-09 14:21:07,943 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:07,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:07,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1175593484, now seen corresponding path program 19 times [2020-11-09 14:21:07,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:07,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929891262] [2020-11-09 14:21:07,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:07,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:08,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:08,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929891262] [2020-11-09 14:21:08,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:08,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:21:08,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855352648] [2020-11-09 14:21:08,510 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:21:08,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:08,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:21:08,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:21:08,511 INFO L87 Difference]: Start difference. First operand 75 states and 121 transitions. Second operand 12 states. [2020-11-09 14:21:09,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:09,191 INFO L93 Difference]: Finished difference Result 88 states and 137 transitions. [2020-11-09 14:21:09,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 14:21:09,191 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:21:09,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:09,192 INFO L225 Difference]: With dead ends: 88 [2020-11-09 14:21:09,192 INFO L226 Difference]: Without dead ends: 78 [2020-11-09 14:21:09,193 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:21:09,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-11-09 14:21:09,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2020-11-09 14:21:09,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-11-09 14:21:09,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 120 transitions. [2020-11-09 14:21:09,196 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 120 transitions. Word has length 16 [2020-11-09 14:21:09,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:09,197 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 120 transitions. [2020-11-09 14:21:09,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:21:09,197 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 120 transitions. [2020-11-09 14:21:09,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:21:09,197 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:09,197 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:09,198 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-11-09 14:21:09,198 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:09,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:09,198 INFO L82 PathProgramCache]: Analyzing trace with hash -730968294, now seen corresponding path program 20 times [2020-11-09 14:21:09,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:09,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13367262] [2020-11-09 14:21:09,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:09,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:09,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13367262] [2020-11-09 14:21:09,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:09,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:21:09,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866216447] [2020-11-09 14:21:09,772 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:21:09,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:09,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:21:09,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:21:09,774 INFO L87 Difference]: Start difference. First operand 75 states and 120 transitions. Second operand 12 states. [2020-11-09 14:21:10,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:10,406 INFO L93 Difference]: Finished difference Result 83 states and 128 transitions. [2020-11-09 14:21:10,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 14:21:10,407 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:21:10,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:10,408 INFO L225 Difference]: With dead ends: 83 [2020-11-09 14:21:10,408 INFO L226 Difference]: Without dead ends: 75 [2020-11-09 14:21:10,409 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:21:10,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-11-09 14:21:10,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2020-11-09 14:21:10,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-11-09 14:21:10,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 118 transitions. [2020-11-09 14:21:10,413 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 118 transitions. Word has length 16 [2020-11-09 14:21:10,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:10,413 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 118 transitions. [2020-11-09 14:21:10,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:21:10,413 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 118 transitions. [2020-11-09 14:21:10,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:21:10,413 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:10,414 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:10,414 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-11-09 14:21:10,414 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:10,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:10,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1260067276, now seen corresponding path program 21 times [2020-11-09 14:21:10,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:10,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55798999] [2020-11-09 14:21:10,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:10,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:10,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55798999] [2020-11-09 14:21:10,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:10,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:21:10,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088163206] [2020-11-09 14:21:10,951 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:21:10,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:10,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:21:10,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:21:10,952 INFO L87 Difference]: Start difference. First operand 74 states and 118 transitions. Second operand 12 states. [2020-11-09 14:21:11,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:11,521 INFO L93 Difference]: Finished difference Result 83 states and 127 transitions. [2020-11-09 14:21:11,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 14:21:11,521 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:21:11,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:11,522 INFO L225 Difference]: With dead ends: 83 [2020-11-09 14:21:11,522 INFO L226 Difference]: Without dead ends: 73 [2020-11-09 14:21:11,523 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:21:11,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-11-09 14:21:11,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2020-11-09 14:21:11,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-11-09 14:21:11,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 114 transitions. [2020-11-09 14:21:11,526 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 114 transitions. Word has length 16 [2020-11-09 14:21:11,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:11,526 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 114 transitions. [2020-11-09 14:21:11,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:21:11,526 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 114 transitions. [2020-11-09 14:21:11,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:21:11,527 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:11,527 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:11,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-11-09 14:21:11,528 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:11,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:11,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1921734704, now seen corresponding path program 22 times [2020-11-09 14:21:11,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:11,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092650725] [2020-11-09 14:21:11,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:12,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:12,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092650725] [2020-11-09 14:21:12,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:12,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:21:12,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583495812] [2020-11-09 14:21:12,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:21:12,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:12,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:21:12,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:21:12,188 INFO L87 Difference]: Start difference. First operand 71 states and 114 transitions. Second operand 12 states. [2020-11-09 14:21:12,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:12,783 INFO L93 Difference]: Finished difference Result 88 states and 138 transitions. [2020-11-09 14:21:12,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 14:21:12,783 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:21:12,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:12,784 INFO L225 Difference]: With dead ends: 88 [2020-11-09 14:21:12,784 INFO L226 Difference]: Without dead ends: 74 [2020-11-09 14:21:12,785 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:21:12,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-11-09 14:21:12,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2020-11-09 14:21:12,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-11-09 14:21:12,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 109 transitions. [2020-11-09 14:21:12,789 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 109 transitions. Word has length 16 [2020-11-09 14:21:12,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:12,789 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 109 transitions. [2020-11-09 14:21:12,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:21:12,789 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 109 transitions. [2020-11-09 14:21:12,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:21:12,789 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:12,790 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:12,790 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-11-09 14:21:12,790 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:12,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:12,791 INFO L82 PathProgramCache]: Analyzing trace with hash 687627628, now seen corresponding path program 6 times [2020-11-09 14:21:12,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:12,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639841152] [2020-11-09 14:21:12,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:13,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:13,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639841152] [2020-11-09 14:21:13,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:13,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-09 14:21:13,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553852851] [2020-11-09 14:21:13,312 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-09 14:21:13,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:13,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-09 14:21:13,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-11-09 14:21:13,312 INFO L87 Difference]: Start difference. First operand 69 states and 109 transitions. Second operand 11 states. [2020-11-09 14:21:14,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:14,218 INFO L93 Difference]: Finished difference Result 103 states and 150 transitions. [2020-11-09 14:21:14,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-09 14:21:14,219 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2020-11-09 14:21:14,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:14,220 INFO L225 Difference]: With dead ends: 103 [2020-11-09 14:21:14,220 INFO L226 Difference]: Without dead ends: 103 [2020-11-09 14:21:14,220 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2020-11-09 14:21:14,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-11-09 14:21:14,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 71. [2020-11-09 14:21:14,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-11-09 14:21:14,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 113 transitions. [2020-11-09 14:21:14,224 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 113 transitions. Word has length 16 [2020-11-09 14:21:14,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:14,224 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 113 transitions. [2020-11-09 14:21:14,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-09 14:21:14,225 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 113 transitions. [2020-11-09 14:21:14,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:21:14,225 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:14,225 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:14,225 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-11-09 14:21:14,225 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:14,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:14,226 INFO L82 PathProgramCache]: Analyzing trace with hash 687627650, now seen corresponding path program 23 times [2020-11-09 14:21:14,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:14,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831798092] [2020-11-09 14:21:14,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:14,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:14,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:14,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831798092] [2020-11-09 14:21:14,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:14,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:21:14,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360965324] [2020-11-09 14:21:14,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:21:14,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:14,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:21:14,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:21:14,889 INFO L87 Difference]: Start difference. First operand 71 states and 113 transitions. Second operand 12 states. [2020-11-09 14:21:15,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:15,582 INFO L93 Difference]: Finished difference Result 82 states and 126 transitions. [2020-11-09 14:21:15,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 14:21:15,583 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:21:15,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:15,584 INFO L225 Difference]: With dead ends: 82 [2020-11-09 14:21:15,584 INFO L226 Difference]: Without dead ends: 72 [2020-11-09 14:21:15,584 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:21:15,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-11-09 14:21:15,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2020-11-09 14:21:15,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-11-09 14:21:15,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 110 transitions. [2020-11-09 14:21:15,587 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 110 transitions. Word has length 16 [2020-11-09 14:21:15,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:15,587 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 110 transitions. [2020-11-09 14:21:15,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:21:15,588 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 110 transitions. [2020-11-09 14:21:15,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:21:15,588 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:15,588 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:15,588 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-11-09 14:21:15,589 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:15,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:15,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1218934128, now seen corresponding path program 24 times [2020-11-09 14:21:15,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:15,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738144428] [2020-11-09 14:21:15,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:15,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:16,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:16,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738144428] [2020-11-09 14:21:16,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:16,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:21:16,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139121124] [2020-11-09 14:21:16,178 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:21:16,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:16,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:21:16,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:21:16,179 INFO L87 Difference]: Start difference. First operand 70 states and 110 transitions. Second operand 12 states. [2020-11-09 14:21:16,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:16,890 INFO L93 Difference]: Finished difference Result 82 states and 125 transitions. [2020-11-09 14:21:16,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 14:21:16,891 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:21:16,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:16,892 INFO L225 Difference]: With dead ends: 82 [2020-11-09 14:21:16,892 INFO L226 Difference]: Without dead ends: 73 [2020-11-09 14:21:16,892 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:21:16,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-11-09 14:21:16,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2020-11-09 14:21:16,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-11-09 14:21:16,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 107 transitions. [2020-11-09 14:21:16,896 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 107 transitions. Word has length 16 [2020-11-09 14:21:16,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:16,896 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 107 transitions. [2020-11-09 14:21:16,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:21:16,896 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 107 transitions. [2020-11-09 14:21:16,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:21:16,897 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:16,897 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:16,897 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-11-09 14:21:16,897 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:16,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:16,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1940115136, now seen corresponding path program 25 times [2020-11-09 14:21:16,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:16,898 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043636672] [2020-11-09 14:21:16,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:17,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:17,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043636672] [2020-11-09 14:21:17,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:17,546 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:21:17,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816638093] [2020-11-09 14:21:17,547 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:21:17,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:17,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:21:17,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:21:17,548 INFO L87 Difference]: Start difference. First operand 68 states and 107 transitions. Second operand 12 states. [2020-11-09 14:21:18,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:18,172 INFO L93 Difference]: Finished difference Result 84 states and 128 transitions. [2020-11-09 14:21:18,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 14:21:18,173 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:21:18,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:18,174 INFO L225 Difference]: With dead ends: 84 [2020-11-09 14:21:18,174 INFO L226 Difference]: Without dead ends: 67 [2020-11-09 14:21:18,175 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:21:18,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-11-09 14:21:18,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2020-11-09 14:21:18,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-11-09 14:21:18,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 99 transitions. [2020-11-09 14:21:18,178 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 99 transitions. Word has length 16 [2020-11-09 14:21:18,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:18,178 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 99 transitions. [2020-11-09 14:21:18,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:21:18,178 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 99 transitions. [2020-11-09 14:21:18,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:21:18,179 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:18,179 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:18,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-11-09 14:21:18,179 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:18,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:18,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1915580290, now seen corresponding path program 26 times [2020-11-09 14:21:18,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:18,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421437431] [2020-11-09 14:21:18,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:18,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:18,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421437431] [2020-11-09 14:21:18,790 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:18,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:21:18,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945762091] [2020-11-09 14:21:18,790 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:21:18,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:18,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:21:18,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:21:18,791 INFO L87 Difference]: Start difference. First operand 64 states and 99 transitions. Second operand 12 states. [2020-11-09 14:21:19,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:19,357 INFO L93 Difference]: Finished difference Result 78 states and 114 transitions. [2020-11-09 14:21:19,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-09 14:21:19,358 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:21:19,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:19,359 INFO L225 Difference]: With dead ends: 78 [2020-11-09 14:21:19,359 INFO L226 Difference]: Without dead ends: 65 [2020-11-09 14:21:19,360 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:21:19,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-11-09 14:21:19,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2020-11-09 14:21:19,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-11-09 14:21:19,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 91 transitions. [2020-11-09 14:21:19,362 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 91 transitions. Word has length 16 [2020-11-09 14:21:19,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:19,363 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 91 transitions. [2020-11-09 14:21:19,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:21:19,363 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 91 transitions. [2020-11-09 14:21:19,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:21:19,363 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:19,363 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:19,364 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-11-09 14:21:19,364 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:19,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:19,364 INFO L82 PathProgramCache]: Analyzing trace with hash -643513856, now seen corresponding path program 27 times [2020-11-09 14:21:19,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:19,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311280496] [2020-11-09 14:21:19,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:19,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:19,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:19,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311280496] [2020-11-09 14:21:19,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:19,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:21:19,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548970303] [2020-11-09 14:21:19,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:21:19,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:19,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:21:19,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:21:19,899 INFO L87 Difference]: Start difference. First operand 60 states and 91 transitions. Second operand 12 states. [2020-11-09 14:21:20,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:20,436 INFO L93 Difference]: Finished difference Result 71 states and 102 transitions. [2020-11-09 14:21:20,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 14:21:20,438 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:21:20,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:20,438 INFO L225 Difference]: With dead ends: 71 [2020-11-09 14:21:20,438 INFO L226 Difference]: Without dead ends: 56 [2020-11-09 14:21:20,439 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:21:20,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-11-09 14:21:20,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-11-09 14:21:20,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-11-09 14:21:20,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 83 transitions. [2020-11-09 14:21:20,441 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 83 transitions. Word has length 16 [2020-11-09 14:21:20,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:20,441 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 83 transitions. [2020-11-09 14:21:20,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:21:20,442 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 83 transitions. [2020-11-09 14:21:20,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:21:20,442 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:20,442 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:20,442 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-11-09 14:21:20,443 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:20,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:20,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1217605878, now seen corresponding path program 7 times [2020-11-09 14:21:20,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:20,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291776015] [2020-11-09 14:21:20,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:21,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:21,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291776015] [2020-11-09 14:21:21,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:21,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-09 14:21:21,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234865940] [2020-11-09 14:21:21,044 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-09 14:21:21,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:21,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-09 14:21:21,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-11-09 14:21:21,045 INFO L87 Difference]: Start difference. First operand 56 states and 83 transitions. Second operand 11 states. [2020-11-09 14:21:21,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:21,990 INFO L93 Difference]: Finished difference Result 82 states and 122 transitions. [2020-11-09 14:21:21,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-09 14:21:21,991 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2020-11-09 14:21:21,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:21,992 INFO L225 Difference]: With dead ends: 82 [2020-11-09 14:21:21,992 INFO L226 Difference]: Without dead ends: 82 [2020-11-09 14:21:21,992 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2020-11-09 14:21:21,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-11-09 14:21:21,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 66. [2020-11-09 14:21:21,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-11-09 14:21:21,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 104 transitions. [2020-11-09 14:21:21,996 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 104 transitions. Word has length 16 [2020-11-09 14:21:21,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:21,996 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 104 transitions. [2020-11-09 14:21:21,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-09 14:21:21,996 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 104 transitions. [2020-11-09 14:21:21,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:21:21,997 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:21,997 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:21,997 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-11-09 14:21:21,997 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:21,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:21,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1217605900, now seen corresponding path program 28 times [2020-11-09 14:21:21,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:21,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978501480] [2020-11-09 14:21:21,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:22,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:22,649 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978501480] [2020-11-09 14:21:22,649 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:22,650 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:21:22,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499472225] [2020-11-09 14:21:22,650 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:21:22,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:22,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:21:22,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:21:22,651 INFO L87 Difference]: Start difference. First operand 66 states and 104 transitions. Second operand 12 states. [2020-11-09 14:21:23,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:23,460 INFO L93 Difference]: Finished difference Result 76 states and 115 transitions. [2020-11-09 14:21:23,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 14:21:23,460 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:21:23,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:23,461 INFO L225 Difference]: With dead ends: 76 [2020-11-09 14:21:23,461 INFO L226 Difference]: Without dead ends: 66 [2020-11-09 14:21:23,462 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:21:23,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-11-09 14:21:23,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2020-11-09 14:21:23,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-11-09 14:21:23,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 101 transitions. [2020-11-09 14:21:23,464 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 101 transitions. Word has length 16 [2020-11-09 14:21:23,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:23,464 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 101 transitions. [2020-11-09 14:21:23,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:21:23,465 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 101 transitions. [2020-11-09 14:21:23,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:21:23,465 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:23,465 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:23,465 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-11-09 14:21:23,467 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:23,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:23,469 INFO L82 PathProgramCache]: Analyzing trace with hash -688955878, now seen corresponding path program 29 times [2020-11-09 14:21:23,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:23,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508423720] [2020-11-09 14:21:23,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:24,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:24,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508423720] [2020-11-09 14:21:24,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:24,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:21:24,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377532075] [2020-11-09 14:21:24,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:21:24,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:24,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:21:24,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:21:24,079 INFO L87 Difference]: Start difference. First operand 65 states and 101 transitions. Second operand 12 states. [2020-11-09 14:21:24,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:24,672 INFO L93 Difference]: Finished difference Result 72 states and 107 transitions. [2020-11-09 14:21:24,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 14:21:24,673 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:21:24,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:24,674 INFO L225 Difference]: With dead ends: 72 [2020-11-09 14:21:24,674 INFO L226 Difference]: Without dead ends: 64 [2020-11-09 14:21:24,674 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:21:24,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-11-09 14:21:24,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-11-09 14:21:24,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-11-09 14:21:24,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 99 transitions. [2020-11-09 14:21:24,677 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 99 transitions. Word has length 16 [2020-11-09 14:21:24,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:24,677 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 99 transitions. [2020-11-09 14:21:24,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:21:24,677 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 99 transitions. [2020-11-09 14:21:24,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:21:24,678 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:24,678 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:24,678 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-11-09 14:21:24,678 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:24,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:24,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1831028324, now seen corresponding path program 30 times [2020-11-09 14:21:24,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:24,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801866135] [2020-11-09 14:21:24,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:24,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:25,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:25,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801866135] [2020-11-09 14:21:25,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:25,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:21:25,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106129704] [2020-11-09 14:21:25,316 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:21:25,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:25,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:21:25,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:21:25,317 INFO L87 Difference]: Start difference. First operand 64 states and 99 transitions. Second operand 12 states. [2020-11-09 14:21:25,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:25,928 INFO L93 Difference]: Finished difference Result 81 states and 119 transitions. [2020-11-09 14:21:25,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-09 14:21:25,929 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:21:25,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:25,930 INFO L225 Difference]: With dead ends: 81 [2020-11-09 14:21:25,930 INFO L226 Difference]: Without dead ends: 68 [2020-11-09 14:21:25,931 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:21:25,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-11-09 14:21:25,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2020-11-09 14:21:25,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-11-09 14:21:25,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 91 transitions. [2020-11-09 14:21:25,934 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 91 transitions. Word has length 16 [2020-11-09 14:21:25,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:25,934 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 91 transitions. [2020-11-09 14:21:25,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:21:25,934 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 91 transitions. [2020-11-09 14:21:25,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:21:25,934 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:25,935 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:25,935 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-11-09 14:21:25,935 INFO L429 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:25,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:25,935 INFO L82 PathProgramCache]: Analyzing trace with hash -95155174, now seen corresponding path program 31 times [2020-11-09 14:21:25,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:25,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308974448] [2020-11-09 14:21:25,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:25,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:26,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:26,494 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308974448] [2020-11-09 14:21:26,494 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:26,495 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:21:26,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215430504] [2020-11-09 14:21:26,495 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:21:26,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:26,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:21:26,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:21:26,496 INFO L87 Difference]: Start difference. First operand 60 states and 91 transitions. Second operand 12 states. [2020-11-09 14:21:27,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:27,039 INFO L93 Difference]: Finished difference Result 74 states and 107 transitions. [2020-11-09 14:21:27,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 14:21:27,040 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:21:27,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:27,040 INFO L225 Difference]: With dead ends: 74 [2020-11-09 14:21:27,040 INFO L226 Difference]: Without dead ends: 61 [2020-11-09 14:21:27,041 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:21:27,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-11-09 14:21:27,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2020-11-09 14:21:27,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-11-09 14:21:27,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 86 transitions. [2020-11-09 14:21:27,043 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 86 transitions. Word has length 16 [2020-11-09 14:21:27,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:27,043 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 86 transitions. [2020-11-09 14:21:27,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:21:27,044 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 86 transitions. [2020-11-09 14:21:27,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:21:27,044 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:27,044 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:27,044 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-11-09 14:21:27,044 INFO L429 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:27,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:27,045 INFO L82 PathProgramCache]: Analyzing trace with hash -14077612, now seen corresponding path program 32 times [2020-11-09 14:21:27,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:27,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394178523] [2020-11-09 14:21:27,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:27,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:27,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394178523] [2020-11-09 14:21:27,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:27,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:21:27,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296189322] [2020-11-09 14:21:27,715 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:21:27,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:27,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:21:27,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:21:27,716 INFO L87 Difference]: Start difference. First operand 58 states and 86 transitions. Second operand 12 states. [2020-11-09 14:21:28,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:28,483 INFO L93 Difference]: Finished difference Result 75 states and 107 transitions. [2020-11-09 14:21:28,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-09 14:21:28,483 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:21:28,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:28,484 INFO L225 Difference]: With dead ends: 75 [2020-11-09 14:21:28,484 INFO L226 Difference]: Without dead ends: 68 [2020-11-09 14:21:28,485 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:21:28,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-11-09 14:21:28,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2020-11-09 14:21:28,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-11-09 14:21:28,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 89 transitions. [2020-11-09 14:21:28,487 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 89 transitions. Word has length 16 [2020-11-09 14:21:28,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:28,487 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 89 transitions. [2020-11-09 14:21:28,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:21:28,488 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 89 transitions. [2020-11-09 14:21:28,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:21:28,488 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:28,488 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:28,489 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-11-09 14:21:28,489 INFO L429 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:28,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:28,490 INFO L82 PathProgramCache]: Analyzing trace with hash -666609980, now seen corresponding path program 33 times [2020-11-09 14:21:28,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:28,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126042888] [2020-11-09 14:21:28,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:29,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:29,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126042888] [2020-11-09 14:21:29,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:29,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:21:29,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515993798] [2020-11-09 14:21:29,066 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:21:29,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:29,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:21:29,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:21:29,067 INFO L87 Difference]: Start difference. First operand 60 states and 89 transitions. Second operand 12 states. [2020-11-09 14:21:29,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:29,629 INFO L93 Difference]: Finished difference Result 71 states and 100 transitions. [2020-11-09 14:21:29,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 14:21:29,630 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:21:29,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:29,631 INFO L225 Difference]: With dead ends: 71 [2020-11-09 14:21:29,631 INFO L226 Difference]: Without dead ends: 54 [2020-11-09 14:21:29,632 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:21:29,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-11-09 14:21:29,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-11-09 14:21:29,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-11-09 14:21:29,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. [2020-11-09 14:21:29,634 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 16 [2020-11-09 14:21:29,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:29,634 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions. [2020-11-09 14:21:29,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:21:29,634 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions. [2020-11-09 14:21:29,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:21:29,635 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:29,635 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:29,635 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-11-09 14:21:29,635 INFO L429 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:29,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:29,636 INFO L82 PathProgramCache]: Analyzing trace with hash 425050028, now seen corresponding path program 8 times [2020-11-09 14:21:29,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:29,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777935484] [2020-11-09 14:21:29,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:30,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:30,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777935484] [2020-11-09 14:21:30,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:30,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:21:30,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340831596] [2020-11-09 14:21:30,141 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:21:30,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:30,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:21:30,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:21:30,142 INFO L87 Difference]: Start difference. First operand 54 states and 78 transitions. Second operand 12 states. [2020-11-09 14:21:30,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:30,836 INFO L93 Difference]: Finished difference Result 66 states and 94 transitions. [2020-11-09 14:21:30,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 14:21:30,836 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:21:30,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:30,837 INFO L225 Difference]: With dead ends: 66 [2020-11-09 14:21:30,837 INFO L226 Difference]: Without dead ends: 66 [2020-11-09 14:21:30,838 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2020-11-09 14:21:30,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-11-09 14:21:30,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 59. [2020-11-09 14:21:30,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-11-09 14:21:30,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 87 transitions. [2020-11-09 14:21:30,840 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 87 transitions. Word has length 16 [2020-11-09 14:21:30,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:30,840 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 87 transitions. [2020-11-09 14:21:30,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:21:30,841 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 87 transitions. [2020-11-09 14:21:30,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:21:30,841 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:30,841 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:30,841 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-11-09 14:21:30,842 INFO L429 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:30,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:30,842 INFO L82 PathProgramCache]: Analyzing trace with hash 425050050, now seen corresponding path program 34 times [2020-11-09 14:21:30,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:30,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734171250] [2020-11-09 14:21:30,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:30,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:31,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:31,541 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734171250] [2020-11-09 14:21:31,541 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:31,541 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:21:31,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965750127] [2020-11-09 14:21:31,541 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:21:31,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:31,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:21:31,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:21:31,542 INFO L87 Difference]: Start difference. First operand 59 states and 87 transitions. Second operand 12 states. [2020-11-09 14:21:32,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:32,245 INFO L93 Difference]: Finished difference Result 68 states and 95 transitions. [2020-11-09 14:21:32,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 14:21:32,246 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:21:32,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:32,246 INFO L225 Difference]: With dead ends: 68 [2020-11-09 14:21:32,246 INFO L226 Difference]: Without dead ends: 58 [2020-11-09 14:21:32,247 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:21:32,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-11-09 14:21:32,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2020-11-09 14:21:32,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-11-09 14:21:32,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 79 transitions. [2020-11-09 14:21:32,250 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 79 transitions. Word has length 16 [2020-11-09 14:21:32,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:32,250 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 79 transitions. [2020-11-09 14:21:32,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:21:32,250 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 79 transitions. [2020-11-09 14:21:32,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:21:32,250 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:32,250 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:32,251 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-11-09 14:21:32,251 INFO L429 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:32,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:32,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1481511728, now seen corresponding path program 35 times [2020-11-09 14:21:32,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:32,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862044244] [2020-11-09 14:21:32,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:32,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:32,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862044244] [2020-11-09 14:21:32,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:32,849 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:21:32,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567482545] [2020-11-09 14:21:32,849 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:21:32,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:32,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:21:32,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:21:32,850 INFO L87 Difference]: Start difference. First operand 55 states and 79 transitions. Second operand 12 states. [2020-11-09 14:21:33,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:33,470 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2020-11-09 14:21:33,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 14:21:33,471 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:21:33,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:33,472 INFO L225 Difference]: With dead ends: 62 [2020-11-09 14:21:33,472 INFO L226 Difference]: Without dead ends: 54 [2020-11-09 14:21:33,473 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:21:33,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-11-09 14:21:33,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-11-09 14:21:33,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-11-09 14:21:33,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 77 transitions. [2020-11-09 14:21:33,475 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 77 transitions. Word has length 16 [2020-11-09 14:21:33,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:33,475 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 77 transitions. [2020-11-09 14:21:33,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:21:33,475 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 77 transitions. [2020-11-09 14:21:33,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:21:33,475 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:33,476 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:33,476 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-11-09 14:21:33,476 INFO L429 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:33,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:33,476 INFO L82 PathProgramCache]: Analyzing trace with hash 509523842, now seen corresponding path program 36 times [2020-11-09 14:21:33,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:33,477 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769163942] [2020-11-09 14:21:33,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:34,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:34,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769163942] [2020-11-09 14:21:34,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:34,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:21:34,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042855666] [2020-11-09 14:21:34,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:21:34,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:34,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:21:34,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:21:34,097 INFO L87 Difference]: Start difference. First operand 54 states and 77 transitions. Second operand 12 states. [2020-11-09 14:21:34,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:34,696 INFO L93 Difference]: Finished difference Result 63 states and 85 transitions. [2020-11-09 14:21:34,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 14:21:34,696 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:21:34,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:34,697 INFO L225 Difference]: With dead ends: 63 [2020-11-09 14:21:34,697 INFO L226 Difference]: Without dead ends: 54 [2020-11-09 14:21:34,698 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:21:34,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-11-09 14:21:34,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2020-11-09 14:21:34,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-11-09 14:21:34,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2020-11-09 14:21:34,700 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 16 [2020-11-09 14:21:34,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:34,700 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2020-11-09 14:21:34,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:21:34,700 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2020-11-09 14:21:34,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:21:34,701 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:34,701 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:34,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2020-11-09 14:21:34,701 INFO L429 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:34,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:34,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1721120732, now seen corresponding path program 9 times [2020-11-09 14:21:34,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:34,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040376077] [2020-11-09 14:21:34,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:35,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:35,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040376077] [2020-11-09 14:21:35,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:35,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:21:35,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220675852] [2020-11-09 14:21:35,335 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:21:35,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:35,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:21:35,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:21:35,335 INFO L87 Difference]: Start difference. First operand 53 states and 75 transitions. Second operand 12 states. [2020-11-09 14:21:35,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:35,946 INFO L93 Difference]: Finished difference Result 60 states and 81 transitions. [2020-11-09 14:21:35,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-09 14:21:35,947 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:21:35,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:35,948 INFO L225 Difference]: With dead ends: 60 [2020-11-09 14:21:35,948 INFO L226 Difference]: Without dead ends: 60 [2020-11-09 14:21:35,949 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2020-11-09 14:21:35,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-11-09 14:21:35,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 37. [2020-11-09 14:21:35,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-09 14:21:35,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 56 transitions. [2020-11-09 14:21:35,951 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 56 transitions. Word has length 16 [2020-11-09 14:21:35,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:35,951 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 56 transitions. [2020-11-09 14:21:35,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:21:35,952 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 56 transitions. [2020-11-09 14:21:35,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:21:35,952 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:35,952 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:35,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-11-09 14:21:35,952 INFO L429 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:35,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:35,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1721120710, now seen corresponding path program 37 times [2020-11-09 14:21:35,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:35,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400672918] [2020-11-09 14:21:35,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:35,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:36,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:36,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400672918] [2020-11-09 14:21:36,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:36,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:21:36,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498508314] [2020-11-09 14:21:36,657 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:21:36,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:36,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:21:36,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:21:36,658 INFO L87 Difference]: Start difference. First operand 37 states and 56 transitions. Second operand 12 states. [2020-11-09 14:21:37,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:37,367 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2020-11-09 14:21:37,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 14:21:37,368 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:21:37,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:37,368 INFO L225 Difference]: With dead ends: 47 [2020-11-09 14:21:37,368 INFO L226 Difference]: Without dead ends: 37 [2020-11-09 14:21:37,368 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:21:37,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-11-09 14:21:37,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2020-11-09 14:21:37,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-11-09 14:21:37,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2020-11-09 14:21:37,371 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 16 [2020-11-09 14:21:37,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:37,371 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2020-11-09 14:21:37,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:21:37,371 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2020-11-09 14:21:37,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:21:37,371 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:37,371 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:37,371 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2020-11-09 14:21:37,371 INFO L429 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:37,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:37,372 INFO L82 PathProgramCache]: Analyzing trace with hash 667284808, now seen corresponding path program 38 times [2020-11-09 14:21:37,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:37,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983161009] [2020-11-09 14:21:37,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:37,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:37,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:37,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983161009] [2020-11-09 14:21:37,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:37,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:21:37,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631673230] [2020-11-09 14:21:37,953 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:21:37,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:37,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:21:37,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:21:37,954 INFO L87 Difference]: Start difference. First operand 36 states and 53 transitions. Second operand 12 states. [2020-11-09 14:21:38,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:38,602 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2020-11-09 14:21:38,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 14:21:38,603 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:21:38,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:38,603 INFO L225 Difference]: With dead ends: 43 [2020-11-09 14:21:38,603 INFO L226 Difference]: Without dead ends: 35 [2020-11-09 14:21:38,604 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:21:38,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-11-09 14:21:38,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-11-09 14:21:38,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-11-09 14:21:38,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 51 transitions. [2020-11-09 14:21:38,606 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 51 transitions. Word has length 16 [2020-11-09 14:21:38,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:38,606 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 51 transitions. [2020-11-09 14:21:38,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:21:38,606 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 51 transitions. [2020-11-09 14:21:38,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:21:38,607 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:38,607 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:38,607 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-11-09 14:21:38,607 INFO L429 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:38,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:38,607 INFO L82 PathProgramCache]: Analyzing trace with hash -474787638, now seen corresponding path program 39 times [2020-11-09 14:21:38,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:38,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188851063] [2020-11-09 14:21:38,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:39,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:39,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188851063] [2020-11-09 14:21:39,272 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:39,272 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:21:39,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437393182] [2020-11-09 14:21:39,272 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:21:39,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:39,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:21:39,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:21:39,273 INFO L87 Difference]: Start difference. First operand 35 states and 51 transitions. Second operand 12 states. [2020-11-09 14:21:39,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:39,861 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2020-11-09 14:21:39,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-09 14:21:39,862 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:21:39,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:39,863 INFO L225 Difference]: With dead ends: 49 [2020-11-09 14:21:39,863 INFO L226 Difference]: Without dead ends: 36 [2020-11-09 14:21:39,863 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:21:39,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-11-09 14:21:39,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2020-11-09 14:21:39,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-11-09 14:21:39,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2020-11-09 14:21:39,865 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 16 [2020-11-09 14:21:39,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:39,866 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2020-11-09 14:21:39,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:21:39,866 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2020-11-09 14:21:39,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:21:39,866 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:39,866 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:39,866 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2020-11-09 14:21:39,867 INFO L429 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:39,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:39,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1261085512, now seen corresponding path program 40 times [2020-11-09 14:21:39,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:39,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224362020] [2020-11-09 14:21:39,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:39,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:40,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:40,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224362020] [2020-11-09 14:21:40,445 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:40,445 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:21:40,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926276061] [2020-11-09 14:21:40,446 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:21:40,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:40,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:21:40,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:21:40,446 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 12 states. [2020-11-09 14:21:40,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:40,980 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2020-11-09 14:21:40,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 14:21:40,981 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:21:40,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:40,981 INFO L225 Difference]: With dead ends: 42 [2020-11-09 14:21:40,982 INFO L226 Difference]: Without dead ends: 29 [2020-11-09 14:21:40,982 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:21:40,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-11-09 14:21:40,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-11-09 14:21:40,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-11-09 14:21:40,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2020-11-09 14:21:40,984 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 16 [2020-11-09 14:21:40,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:40,984 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2020-11-09 14:21:40,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:21:40,984 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2020-11-09 14:21:40,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:21:40,985 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:40,985 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:40,985 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2020-11-09 14:21:40,985 INFO L429 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:40,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:40,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1342163074, now seen corresponding path program 41 times [2020-11-09 14:21:40,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:40,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517493709] [2020-11-09 14:21:40,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:41,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:41,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517493709] [2020-11-09 14:21:41,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:41,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:21:41,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837637548] [2020-11-09 14:21:41,616 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:21:41,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:41,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:21:41,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:21:41,617 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand 12 states. [2020-11-09 14:21:42,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:42,177 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2020-11-09 14:21:42,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-09 14:21:42,178 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:21:42,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:42,178 INFO L225 Difference]: With dead ends: 43 [2020-11-09 14:21:42,179 INFO L226 Difference]: Without dead ends: 36 [2020-11-09 14:21:42,179 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:21:42,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-11-09 14:21:42,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2020-11-09 14:21:42,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-11-09 14:21:42,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2020-11-09 14:21:42,181 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 16 [2020-11-09 14:21:42,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:42,181 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2020-11-09 14:21:42,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:21:42,181 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2020-11-09 14:21:42,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:21:42,181 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:42,181 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:42,182 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2020-11-09 14:21:42,182 INFO L429 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:42,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:42,182 INFO L82 PathProgramCache]: Analyzing trace with hash 689630706, now seen corresponding path program 42 times [2020-11-09 14:21:42,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:42,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774155357] [2020-11-09 14:21:42,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:42,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:42,771 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774155357] [2020-11-09 14:21:42,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:42,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:21:42,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339514797] [2020-11-09 14:21:42,772 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:21:42,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:42,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:21:42,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:21:42,773 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand 12 states. [2020-11-09 14:21:43,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:43,267 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2020-11-09 14:21:43,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 14:21:43,268 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:21:43,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:43,268 INFO L225 Difference]: With dead ends: 42 [2020-11-09 14:21:43,268 INFO L226 Difference]: Without dead ends: 27 [2020-11-09 14:21:43,268 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:21:43,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-11-09 14:21:43,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-11-09 14:21:43,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-11-09 14:21:43,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2020-11-09 14:21:43,269 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 16 [2020-11-09 14:21:43,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:43,270 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2020-11-09 14:21:43,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:21:43,270 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2020-11-09 14:21:43,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:21:43,270 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:43,270 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:43,270 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2020-11-09 14:21:43,271 INFO L429 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:43,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:43,271 INFO L82 PathProgramCache]: Analyzing trace with hash -44086392, now seen corresponding path program 43 times [2020-11-09 14:21:43,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:43,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920437539] [2020-11-09 14:21:43,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:43,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:43,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:43,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920437539] [2020-11-09 14:21:43,860 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:43,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:21:43,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416072893] [2020-11-09 14:21:43,860 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:21:43,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:43,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:21:43,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:21:43,862 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 12 states. [2020-11-09 14:21:44,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:44,342 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2020-11-09 14:21:44,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 14:21:44,343 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:21:44,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:44,343 INFO L225 Difference]: With dead ends: 34 [2020-11-09 14:21:44,343 INFO L226 Difference]: Without dead ends: 26 [2020-11-09 14:21:44,344 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:21:44,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-11-09 14:21:44,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-11-09 14:21:44,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-11-09 14:21:44,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2020-11-09 14:21:44,345 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 16 [2020-11-09 14:21:44,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:44,346 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2020-11-09 14:21:44,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:21:44,346 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2020-11-09 14:21:44,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:21:44,346 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:44,346 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:44,347 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2020-11-09 14:21:44,347 INFO L429 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:44,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:44,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1360243696, now seen corresponding path program 44 times [2020-11-09 14:21:44,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:44,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094817480] [2020-11-09 14:21:44,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:44,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:44,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094817480] [2020-11-09 14:21:44,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:44,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:21:44,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470124141] [2020-11-09 14:21:44,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:21:44,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:44,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:21:44,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:21:44,967 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 12 states. [2020-11-09 14:21:45,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:45,451 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-11-09 14:21:45,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-09 14:21:45,452 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:21:45,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:45,452 INFO L225 Difference]: With dead ends: 31 [2020-11-09 14:21:45,452 INFO L226 Difference]: Without dead ends: 24 [2020-11-09 14:21:45,453 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:21:45,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-11-09 14:21:45,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-11-09 14:21:45,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-11-09 14:21:45,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2020-11-09 14:21:45,454 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 16 [2020-11-09 14:21:45,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:45,454 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-11-09 14:21:45,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:21:45,454 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-11-09 14:21:45,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 14:21:45,455 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 14:21:45,455 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 14:21:45,455 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2020-11-09 14:21:45,455 INFO L429 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 14:21:45,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 14:21:45,455 INFO L82 PathProgramCache]: Analyzing trace with hash -2012776064, now seen corresponding path program 45 times [2020-11-09 14:21:45,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 14:21:45,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390266598] [2020-11-09 14:21:45,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 14:21:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 14:21:46,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 14:21:46,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390266598] [2020-11-09 14:21:46,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 14:21:46,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-09 14:21:46,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486738150] [2020-11-09 14:21:46,025 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 14:21:46,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 14:21:46,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 14:21:46,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-11-09 14:21:46,026 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 12 states. [2020-11-09 14:21:46,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 14:21:46,409 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2020-11-09 14:21:46,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 14:21:46,410 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2020-11-09 14:21:46,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 14:21:46,410 INFO L225 Difference]: With dead ends: 23 [2020-11-09 14:21:46,410 INFO L226 Difference]: Without dead ends: 0 [2020-11-09 14:21:46,411 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2020-11-09 14:21:46,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-09 14:21:46,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-09 14:21:46,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-09 14:21:46,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-09 14:21:46,411 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2020-11-09 14:21:46,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 14:21:46,411 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-09 14:21:46,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 14:21:46,412 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-09 14:21:46,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-09 14:21:46,412 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2020-11-09 14:21:46,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 02:21:46 BasicIcfg [2020-11-09 14:21:46,415 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 14:21:46,416 INFO L168 Benchmark]: Toolchain (without parser) took 92966.56 ms. Allocated memory was 156.2 MB in the beginning and 360.7 MB in the end (delta: 204.5 MB). Free memory was 127.6 MB in the beginning and 184.0 MB in the end (delta: -56.4 MB). Peak memory consumption was 148.8 MB. Max. memory is 8.0 GB. [2020-11-09 14:21:46,416 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 156.2 MB. Free memory is still 129.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 14:21:46,417 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1380.62 ms. Allocated memory was 156.2 MB in the beginning and 207.6 MB in the end (delta: 51.4 MB). Free memory was 127.0 MB in the beginning and 163.0 MB in the end (delta: -35.9 MB). Peak memory consumption was 82.4 MB. Max. memory is 8.0 GB. [2020-11-09 14:21:46,417 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.79 ms. Allocated memory is still 207.6 MB. Free memory was 163.0 MB in the beginning and 159.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-09 14:21:46,418 INFO L168 Benchmark]: Boogie Preprocessor took 59.22 ms. Allocated memory is still 207.6 MB. Free memory was 159.8 MB in the beginning and 157.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 14:21:46,418 INFO L168 Benchmark]: RCFGBuilder took 807.25 ms. Allocated memory is still 207.6 MB. Free memory was 156.7 MB in the beginning and 109.0 MB in the end (delta: 47.7 MB). Peak memory consumption was 47.2 MB. Max. memory is 8.0 GB. [2020-11-09 14:21:46,418 INFO L168 Benchmark]: TraceAbstraction took 90630.55 ms. Allocated memory was 207.6 MB in the beginning and 360.7 MB in the end (delta: 153.1 MB). Free memory was 108.4 MB in the beginning and 184.0 MB in the end (delta: -75.5 MB). Peak memory consumption was 77.0 MB. Max. memory is 8.0 GB. [2020-11-09 14:21:46,421 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.18 ms. Allocated memory is still 156.2 MB. Free memory is still 129.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 1380.62 ms. Allocated memory was 156.2 MB in the beginning and 207.6 MB in the end (delta: 51.4 MB). Free memory was 127.0 MB in the beginning and 163.0 MB in the end (delta: -35.9 MB). Peak memory consumption was 82.4 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 76.79 ms. Allocated memory is still 207.6 MB. Free memory was 163.0 MB in the beginning and 159.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 59.22 ms. Allocated memory is still 207.6 MB. Free memory was 159.8 MB in the beginning and 157.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 807.25 ms. Allocated memory is still 207.6 MB. Free memory was 156.7 MB in the beginning and 109.0 MB in the end (delta: 47.7 MB). Peak memory consumption was 47.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 90630.55 ms. Allocated memory was 207.6 MB in the beginning and 360.7 MB in the end (delta: 153.1 MB). Free memory was 108.4 MB in the beginning and 184.0 MB in the end (delta: -75.5 MB). Peak memory consumption was 77.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1128 VarBasedMoverChecksPositive, 40 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 23 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 20.7s, 145 PlacesBefore, 32 PlacesAfterwards, 151 TransitionsBefore, 30 TransitionsAfterwards, 2124 CoEnabledTransitionPairs, 7 FixpointIterations, 77 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 9 TrivialYvCompositions, 22 ConcurrentYvCompositions, 8 ChoiceCompositions, 178 TotalNumberOfCompositions, 3461 MoverChecksTotal - PositiveResult [Line: 1671]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1671]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1671]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1671]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 129 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 90.4s, OverallIterations: 60, TraceHistogramMax: 1, AutomataDifference: 35.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 20.7s, HoareTripleCheckerStatistics: 808 SDtfs, 1444 SDslu, 3691 SDs, 0 SdLazy, 11194 SolverSat, 1353 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 860 GetRequests, 32 SyntacticMatches, 27 SemanticMatches, 801 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 42.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 60 MinimizatonAttempts, 576 StatesRemovedByMinimization, 46 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 30.7s InterpolantComputationTime, 930 NumberOfCodeBlocks, 930 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 870 ConstructedInterpolants, 0 QuantifiedInterpolants, 323465 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 60 InterpolantComputations, 60 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 correct! Received shutdown request...