/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-races/race-2_2-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-60655ea [2020-09-15 00:30:41,618 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-15 00:30:41,623 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-15 00:30:41,668 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-15 00:30:41,669 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-15 00:30:41,677 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-15 00:30:41,681 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-15 00:30:41,686 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-15 00:30:41,689 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-15 00:30:41,693 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-15 00:30:41,693 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-15 00:30:41,695 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-15 00:30:41,695 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-15 00:30:41,698 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-15 00:30:41,701 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-15 00:30:41,703 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-15 00:30:41,705 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-15 00:30:41,706 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-15 00:30:41,707 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-15 00:30:41,716 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-15 00:30:41,719 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-15 00:30:41,720 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-15 00:30:41,721 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-15 00:30:41,722 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-15 00:30:41,734 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-15 00:30:41,735 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-15 00:30:41,735 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-15 00:30:41,741 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-15 00:30:41,742 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-15 00:30:41,743 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-15 00:30:41,743 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-15 00:30:41,744 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-15 00:30:41,745 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-15 00:30:41,751 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-15 00:30:41,752 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-15 00:30:41,752 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-15 00:30:41,753 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-15 00:30:41,753 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-15 00:30:41,753 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-15 00:30:41,754 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-15 00:30:41,756 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-15 00:30:41,758 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-15 00:30:41,804 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-15 00:30:41,804 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-15 00:30:41,806 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-15 00:30:41,807 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-15 00:30:41,807 INFO L138 SettingsManager]: * Use SBE=true [2020-09-15 00:30:41,807 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-15 00:30:41,807 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-15 00:30:41,808 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-15 00:30:41,808 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-15 00:30:41,808 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-15 00:30:41,809 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-15 00:30:41,810 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-15 00:30:41,810 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-15 00:30:41,810 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-15 00:30:41,811 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-15 00:30:41,811 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-15 00:30:41,811 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-15 00:30:41,811 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-15 00:30:41,811 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-15 00:30:41,812 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-15 00:30:41,812 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-15 00:30:41,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-15 00:30:41,812 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-15 00:30:41,812 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-15 00:30:41,813 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-15 00:30:41,813 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-15 00:30:41,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-15 00:30:41,813 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-15 00:30:41,813 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-15 00:30:41,814 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-09-15 00:30:42,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-15 00:30:42,297 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-15 00:30:42,303 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-15 00:30:42,305 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-15 00:30:42,306 INFO L275 PluginConnector]: CDTParser initialized [2020-09-15 00:30:42,307 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_2-container_of.i [2020-09-15 00:30:42,399 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/11fdf3b85/ba87f7efbed54e81a0c46a1bcde22e4f/FLAG39d705fa4 [2020-09-15 00:30:43,135 INFO L306 CDTParser]: Found 1 translation units. [2020-09-15 00:30:43,136 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/ldv-races/race-2_2-container_of.i [2020-09-15 00:30:43,163 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/11fdf3b85/ba87f7efbed54e81a0c46a1bcde22e4f/FLAG39d705fa4 [2020-09-15 00:30:43,330 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/11fdf3b85/ba87f7efbed54e81a0c46a1bcde22e4f [2020-09-15 00:30:43,345 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-15 00:30:43,351 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-09-15 00:30:43,352 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-15 00:30:43,352 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-15 00:30:43,356 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-15 00:30:43,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 12:30:43" (1/1) ... [2020-09-15 00:30:43,362 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@144b76bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:30:43, skipping insertion in model container [2020-09-15 00:30:43,362 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 12:30:43" (1/1) ... [2020-09-15 00:30:43,372 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-15 00:30:43,435 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-15 00:30:44,251 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-15 00:30:44,263 INFO L203 MainTranslator]: Completed pre-run [2020-09-15 00:30:44,363 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-15 00:30:44,966 INFO L208 MainTranslator]: Completed translation [2020-09-15 00:30:44,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:30:44 WrapperNode [2020-09-15 00:30:44,968 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-15 00:30:44,969 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-09-15 00:30:44,970 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-09-15 00:30:44,970 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-09-15 00:30:44,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:30:44" (1/1) ... [2020-09-15 00:30:45,054 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:30:44" (1/1) ... [2020-09-15 00:30:45,116 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-09-15 00:30:45,116 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-15 00:30:45,116 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-15 00:30:45,117 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-15 00:30:45,130 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:30:44" (1/1) ... [2020-09-15 00:30:45,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:30:44" (1/1) ... [2020-09-15 00:30:45,139 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:30:44" (1/1) ... [2020-09-15 00:30:45,140 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:30:44" (1/1) ... [2020-09-15 00:30:45,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:30:44" (1/1) ... [2020-09-15 00:30:45,183 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:30:44" (1/1) ... [2020-09-15 00:30:45,194 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:30:44" (1/1) ... [2020-09-15 00:30:45,207 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-15 00:30:45,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-15 00:30:45,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-15 00:30:45,210 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-15 00:30:45,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:30:44" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-15 00:30:45,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-15 00:30:45,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-09-15 00:30:45,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-09-15 00:30:45,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-15 00:30:45,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-15 00:30:45,320 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-09-15 00:30:45,320 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-09-15 00:30:45,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-09-15 00:30:45,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-09-15 00:30:45,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-09-15 00:30:45,324 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-09-15 00:30:45,963 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-15 00:30:45,963 INFO L295 CfgBuilder]: Removed 20 assume(true) statements. [2020-09-15 00:30:45,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 12:30:45 BoogieIcfgContainer [2020-09-15 00:30:45,973 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-15 00:30:45,974 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-15 00:30:45,974 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-15 00:30:45,978 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-15 00:30:45,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 12:30:43" (1/3) ... [2020-09-15 00:30:45,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ca74820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 12:30:45, skipping insertion in model container [2020-09-15 00:30:45,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 12:30:44" (2/3) ... [2020-09-15 00:30:45,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ca74820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 12:30:45, skipping insertion in model container [2020-09-15 00:30:45,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 12:30:45" (3/3) ... [2020-09-15 00:30:45,984 INFO L109 eAbstractionObserver]: Analyzing ICFG race-2_2-container_of.i [2020-09-15 00:30:45,995 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-09-15 00:30:45,995 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-09-15 00:30:46,004 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2020-09-15 00:30:46,005 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-09-15 00:30:46,039 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,039 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,039 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,040 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,040 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,040 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,040 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,041 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,041 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,041 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,041 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,042 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,042 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,042 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,042 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,043 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,043 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,043 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,043 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,044 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,044 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,044 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,044 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,045 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,045 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,045 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,046 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,046 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,046 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,046 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,047 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,047 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,047 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,047 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,048 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,048 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,048 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,048 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,049 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,049 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,049 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,049 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,050 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,050 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,050 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,050 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,051 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,051 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,051 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,052 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,052 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,052 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,052 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,052 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,053 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,053 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,053 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,054 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,058 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,058 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,059 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,059 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,059 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,059 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,060 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,060 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,060 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,060 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,061 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,071 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,071 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,071 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,072 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,072 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,072 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,073 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,073 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,073 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,073 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,074 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-09-15 00:30:46,116 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-09-15 00:30:46,145 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-15 00:30:46,145 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-15 00:30:46,145 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-15 00:30:46,145 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-15 00:30:46,146 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-15 00:30:46,146 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-15 00:30:46,146 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-15 00:30:46,146 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-15 00:30:46,169 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 131 transitions, 284 flow [2020-09-15 00:30:46,171 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 129 places, 131 transitions, 284 flow [2020-09-15 00:30:46,277 INFO L129 PetriNetUnfolder]: 9/169 cut-off events. [2020-09-15 00:30:46,278 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-09-15 00:30:46,286 INFO L80 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 169 events. 9/169 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 347 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 86. Up to 4 conditions per place. [2020-09-15 00:30:46,295 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 129 places, 131 transitions, 284 flow [2020-09-15 00:30:46,375 INFO L129 PetriNetUnfolder]: 9/169 cut-off events. [2020-09-15 00:30:46,376 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-09-15 00:30:46,377 INFO L80 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 169 events. 9/169 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 347 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 86. Up to 4 conditions per place. [2020-09-15 00:30:46,384 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2200 [2020-09-15 00:30:46,385 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-09-15 00:30:47,090 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:47,113 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:47,118 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:47,135 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:47,137 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:47,137 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2020-09-15 00:30:47,183 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:47,212 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:47,220 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:47,241 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:47,242 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:47,243 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-09-15 00:30:47,259 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:47,287 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:47,292 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:47,314 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:47,315 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:47,316 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-15 00:30:49,558 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:49,586 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:49,592 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:49,614 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:49,615 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:49,616 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-09-15 00:30:49,630 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:49,658 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:49,662 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:49,683 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:49,685 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:49,685 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-15 00:30:51,719 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:51,765 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:51,770 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:51,798 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:51,799 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:51,800 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-09-15 00:30:51,812 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:51,841 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:51,845 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:51,868 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:51,870 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:51,870 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-09-15 00:30:53,965 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:54,009 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:54,014 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:54,048 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:54,049 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:54,050 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-09-15 00:30:54,064 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:54,099 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:54,103 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:54,132 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:54,134 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:54,135 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-09-15 00:30:56,766 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:56,794 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:56,799 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:56,820 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:56,821 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:56,822 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-15 00:30:56,835 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:56,858 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:56,864 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:56,889 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:56,890 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:56,891 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-09-15 00:30:59,121 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:59,183 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:59,189 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:59,228 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:59,230 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:59,232 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:126, output treesize:128 [2020-09-15 00:30:59,255 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:59,313 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:59,319 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:59,377 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:30:59,378 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:30:59,379 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:128, output treesize:130 [2020-09-15 00:31:01,979 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:31:02,008 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:31:02,012 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:31:02,036 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:31:02,037 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:31:02,038 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:74 [2020-09-15 00:31:02,072 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:31:02,100 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:31:02,111 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:31:02,135 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:31:02,136 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:31:02,137 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-15 00:31:02,153 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:31:02,186 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:31:02,192 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:31:02,217 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:31:02,218 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:31:02,219 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-09-15 00:31:04,240 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:31:04,274 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:31:04,278 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:31:04,309 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:31:04,310 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:31:04,310 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:122 [2020-09-15 00:31:04,322 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:31:04,354 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:31:04,358 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:31:04,386 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:31:04,388 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:31:04,389 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-09-15 00:31:06,445 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:31:06,477 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:31:06,481 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:31:06,510 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:31:06,512 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:31:06,512 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:122, output treesize:124 [2020-09-15 00:31:06,532 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:31:06,564 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:31:06,572 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:31:06,611 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:31:06,612 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:31:06,613 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:122, output treesize:124 [2020-09-15 00:31:09,032 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2020-09-15 00:31:09,477 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2020-09-15 00:31:09,496 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:31:09,594 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:31:09,601 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:31:09,686 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:31:09,688 INFO L545 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-09-15 00:31:09,689 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:148, output treesize:160 [2020-09-15 00:31:09,876 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:31:09,916 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:31:09,921 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:31:09,959 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:31:09,961 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:31:09,962 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:124, output treesize:126 [2020-09-15 00:31:09,984 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:31:10,024 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:31:10,028 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:31:10,068 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:31:10,069 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:31:10,069 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:124, output treesize:126 [2020-09-15 00:31:12,453 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:31:12,519 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:31:12,525 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:31:12,579 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:31:12,580 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:31:12,581 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:136, output treesize:138 [2020-09-15 00:31:12,594 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:31:12,658 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:31:12,682 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-09-15 00:31:12,736 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-09-15 00:31:12,737 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-09-15 00:31:12,737 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:136, output treesize:138 [2020-09-15 00:31:14,989 WARN L193 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2020-09-15 00:31:15,947 WARN L193 SmtUtils]: Spent 469.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-09-15 00:31:16,322 WARN L193 SmtUtils]: Spent 372.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-09-15 00:31:16,577 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-09-15 00:31:16,826 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-09-15 00:31:17,078 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2954 [2020-09-15 00:31:17,078 INFO L214 etLargeBlockEncoding]: Total number of compositions: 134 [2020-09-15 00:31:17,082 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 32 transitions, 86 flow [2020-09-15 00:31:17,101 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 190 states. [2020-09-15 00:31:17,103 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states. [2020-09-15 00:31:17,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-09-15 00:31:17,112 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:17,113 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-09-15 00:31:17,113 INFO L427 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-09-15 00:31:17,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:17,120 INFO L82 PathProgramCache]: Analyzing trace with hash 14364445, now seen corresponding path program 1 times [2020-09-15 00:31:17,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:17,131 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909696923] [2020-09-15 00:31:17,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:17,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:17,644 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909696923] [2020-09-15 00:31:17,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:17,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-09-15 00:31:17,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985989872] [2020-09-15 00:31:17,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-15 00:31:17,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:17,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-15 00:31:17,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-15 00:31:17,674 INFO L87 Difference]: Start difference. First operand 190 states. Second operand 3 states. [2020-09-15 00:31:17,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:17,847 INFO L93 Difference]: Finished difference Result 248 states and 560 transitions. [2020-09-15 00:31:17,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-15 00:31:17,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-09-15 00:31:17,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:17,882 INFO L225 Difference]: With dead ends: 248 [2020-09-15 00:31:17,882 INFO L226 Difference]: Without dead ends: 230 [2020-09-15 00:31:17,886 INFO L675 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-09-15 00:31:17,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-09-15 00:31:17,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 200. [2020-09-15 00:31:17,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-09-15 00:31:17,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 444 transitions. [2020-09-15 00:31:17,960 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 444 transitions. Word has length 4 [2020-09-15 00:31:17,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:17,960 INFO L479 AbstractCegarLoop]: Abstraction has 200 states and 444 transitions. [2020-09-15 00:31:17,960 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-15 00:31:17,961 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 444 transitions. [2020-09-15 00:31:17,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-09-15 00:31:17,961 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:17,961 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-09-15 00:31:17,962 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-15 00:31:17,962 INFO L427 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-09-15 00:31:17,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:17,962 INFO L82 PathProgramCache]: Analyzing trace with hash 445298819, now seen corresponding path program 1 times [2020-09-15 00:31:17,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:17,963 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342035139] [2020-09-15 00:31:17,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:18,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:18,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:18,117 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342035139] [2020-09-15 00:31:18,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:18,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-09-15 00:31:18,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089067598] [2020-09-15 00:31:18,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-15 00:31:18,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:18,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-15 00:31:18,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-15 00:31:18,121 INFO L87 Difference]: Start difference. First operand 200 states and 444 transitions. Second operand 3 states. [2020-09-15 00:31:18,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:18,221 INFO L93 Difference]: Finished difference Result 243 states and 536 transitions. [2020-09-15 00:31:18,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-15 00:31:18,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-09-15 00:31:18,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:18,225 INFO L225 Difference]: With dead ends: 243 [2020-09-15 00:31:18,226 INFO L226 Difference]: Without dead ends: 236 [2020-09-15 00:31:18,227 INFO L675 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-09-15 00:31:18,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2020-09-15 00:31:18,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 221. [2020-09-15 00:31:18,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2020-09-15 00:31:18,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 505 transitions. [2020-09-15 00:31:18,249 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 505 transitions. Word has length 5 [2020-09-15 00:31:18,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:18,249 INFO L479 AbstractCegarLoop]: Abstraction has 221 states and 505 transitions. [2020-09-15 00:31:18,249 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-15 00:31:18,249 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 505 transitions. [2020-09-15 00:31:18,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-09-15 00:31:18,251 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:18,251 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 00:31:18,251 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-15 00:31:18,252 INFO L427 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-09-15 00:31:18,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:18,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1770707455, now seen corresponding path program 1 times [2020-09-15 00:31:18,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:18,253 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440202847] [2020-09-15 00:31:18,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:18,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:18,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:18,421 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440202847] [2020-09-15 00:31:18,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:18,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-15 00:31:18,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014015762] [2020-09-15 00:31:18,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-15 00:31:18,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:18,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-15 00:31:18,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-15 00:31:18,423 INFO L87 Difference]: Start difference. First operand 221 states and 505 transitions. Second operand 3 states. [2020-09-15 00:31:18,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:18,438 INFO L93 Difference]: Finished difference Result 86 states and 167 transitions. [2020-09-15 00:31:18,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-15 00:31:18,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-09-15 00:31:18,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:18,441 INFO L225 Difference]: With dead ends: 86 [2020-09-15 00:31:18,442 INFO L226 Difference]: Without dead ends: 86 [2020-09-15 00:31:18,442 INFO L675 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-09-15 00:31:18,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-09-15 00:31:18,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2020-09-15 00:31:18,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-09-15 00:31:18,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 167 transitions. [2020-09-15 00:31:18,461 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 167 transitions. Word has length 9 [2020-09-15 00:31:18,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:18,461 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 167 transitions. [2020-09-15 00:31:18,461 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-15 00:31:18,461 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 167 transitions. [2020-09-15 00:31:18,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-15 00:31:18,467 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:18,467 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 00:31:18,467 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-15 00:31:18,468 INFO L427 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-09-15 00:31:18,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:18,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1268591532, now seen corresponding path program 1 times [2020-09-15 00:31:18,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:18,469 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54963939] [2020-09-15 00:31:18,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:18,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:18,943 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54963939] [2020-09-15 00:31:18,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:18,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-15 00:31:18,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999786478] [2020-09-15 00:31:18,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-15 00:31:18,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:18,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-15 00:31:18,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-09-15 00:31:18,946 INFO L87 Difference]: Start difference. First operand 86 states and 167 transitions. Second operand 13 states. [2020-09-15 00:31:20,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:20,101 INFO L93 Difference]: Finished difference Result 86 states and 166 transitions. [2020-09-15 00:31:20,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-15 00:31:20,101 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2020-09-15 00:31:20,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:20,103 INFO L225 Difference]: With dead ends: 86 [2020-09-15 00:31:20,103 INFO L226 Difference]: Without dead ends: 74 [2020-09-15 00:31:20,104 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=237, Invalid=465, Unknown=0, NotChecked=0, Total=702 [2020-09-15 00:31:20,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-09-15 00:31:20,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-09-15 00:31:20,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-09-15 00:31:20,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 145 transitions. [2020-09-15 00:31:20,109 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 145 transitions. Word has length 18 [2020-09-15 00:31:20,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:20,109 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 145 transitions. [2020-09-15 00:31:20,110 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-15 00:31:20,110 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 145 transitions. [2020-09-15 00:31:20,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-15 00:31:20,111 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:20,111 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 00:31:20,111 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-15 00:31:20,111 INFO L427 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-09-15 00:31:20,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:20,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1297219722, now seen corresponding path program 1 times [2020-09-15 00:31:20,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:20,112 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277290490] [2020-09-15 00:31:20,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:20,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:20,488 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277290490] [2020-09-15 00:31:20,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:20,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-15 00:31:20,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156069146] [2020-09-15 00:31:20,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-15 00:31:20,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:20,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-15 00:31:20,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-15 00:31:20,490 INFO L87 Difference]: Start difference. First operand 74 states and 145 transitions. Second operand 8 states. [2020-09-15 00:31:20,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:20,840 INFO L93 Difference]: Finished difference Result 117 states and 209 transitions. [2020-09-15 00:31:20,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-15 00:31:20,841 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-09-15 00:31:20,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:20,843 INFO L225 Difference]: With dead ends: 117 [2020-09-15 00:31:20,843 INFO L226 Difference]: Without dead ends: 117 [2020-09-15 00:31:20,843 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-09-15 00:31:20,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-09-15 00:31:20,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 94. [2020-09-15 00:31:20,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-09-15 00:31:20,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 175 transitions. [2020-09-15 00:31:20,855 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 175 transitions. Word has length 18 [2020-09-15 00:31:20,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:20,855 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 175 transitions. [2020-09-15 00:31:20,856 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-15 00:31:20,856 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 175 transitions. [2020-09-15 00:31:20,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-15 00:31:20,860 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:20,860 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 00:31:20,861 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-15 00:31:20,861 INFO L427 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-09-15 00:31:20,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:20,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1297219740, now seen corresponding path program 1 times [2020-09-15 00:31:20,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:20,862 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031981440] [2020-09-15 00:31:20,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:21,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-09-15 00:31:21,715 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031981440] [2020-09-15 00:31:21,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:21,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-15 00:31:21,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980042570] [2020-09-15 00:31:21,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-15 00:31:21,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:21,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-15 00:31:21,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:31:21,717 INFO L87 Difference]: Start difference. First operand 94 states and 175 transitions. Second operand 14 states. [2020-09-15 00:31:22,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:22,752 INFO L93 Difference]: Finished difference Result 153 states and 271 transitions. [2020-09-15 00:31:22,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-15 00:31:22,753 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-09-15 00:31:22,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:22,754 INFO L225 Difference]: With dead ends: 153 [2020-09-15 00:31:22,754 INFO L226 Difference]: Without dead ends: 145 [2020-09-15 00:31:22,754 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2020-09-15 00:31:22,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-09-15 00:31:22,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 100. [2020-09-15 00:31:22,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-09-15 00:31:22,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 185 transitions. [2020-09-15 00:31:22,760 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 185 transitions. Word has length 18 [2020-09-15 00:31:22,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:22,760 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 185 transitions. [2020-09-15 00:31:22,761 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-15 00:31:22,761 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 185 transitions. [2020-09-15 00:31:22,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-15 00:31:22,762 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:22,762 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 00:31:22,763 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-15 00:31:22,763 INFO L427 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-09-15 00:31:22,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:22,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1046484834, now seen corresponding path program 2 times [2020-09-15 00:31:22,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:22,764 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255166399] [2020-09-15 00:31:22,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:23,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:23,464 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255166399] [2020-09-15 00:31:23,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:23,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-15 00:31:23,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339898377] [2020-09-15 00:31:23,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-15 00:31:23,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:23,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-15 00:31:23,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:31:23,467 INFO L87 Difference]: Start difference. First operand 100 states and 185 transitions. Second operand 14 states. [2020-09-15 00:31:24,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:24,693 INFO L93 Difference]: Finished difference Result 155 states and 274 transitions. [2020-09-15 00:31:24,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-15 00:31:24,694 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-09-15 00:31:24,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:24,695 INFO L225 Difference]: With dead ends: 155 [2020-09-15 00:31:24,695 INFO L226 Difference]: Without dead ends: 143 [2020-09-15 00:31:24,696 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2020-09-15 00:31:24,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-09-15 00:31:24,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 98. [2020-09-15 00:31:24,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-09-15 00:31:24,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 181 transitions. [2020-09-15 00:31:24,700 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 181 transitions. Word has length 18 [2020-09-15 00:31:24,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:24,701 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 181 transitions. [2020-09-15 00:31:24,701 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-15 00:31:24,701 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 181 transitions. [2020-09-15 00:31:24,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-15 00:31:24,703 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:24,704 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 00:31:24,704 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-15 00:31:24,704 INFO L427 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-09-15 00:31:24,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:24,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1347055900, now seen corresponding path program 3 times [2020-09-15 00:31:24,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:24,705 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484668471] [2020-09-15 00:31:24,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:25,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:25,393 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484668471] [2020-09-15 00:31:25,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:25,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-15 00:31:25,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569927652] [2020-09-15 00:31:25,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-15 00:31:25,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:25,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-15 00:31:25,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:31:25,395 INFO L87 Difference]: Start difference. First operand 98 states and 181 transitions. Second operand 14 states. [2020-09-15 00:31:26,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:26,528 INFO L93 Difference]: Finished difference Result 139 states and 253 transitions. [2020-09-15 00:31:26,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-15 00:31:26,529 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-09-15 00:31:26,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:26,531 INFO L225 Difference]: With dead ends: 139 [2020-09-15 00:31:26,531 INFO L226 Difference]: Without dead ends: 123 [2020-09-15 00:31:26,532 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2020-09-15 00:31:26,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-09-15 00:31:26,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 96. [2020-09-15 00:31:26,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-09-15 00:31:26,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 177 transitions. [2020-09-15 00:31:26,536 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 177 transitions. Word has length 18 [2020-09-15 00:31:26,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:26,537 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 177 transitions. [2020-09-15 00:31:26,537 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-15 00:31:26,537 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 177 transitions. [2020-09-15 00:31:26,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-15 00:31:26,538 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:26,538 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 00:31:26,538 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-15 00:31:26,538 INFO L427 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-09-15 00:31:26,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:26,539 INFO L82 PathProgramCache]: Analyzing trace with hash 646402192, now seen corresponding path program 2 times [2020-09-15 00:31:26,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:26,539 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509156778] [2020-09-15 00:31:26,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:26,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:26,881 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509156778] [2020-09-15 00:31:26,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:26,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-15 00:31:26,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91939694] [2020-09-15 00:31:26,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-15 00:31:26,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:26,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-15 00:31:26,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-09-15 00:31:26,883 INFO L87 Difference]: Start difference. First operand 96 states and 177 transitions. Second operand 8 states. [2020-09-15 00:31:27,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:27,290 INFO L93 Difference]: Finished difference Result 119 states and 212 transitions. [2020-09-15 00:31:27,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-15 00:31:27,291 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-09-15 00:31:27,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:27,292 INFO L225 Difference]: With dead ends: 119 [2020-09-15 00:31:27,292 INFO L226 Difference]: Without dead ends: 119 [2020-09-15 00:31:27,293 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-09-15 00:31:27,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-09-15 00:31:27,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 96. [2020-09-15 00:31:27,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-09-15 00:31:27,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 177 transitions. [2020-09-15 00:31:27,297 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 177 transitions. Word has length 18 [2020-09-15 00:31:27,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:27,297 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 177 transitions. [2020-09-15 00:31:27,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-15 00:31:27,297 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 177 transitions. [2020-09-15 00:31:27,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-15 00:31:27,298 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:27,298 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 00:31:27,298 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-15 00:31:27,298 INFO L427 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-09-15 00:31:27,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:27,299 INFO L82 PathProgramCache]: Analyzing trace with hash 646402210, now seen corresponding path program 4 times [2020-09-15 00:31:27,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:27,299 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693855080] [2020-09-15 00:31:27,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:27,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:27,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:27,959 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693855080] [2020-09-15 00:31:27,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:27,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-15 00:31:27,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70577392] [2020-09-15 00:31:27,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-15 00:31:27,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:27,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-15 00:31:27,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:31:27,961 INFO L87 Difference]: Start difference. First operand 96 states and 177 transitions. Second operand 14 states. [2020-09-15 00:31:29,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:29,005 INFO L93 Difference]: Finished difference Result 135 states and 244 transitions. [2020-09-15 00:31:29,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-15 00:31:29,006 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-09-15 00:31:29,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:29,008 INFO L225 Difference]: With dead ends: 135 [2020-09-15 00:31:29,008 INFO L226 Difference]: Without dead ends: 113 [2020-09-15 00:31:29,009 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2020-09-15 00:31:29,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-09-15 00:31:29,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 92. [2020-09-15 00:31:29,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-09-15 00:31:29,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 171 transitions. [2020-09-15 00:31:29,012 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 171 transitions. Word has length 18 [2020-09-15 00:31:29,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:29,013 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 171 transitions. [2020-09-15 00:31:29,013 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-15 00:31:29,013 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 171 transitions. [2020-09-15 00:31:29,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-15 00:31:29,014 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:29,014 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 00:31:29,014 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-15 00:31:29,014 INFO L427 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-09-15 00:31:29,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:29,014 INFO L82 PathProgramCache]: Analyzing trace with hash -318962108, now seen corresponding path program 5 times [2020-09-15 00:31:29,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:29,015 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679963888] [2020-09-15 00:31:29,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:29,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:29,675 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679963888] [2020-09-15 00:31:29,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:29,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-15 00:31:29,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387641400] [2020-09-15 00:31:29,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-15 00:31:29,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:29,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-15 00:31:29,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:31:29,676 INFO L87 Difference]: Start difference. First operand 92 states and 171 transitions. Second operand 14 states. [2020-09-15 00:31:30,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:30,802 INFO L93 Difference]: Finished difference Result 152 states and 280 transitions. [2020-09-15 00:31:30,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-15 00:31:30,803 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-09-15 00:31:30,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:30,804 INFO L225 Difference]: With dead ends: 152 [2020-09-15 00:31:30,804 INFO L226 Difference]: Without dead ends: 144 [2020-09-15 00:31:30,805 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2020-09-15 00:31:30,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-09-15 00:31:30,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 100. [2020-09-15 00:31:30,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-09-15 00:31:30,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 187 transitions. [2020-09-15 00:31:30,809 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 187 transitions. Word has length 18 [2020-09-15 00:31:30,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:30,809 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 187 transitions. [2020-09-15 00:31:30,809 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-15 00:31:30,809 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 187 transitions. [2020-09-15 00:31:30,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-15 00:31:30,810 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:30,810 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 00:31:30,810 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-15 00:31:30,810 INFO L427 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-09-15 00:31:30,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:30,811 INFO L82 PathProgramCache]: Analyzing trace with hash -569697014, now seen corresponding path program 6 times [2020-09-15 00:31:30,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:30,811 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779169863] [2020-09-15 00:31:30,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:31,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:31,472 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779169863] [2020-09-15 00:31:31,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:31,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-15 00:31:31,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849989407] [2020-09-15 00:31:31,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-15 00:31:31,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:31,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-15 00:31:31,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:31:31,474 INFO L87 Difference]: Start difference. First operand 100 states and 187 transitions. Second operand 14 states. [2020-09-15 00:31:32,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:32,530 INFO L93 Difference]: Finished difference Result 154 states and 283 transitions. [2020-09-15 00:31:32,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-15 00:31:32,531 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-09-15 00:31:32,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:32,533 INFO L225 Difference]: With dead ends: 154 [2020-09-15 00:31:32,533 INFO L226 Difference]: Without dead ends: 142 [2020-09-15 00:31:32,534 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-09-15 00:31:32,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-09-15 00:31:32,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 98. [2020-09-15 00:31:32,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-09-15 00:31:32,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 183 transitions. [2020-09-15 00:31:32,538 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 183 transitions. Word has length 18 [2020-09-15 00:31:32,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:32,538 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 183 transitions. [2020-09-15 00:31:32,538 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-15 00:31:32,538 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 183 transitions. [2020-09-15 00:31:32,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-15 00:31:32,539 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:32,539 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 00:31:32,539 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-15 00:31:32,539 INFO L427 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-09-15 00:31:32,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:32,540 INFO L82 PathProgramCache]: Analyzing trace with hash -269125948, now seen corresponding path program 7 times [2020-09-15 00:31:32,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:32,540 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353803162] [2020-09-15 00:31:32,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:32,961 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2020-09-15 00:31:33,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:33,468 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353803162] [2020-09-15 00:31:33,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:33,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-15 00:31:33,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767126407] [2020-09-15 00:31:33,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-15 00:31:33,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:33,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-15 00:31:33,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:31:33,474 INFO L87 Difference]: Start difference. First operand 98 states and 183 transitions. Second operand 14 states. [2020-09-15 00:31:34,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:34,699 INFO L93 Difference]: Finished difference Result 149 states and 278 transitions. [2020-09-15 00:31:34,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-15 00:31:34,700 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-09-15 00:31:34,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:34,702 INFO L225 Difference]: With dead ends: 149 [2020-09-15 00:31:34,702 INFO L226 Difference]: Without dead ends: 133 [2020-09-15 00:31:34,703 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-09-15 00:31:34,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-09-15 00:31:34,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 96. [2020-09-15 00:31:34,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-09-15 00:31:34,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 179 transitions. [2020-09-15 00:31:34,707 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 179 transitions. Word has length 18 [2020-09-15 00:31:34,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:34,707 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 179 transitions. [2020-09-15 00:31:34,707 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-15 00:31:34,708 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 179 transitions. [2020-09-15 00:31:34,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-15 00:31:34,708 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:34,708 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 00:31:34,709 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-15 00:31:34,709 INFO L427 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-09-15 00:31:34,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:34,709 INFO L82 PathProgramCache]: Analyzing trace with hash -969779638, now seen corresponding path program 8 times [2020-09-15 00:31:34,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:34,710 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526365271] [2020-09-15 00:31:34,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:35,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:35,418 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526365271] [2020-09-15 00:31:35,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:35,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-15 00:31:35,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578824199] [2020-09-15 00:31:35,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-15 00:31:35,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:35,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-15 00:31:35,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-09-15 00:31:35,419 INFO L87 Difference]: Start difference. First operand 96 states and 179 transitions. Second operand 14 states. [2020-09-15 00:31:36,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:36,525 INFO L93 Difference]: Finished difference Result 167 states and 302 transitions. [2020-09-15 00:31:36,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-15 00:31:36,525 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-09-15 00:31:36,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:36,527 INFO L225 Difference]: With dead ends: 167 [2020-09-15 00:31:36,527 INFO L226 Difference]: Without dead ends: 147 [2020-09-15 00:31:36,528 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-09-15 00:31:36,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-09-15 00:31:36,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 94. [2020-09-15 00:31:36,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-09-15 00:31:36,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 175 transitions. [2020-09-15 00:31:36,536 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 175 transitions. Word has length 18 [2020-09-15 00:31:36,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:36,537 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 175 transitions. [2020-09-15 00:31:36,537 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-15 00:31:36,537 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 175 transitions. [2020-09-15 00:31:36,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-15 00:31:36,540 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:36,540 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 00:31:36,540 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-15 00:31:36,540 INFO L427 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-09-15 00:31:36,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:36,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1049440908, now seen corresponding path program 3 times [2020-09-15 00:31:36,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:36,542 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951167064] [2020-09-15 00:31:36,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:36,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-15 00:31:36,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-15 00:31:36,999 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951167064] [2020-09-15 00:31:36,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-15 00:31:36,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-15 00:31:36,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629894216] [2020-09-15 00:31:37,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-15 00:31:37,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-15 00:31:37,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-15 00:31:37,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-09-15 00:31:37,001 INFO L87 Difference]: Start difference. First operand 94 states and 175 transitions. Second operand 11 states. [2020-09-15 00:31:37,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-15 00:31:37,588 INFO L93 Difference]: Finished difference Result 206 states and 364 transitions. [2020-09-15 00:31:37,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-15 00:31:37,589 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2020-09-15 00:31:37,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-15 00:31:37,590 INFO L225 Difference]: With dead ends: 206 [2020-09-15 00:31:37,590 INFO L226 Difference]: Without dead ends: 206 [2020-09-15 00:31:37,591 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2020-09-15 00:31:37,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-09-15 00:31:37,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 116. [2020-09-15 00:31:37,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-09-15 00:31:37,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 229 transitions. [2020-09-15 00:31:37,595 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 229 transitions. Word has length 18 [2020-09-15 00:31:37,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-15 00:31:37,596 INFO L479 AbstractCegarLoop]: Abstraction has 116 states and 229 transitions. [2020-09-15 00:31:37,596 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-15 00:31:37,596 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 229 transitions. [2020-09-15 00:31:37,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-15 00:31:37,597 INFO L414 BasicCegarLoop]: Found error trace [2020-09-15 00:31:37,597 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-15 00:31:37,597 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-15 00:31:37,597 INFO L427 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-09-15 00:31:37,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-15 00:31:37,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1049440926, now seen corresponding path program 9 times [2020-09-15 00:31:37,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-15 00:31:37,598 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273735152] [2020-09-15 00:31:37,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-15 00:31:37,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-15 00:31:37,648 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-15 00:31:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-15 00:31:37,692 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-15 00:31:37,737 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-09-15 00:31:37,737 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-15 00:31:37,738 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-15 00:31:37,739 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-09-15 00:31:37,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [392] [392] L1682-->L1739: Formula: (and (not (= ULTIMATE.start_ldv_assert_~expression_Out-1221664334 0)) (= ULTIMATE.start_ldv_assert_~expression_Out-1221664334 |ULTIMATE.start_ldv_assert_#in~expression_In-1221664334|)) InVars {ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_In-1221664334|} OutVars{ULTIMATE.start_main_#t~mem40=|ULTIMATE.start_main_#t~mem40_Out-1221664334|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_In-1221664334|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out-1221664334} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem40, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2020-09-15 00:31:37,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 12:31:37 BasicIcfg [2020-09-15 00:31:37,800 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-15 00:31:37,803 INFO L168 Benchmark]: Toolchain (without parser) took 54456.38 ms. Allocated memory was 146.3 MB in the beginning and 412.1 MB in the end (delta: 265.8 MB). Free memory was 97.6 MB in the beginning and 122.7 MB in the end (delta: -25.1 MB). Peak memory consumption was 240.7 MB. Max. memory is 7.1 GB. [2020-09-15 00:31:37,803 INFO L168 Benchmark]: CDTParser took 0.62 ms. Allocated memory is still 146.3 MB. Free memory was 119.5 MB in the beginning and 119.1 MB in the end (delta: 419.4 kB). Peak memory consumption was 419.4 kB. Max. memory is 7.1 GB. [2020-09-15 00:31:37,804 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1617.19 ms. Allocated memory was 146.3 MB in the beginning and 237.0 MB in the end (delta: 90.7 MB). Free memory was 96.8 MB in the beginning and 170.7 MB in the end (delta: -73.9 MB). Peak memory consumption was 73.4 MB. Max. memory is 7.1 GB. [2020-09-15 00:31:37,805 INFO L168 Benchmark]: Boogie Procedure Inliner took 146.43 ms. Allocated memory is still 237.0 MB. Free memory was 170.7 MB in the beginning and 168.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2020-09-15 00:31:37,805 INFO L168 Benchmark]: Boogie Preprocessor took 91.36 ms. Allocated memory is still 237.0 MB. Free memory was 168.9 MB in the beginning and 165.5 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2020-09-15 00:31:37,806 INFO L168 Benchmark]: RCFGBuilder took 763.15 ms. Allocated memory is still 237.0 MB. Free memory was 165.5 MB in the beginning and 119.7 MB in the end (delta: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 7.1 GB. [2020-09-15 00:31:37,806 INFO L168 Benchmark]: TraceAbstraction took 51826.27 ms. Allocated memory was 237.0 MB in the beginning and 412.1 MB in the end (delta: 175.1 MB). Free memory was 119.7 MB in the beginning and 122.7 MB in the end (delta: -3.0 MB). Peak memory consumption was 172.1 MB. Max. memory is 7.1 GB. [2020-09-15 00:31:37,809 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.62 ms. Allocated memory is still 146.3 MB. Free memory was 119.5 MB in the beginning and 119.1 MB in the end (delta: 419.4 kB). Peak memory consumption was 419.4 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1617.19 ms. Allocated memory was 146.3 MB in the beginning and 237.0 MB in the end (delta: 90.7 MB). Free memory was 96.8 MB in the beginning and 170.7 MB in the end (delta: -73.9 MB). Peak memory consumption was 73.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 146.43 ms. Allocated memory is still 237.0 MB. Free memory was 170.7 MB in the beginning and 168.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 91.36 ms. Allocated memory is still 237.0 MB. Free memory was 168.9 MB in the beginning and 165.5 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 763.15 ms. Allocated memory is still 237.0 MB. Free memory was 165.5 MB in the beginning and 119.7 MB in the end (delta: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 51826.27 ms. Allocated memory was 237.0 MB in the beginning and 412.1 MB in the end (delta: 175.1 MB). Free memory was 119.7 MB in the beginning and 122.7 MB in the end (delta: -3.0 MB). Peak memory consumption was 172.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 30.9s, 129 ProgramPointsBefore, 34 ProgramPointsAfterwards, 131 TransitionsBefore, 32 TransitionsAfterwards, 2200 CoEnabledTransitionPairs, 7 FixpointIterations, 63 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 16 ConcurrentYvCompositions, 4 ChoiceCompositions, 1101 VarBasedMoverChecksPositive, 35 VarBasedMoverChecksNegative, 1 SemBasedMoverChecksPositive, 31 SemBasedMoverChecksNegative, 11 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 24.5s, 0 MoverChecksTotal, 2954 CheckedPairsTotal, 134 TotalNumberOfCompositions - CounterExampleResult [Line: 1682]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1683] 0 pthread_t t1,t2; [L1725] 0 return 0; [L1731] 0 int ret = my_drv_init(); [L1732] COND TRUE 0 ret==0 [L1733] 0 int probe_ret; [L1734] 0 struct my_data data; [L1704] 0 struct device *d = &data->dev; [L1706] 0 data->shared.a = 0 [L1707] 0 data->shared.b = 0 [L1708] 0 int res = __VERIFIER_nondet_int(); [L1709] COND FALSE 0 !(\read(res)) [L1711] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [arg={5:24}, t1={6:0}, t2={3:0}] [L1696] 1 struct device *dev = (struct device*)arg; [L1697] 1 struct my_data *data; [L1698] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L1698] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1699] 1 data->shared.a = 1 VAL [__mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1={6:0}, t2={3:0}] [L1700] 1 data->shared.b VAL [__mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, data->shared.b=0, dev={5:24}, t1={6:0}, t2={3:0}] [L1712] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [__mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, data->shared.b=0, dev={5:24}, t1={6:0}, t2={3:0}] [L1696] 2 struct device *dev = (struct device*)arg; [L1697] 2 struct my_data *data; [L1698] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L1698] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1699] 2 data->shared.a = 1 VAL [__mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, data->shared.b=0, dev={5:24}, t1={6:0}, t2={3:0}] [L1700] EXPR 2 data->shared.b VAL [__mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, data->shared.b=0, dev={5:24}, t1={6:0}, t2={3:0}] [L1700] 2 data->shared.b = data->shared.b + 1 [L1701] 2 return 0; [L1700] 1 data->shared.b = data->shared.b + 1 [L1701] 1 return 0; [L1713] 0 return 0; [L1735] 0 probe_ret = my_drv_probe(&data) VAL [\result={0:0}, __mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1={6:0}, t2={3:0}] [L1736] COND TRUE 0 probe_ret==0 [L1719] 0 void *status; [L1720] 0 \read(t1) VAL [\result={0:0}, __mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1={6:0}, t2={3:0}] [L1720] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, __mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1={6:0}, t2={3:0}] [L1721] 0 \read(t2) VAL [\result={0:0}, __mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1={6:0}, t2={3:0}] [L1721] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\result={0:0}, __mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1={6:0}, t2={3:0}] [L1738] 0 data.shared.a [L1739] 0 data.shared.b [L1682] COND TRUE 0 !expression [L1682] 0 __VERIFIER_error() VAL [\result={0:0}, __mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1={6:0}, t2={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 111 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 51.5s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 11.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 30.9s, HoareTripleCheckerStatistics: 269 SDtfs, 583 SDslu, 947 SDs, 0 SdLazy, 3861 SolverSat, 396 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 226 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred 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.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 497 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 219 ConstructedInterpolants, 0 QuantifiedInterpolants, 78203 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...