/usr/bin/java -Xmx16000000000 -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-11af1e5 [2020-10-09 13:17:07,669 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-09 13:17:07,672 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-09 13:17:07,714 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-09 13:17:07,714 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-09 13:17:07,722 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-09 13:17:07,725 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-09 13:17:07,729 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-09 13:17:07,731 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-09 13:17:07,734 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-09 13:17:07,735 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-09 13:17:07,736 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-09 13:17:07,736 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-09 13:17:07,739 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-09 13:17:07,741 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-09 13:17:07,743 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-09 13:17:07,744 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-09 13:17:07,745 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-09 13:17:07,747 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-09 13:17:07,755 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-09 13:17:07,757 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-09 13:17:07,758 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-09 13:17:07,759 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-09 13:17:07,760 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-09 13:17:07,772 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-09 13:17:07,777 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-09 13:17:07,777 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-09 13:17:07,778 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-09 13:17:07,779 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-09 13:17:07,779 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-09 13:17:07,780 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-09 13:17:07,780 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-09 13:17:07,781 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-09 13:17:07,782 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-09 13:17:07,782 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-09 13:17:07,783 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-09 13:17:07,783 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-09 13:17:07,783 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-09 13:17:07,784 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-09 13:17:07,784 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-09 13:17:07,785 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-09 13:17:07,786 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-09 13:17:07,811 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-09 13:17:07,811 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-09 13:17:07,812 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-09 13:17:07,812 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-09 13:17:07,813 INFO L138 SettingsManager]: * Use SBE=true [2020-10-09 13:17:07,813 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-09 13:17:07,813 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-09 13:17:07,813 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-09 13:17:07,813 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-09 13:17:07,814 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-09 13:17:07,814 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-09 13:17:07,814 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-09 13:17:07,814 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-09 13:17:07,814 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-09 13:17:07,815 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-09 13:17:07,815 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-09 13:17:07,815 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-09 13:17:07,815 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-09 13:17:07,815 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-09 13:17:07,815 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-09 13:17:07,816 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-09 13:17:07,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-09 13:17:07,816 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-09 13:17:07,816 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-09 13:17:07,816 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-09 13:17:07,817 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-09 13:17:07,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-09 13:17:07,817 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-09 13:17:07,817 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-09 13:17:07,817 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-09 13:17:08,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-09 13:17:08,118 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-09 13:17:08,122 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-09 13:17:08,123 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-09 13:17:08,124 INFO L275 PluginConnector]: CDTParser initialized [2020-10-09 13:17:08,124 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_2-container_of.i [2020-10-09 13:17:08,185 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec1bcd180/a63ded14b1504044b0ef54f4935920ce/FLAG43a1b79b5 [2020-10-09 13:17:08,779 INFO L306 CDTParser]: Found 1 translation units. [2020-10-09 13:17:08,779 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_2-container_of.i [2020-10-09 13:17:08,802 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec1bcd180/a63ded14b1504044b0ef54f4935920ce/FLAG43a1b79b5 [2020-10-09 13:17:09,017 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec1bcd180/a63ded14b1504044b0ef54f4935920ce [2020-10-09 13:17:09,027 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-09 13:17:09,029 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-09 13:17:09,030 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-09 13:17:09,030 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-09 13:17:09,034 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-09 13:17:09,035 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 01:17:09" (1/1) ... [2020-10-09 13:17:09,038 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d22ae64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:17:09, skipping insertion in model container [2020-10-09 13:17:09,038 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 01:17:09" (1/1) ... [2020-10-09 13:17:09,046 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-09 13:17:09,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-09 13:17:09,874 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 13:17:09,884 INFO L203 MainTranslator]: Completed pre-run [2020-10-09 13:17:09,941 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 13:17:10,330 INFO L208 MainTranslator]: Completed translation [2020-10-09 13:17:10,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:17:10 WrapperNode [2020-10-09 13:17:10,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-09 13:17:10,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-09 13:17:10,332 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-09 13:17:10,332 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-09 13:17:10,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:17:10" (1/1) ... [2020-10-09 13:17:10,373 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:17:10" (1/1) ... [2020-10-09 13:17:10,408 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-09 13:17:10,408 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-09 13:17:10,408 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-09 13:17:10,409 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-09 13:17:10,417 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:17:10" (1/1) ... [2020-10-09 13:17:10,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:17:10" (1/1) ... [2020-10-09 13:17:10,423 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:17:10" (1/1) ... [2020-10-09 13:17:10,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:17:10" (1/1) ... [2020-10-09 13:17:10,441 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:17:10" (1/1) ... [2020-10-09 13:17:10,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:17:10" (1/1) ... [2020-10-09 13:17:10,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:17:10" (1/1) ... [2020-10-09 13:17:10,460 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-09 13:17:10,461 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-09 13:17:10,461 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-09 13:17:10,461 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-09 13:17:10,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:17:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-09 13:17:10,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-09 13:17:10,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-09 13:17:10,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-09 13:17:10,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-09 13:17:10,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-09 13:17:10,556 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-10-09 13:17:10,557 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-10-09 13:17:10,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-09 13:17:10,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-09 13:17:10,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-09 13:17:10,561 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-09 13:17:11,186 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-09 13:17:11,186 INFO L298 CfgBuilder]: Removed 20 assume(true) statements. [2020-10-09 13:17:11,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 01:17:11 BoogieIcfgContainer [2020-10-09 13:17:11,188 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-09 13:17:11,189 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-09 13:17:11,190 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-09 13:17:11,193 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-09 13:17:11,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.10 01:17:09" (1/3) ... [2020-10-09 13:17:11,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6946c9d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 01:17:11, skipping insertion in model container [2020-10-09 13:17:11,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 01:17:10" (2/3) ... [2020-10-09 13:17:11,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6946c9d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 01:17:11, skipping insertion in model container [2020-10-09 13:17:11,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 01:17:11" (3/3) ... [2020-10-09 13:17:11,197 INFO L111 eAbstractionObserver]: Analyzing ICFG race-2_2-container_of.i [2020-10-09 13:17:11,210 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-09 13:17:11,211 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-09 13:17:11,219 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2020-10-09 13:17:11,220 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-09 13:17:11,253 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,253 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,254 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,254 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,254 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,254 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,254 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,254 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,255 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,255 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,255 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,255 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,255 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,256 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,256 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,256 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,256 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,256 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,257 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,257 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,257 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,257 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,257 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,258 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,258 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,258 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,258 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,259 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,259 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,259 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,259 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,259 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,260 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,260 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,260 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,260 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,260 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,260 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,261 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,261 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,261 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,261 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,261 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,262 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,262 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,262 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,262 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,262 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,263 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,263 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,263 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,263 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,264 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,264 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,264 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,264 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,264 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,265 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,270 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,271 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,271 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,273 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,273 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,273 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,274 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,274 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,274 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,274 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,275 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,283 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,283 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,283 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,283 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,284 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,284 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,284 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,284 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,284 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,284 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,284 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 13:17:11,324 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-09 13:17:11,350 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 13:17:11,350 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-09 13:17:11,351 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 13:17:11,351 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 13:17:11,351 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 13:17:11,351 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 13:17:11,351 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 13:17:11,351 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 13:17:11,368 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-09 13:17:11,371 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 131 transitions, 284 flow [2020-10-09 13:17:11,374 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 131 transitions, 284 flow [2020-10-09 13:17:11,376 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 129 places, 131 transitions, 284 flow [2020-10-09 13:17:11,441 INFO L129 PetriNetUnfolder]: 9/169 cut-off events. [2020-10-09 13:17:11,442 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-09 13:17:11,447 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-10-09 13:17:11,452 INFO L117 LiptonReduction]: Number of co-enabled transitions 2200 [2020-10-09 13:17:12,085 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:12,117 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:12,121 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:12,135 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:12,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-10-09 13:17:12,137 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2020-10-09 13:17:12,173 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:12,202 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:12,209 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:12,229 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:12,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-10-09 13:17:12,231 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2020-10-09 13:17:12,247 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:12,273 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:12,279 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:12,302 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:12,304 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:12,304 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:100, output treesize:102 [2020-10-09 13:17:14,403 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:14,455 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:14,461 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:14,487 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:14,489 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:14,489 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-09 13:17:14,525 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:14,560 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:14,566 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:14,591 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:14,593 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:14,594 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-09 13:17:16,833 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:16,858 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:16,863 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:16,879 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:16,881 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:16,882 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-09 13:17:16,902 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:16,922 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:16,930 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:16,950 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:16,952 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:16,953 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-09 13:17:18,998 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:19,022 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:19,026 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:19,047 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:19,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-10-09 13:17:19,049 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-09 13:17:19,062 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:19,103 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:19,107 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:19,132 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:19,133 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:19,134 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-09 13:17:21,215 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:21,243 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:21,249 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:21,273 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:21,275 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:21,275 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-09 13:17:21,293 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:21,331 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:21,338 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:21,365 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:21,366 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:21,367 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-09 13:17:23,429 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:23,459 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:23,462 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:23,490 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:23,491 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:23,492 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:108 [2020-10-09 13:17:23,512 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:23,541 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:23,550 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:23,578 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:23,579 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:23,580 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:108, output treesize:110 [2020-10-09 13:17:26,079 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:26,120 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:26,125 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:26,149 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:26,150 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:26,151 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-09 13:17:26,165 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:26,202 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:26,206 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:26,226 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:26,227 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:26,228 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-09 13:17:28,483 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:28,518 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:28,524 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:28,557 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:28,558 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:28,558 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:126, output treesize:128 [2020-10-09 13:17:28,581 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:28,616 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:28,620 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:28,650 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:28,651 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:28,651 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:128, output treesize:130 [2020-10-09 13:17:31,096 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:31,115 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:31,119 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:31,136 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:31,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-10-09 13:17:31,138 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:74 [2020-10-09 13:17:31,166 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:31,202 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:31,206 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:31,232 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:31,233 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:31,234 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-09 13:17:31,256 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:31,282 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:31,287 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:31,309 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:31,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-10-09 13:17:31,311 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-09 13:17:33,324 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:33,353 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:33,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-10-09 13:17:33,383 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:33,384 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:33,384 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:122 [2020-10-09 13:17:33,396 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:33,420 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:33,425 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:33,446 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:33,447 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:33,448 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-09 13:17:35,472 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:35,499 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:35,503 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:35,528 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:35,529 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:35,530 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:122, output treesize:124 [2020-10-09 13:17:35,547 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:35,575 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:35,584 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:35,609 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:35,610 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:35,610 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:122, output treesize:124 [2020-10-09 13:17:37,831 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:37,902 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:37,906 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:37,969 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:37,970 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:37,970 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:124, output treesize:126 [2020-10-09 13:17:37,985 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:38,041 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:38,045 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:38,096 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:38,097 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:38,098 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:126, output treesize:128 [2020-10-09 13:17:40,647 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2020-10-09 13:17:40,666 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:40,782 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-10-09 13:17:40,783 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:40,788 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:40,915 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-10-09 13:17:40,916 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:40,916 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-10-09 13:17:40,917 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:148, output treesize:160 [2020-10-09 13:17:41,089 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:41,130 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:41,135 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:41,170 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:41,171 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:41,172 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:124, output treesize:126 [2020-10-09 13:17:41,195 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:41,233 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:41,237 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:41,276 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:41,277 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:41,277 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:124, output treesize:126 [2020-10-09 13:17:43,749 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:43,813 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:43,818 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:43,868 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:43,869 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:43,870 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:136, output treesize:138 [2020-10-09 13:17:43,889 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:43,944 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:43,948 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:43,997 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 13:17:43,998 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 13:17:43,999 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:136, output treesize:138 [2020-10-09 13:17:46,216 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2020-10-09 13:17:46,573 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-10-09 13:17:46,691 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-10-09 13:17:47,245 WARN L193 SmtUtils]: Spent 518.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-10-09 13:17:47,642 WARN L193 SmtUtils]: Spent 393.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-10-09 13:17:47,876 WARN L193 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-10-09 13:17:48,106 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-10-09 13:17:48,298 INFO L132 LiptonReduction]: Checked pairs total: 4067 [2020-10-09 13:17:48,298 INFO L134 LiptonReduction]: Total number of compositions: 138 [2020-10-09 13:17:48,320 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 32 transitions, 86 flow [2020-10-09 13:17:48,348 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 190 states. [2020-10-09 13:17:48,350 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states. [2020-10-09 13:17:48,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-10-09 13:17:48,357 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:17:48,358 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-10-09 13:17:48,358 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:17:48,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:17:48,364 INFO L82 PathProgramCache]: Analyzing trace with hash 14364445, now seen corresponding path program 1 times [2020-10-09 13:17:48,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:17:48,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305562042] [2020-10-09 13:17:48,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:17:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:17:48,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 13:17:48,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305562042] [2020-10-09 13:17:48,817 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:17:48,817 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-09 13:17:48,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364960756] [2020-10-09 13:17:48,822 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 13:17:48,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:17:48,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 13:17:48,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 13:17:48,843 INFO L87 Difference]: Start difference. First operand 190 states. Second operand 3 states. [2020-10-09 13:17:48,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:17:48,979 INFO L93 Difference]: Finished difference Result 248 states and 560 transitions. [2020-10-09 13:17:48,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 13:17:48,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-10-09 13:17:48,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:17:48,997 INFO L225 Difference]: With dead ends: 248 [2020-10-09 13:17:48,997 INFO L226 Difference]: Without dead ends: 230 [2020-10-09 13:17:48,999 INFO L673 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-10-09 13:17:49,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-10-09 13:17:49,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 200. [2020-10-09 13:17:49,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-10-09 13:17:49,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 444 transitions. [2020-10-09 13:17:49,063 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 444 transitions. Word has length 4 [2020-10-09 13:17:49,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:17:49,063 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 444 transitions. [2020-10-09 13:17:49,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 13:17:49,063 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 444 transitions. [2020-10-09 13:17:49,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-09 13:17:49,064 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:17:49,064 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-09 13:17:49,064 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-09 13:17:49,065 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:17:49,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:17:49,065 INFO L82 PathProgramCache]: Analyzing trace with hash 445298819, now seen corresponding path program 1 times [2020-10-09 13:17:49,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:17:49,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119254669] [2020-10-09 13:17:49,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:17:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:17:49,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 13:17:49,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119254669] [2020-10-09 13:17:49,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:17:49,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-09 13:17:49,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327927626] [2020-10-09 13:17:49,144 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 13:17:49,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:17:49,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 13:17:49,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 13:17:49,146 INFO L87 Difference]: Start difference. First operand 200 states and 444 transitions. Second operand 3 states. [2020-10-09 13:17:49,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:17:49,255 INFO L93 Difference]: Finished difference Result 243 states and 536 transitions. [2020-10-09 13:17:49,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 13:17:49,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-09 13:17:49,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:17:49,258 INFO L225 Difference]: With dead ends: 243 [2020-10-09 13:17:49,258 INFO L226 Difference]: Without dead ends: 236 [2020-10-09 13:17:49,259 INFO L673 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-10-09 13:17:49,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2020-10-09 13:17:49,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 221. [2020-10-09 13:17:49,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2020-10-09 13:17:49,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 505 transitions. [2020-10-09 13:17:49,280 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 505 transitions. Word has length 5 [2020-10-09 13:17:49,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:17:49,281 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 505 transitions. [2020-10-09 13:17:49,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 13:17:49,281 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 505 transitions. [2020-10-09 13:17:49,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-09 13:17:49,282 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:17:49,282 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:17:49,283 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-09 13:17:49,283 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:17:49,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:17:49,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1770707455, now seen corresponding path program 1 times [2020-10-09 13:17:49,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:17:49,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452254498] [2020-10-09 13:17:49,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:17:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:17:49,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 13:17:49,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452254498] [2020-10-09 13:17:49,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:17:49,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-09 13:17:49,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421244457] [2020-10-09 13:17:49,342 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 13:17:49,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:17:49,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 13:17:49,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 13:17:49,343 INFO L87 Difference]: Start difference. First operand 221 states and 505 transitions. Second operand 3 states. [2020-10-09 13:17:49,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:17:49,356 INFO L93 Difference]: Finished difference Result 86 states and 167 transitions. [2020-10-09 13:17:49,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 13:17:49,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-09 13:17:49,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:17:49,358 INFO L225 Difference]: With dead ends: 86 [2020-10-09 13:17:49,358 INFO L226 Difference]: Without dead ends: 86 [2020-10-09 13:17:49,359 INFO L673 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-10-09 13:17:49,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-10-09 13:17:49,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2020-10-09 13:17:49,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-10-09 13:17:49,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 167 transitions. [2020-10-09 13:17:49,365 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 167 transitions. Word has length 9 [2020-10-09 13:17:49,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:17:49,365 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 167 transitions. [2020-10-09 13:17:49,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 13:17:49,365 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 167 transitions. [2020-10-09 13:17:49,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-09 13:17:49,367 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:17:49,367 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:17:49,367 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-09 13:17:49,367 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:17:49,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:17:49,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1268591532, now seen corresponding path program 1 times [2020-10-09 13:17:49,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:17:49,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568046448] [2020-10-09 13:17:49,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:17:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:17:49,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 13:17:49,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568046448] [2020-10-09 13:17:49,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:17:49,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-09 13:17:49,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345571142] [2020-10-09 13:17:49,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-09 13:17:49,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:17:49,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-09 13:17:49,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-10-09 13:17:49,648 INFO L87 Difference]: Start difference. First operand 86 states and 167 transitions. Second operand 13 states. [2020-10-09 13:17:50,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:17:50,638 INFO L93 Difference]: Finished difference Result 86 states and 166 transitions. [2020-10-09 13:17:50,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-09 13:17:50,639 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2020-10-09 13:17:50,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:17:50,640 INFO L225 Difference]: With dead ends: 86 [2020-10-09 13:17:50,640 INFO L226 Difference]: Without dead ends: 74 [2020-10-09 13:17:50,641 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=237, Invalid=465, Unknown=0, NotChecked=0, Total=702 [2020-10-09 13:17:50,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-10-09 13:17:50,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-10-09 13:17:50,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-09 13:17:50,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 145 transitions. [2020-10-09 13:17:50,646 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 145 transitions. Word has length 18 [2020-10-09 13:17:50,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:17:50,647 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 145 transitions. [2020-10-09 13:17:50,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-09 13:17:50,647 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 145 transitions. [2020-10-09 13:17:50,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-09 13:17:50,648 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:17:50,648 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:17:50,648 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-09 13:17:50,649 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:17:50,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:17:50,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1297219722, now seen corresponding path program 1 times [2020-10-09 13:17:50,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:17:50,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321645958] [2020-10-09 13:17:50,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:17:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:17:50,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 13:17:50,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321645958] [2020-10-09 13:17:50,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:17:50,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-09 13:17:50,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678205310] [2020-10-09 13:17:50,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-09 13:17:50,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:17:50,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-09 13:17:50,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-09 13:17:50,981 INFO L87 Difference]: Start difference. First operand 74 states and 145 transitions. Second operand 8 states. [2020-10-09 13:17:51,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:17:51,264 INFO L93 Difference]: Finished difference Result 117 states and 209 transitions. [2020-10-09 13:17:51,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-09 13:17:51,265 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-10-09 13:17:51,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:17:51,267 INFO L225 Difference]: With dead ends: 117 [2020-10-09 13:17:51,267 INFO L226 Difference]: Without dead ends: 117 [2020-10-09 13:17:51,267 INFO L673 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-10-09 13:17:51,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-10-09 13:17:51,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 94. [2020-10-09 13:17:51,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-10-09 13:17:51,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 175 transitions. [2020-10-09 13:17:51,274 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 175 transitions. Word has length 18 [2020-10-09 13:17:51,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:17:51,274 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 175 transitions. [2020-10-09 13:17:51,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-09 13:17:51,274 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 175 transitions. [2020-10-09 13:17:51,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-09 13:17:51,275 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:17:51,276 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:17:51,276 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-09 13:17:51,276 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:17:51,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:17:51,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1297219740, now seen corresponding path program 1 times [2020-10-09 13:17:51,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:17:51,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779518162] [2020-10-09 13:17:51,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:17:51,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:17:52,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 13:17:52,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779518162] [2020-10-09 13:17:52,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:17:52,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-09 13:17:52,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342579000] [2020-10-09 13:17:52,188 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 13:17:52,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:17:52,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 13:17:52,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:17:52,189 INFO L87 Difference]: Start difference. First operand 94 states and 175 transitions. Second operand 14 states. [2020-10-09 13:17:53,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:17:53,204 INFO L93 Difference]: Finished difference Result 153 states and 271 transitions. [2020-10-09 13:17:53,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-09 13:17:53,205 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-10-09 13:17:53,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:17:53,206 INFO L225 Difference]: With dead ends: 153 [2020-10-09 13:17:53,207 INFO L226 Difference]: Without dead ends: 145 [2020-10-09 13:17:53,207 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2020-10-09 13:17:53,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-10-09 13:17:53,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 100. [2020-10-09 13:17:53,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-10-09 13:17:53,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 185 transitions. [2020-10-09 13:17:53,212 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 185 transitions. Word has length 18 [2020-10-09 13:17:53,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:17:53,213 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 185 transitions. [2020-10-09 13:17:53,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 13:17:53,213 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 185 transitions. [2020-10-09 13:17:53,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-09 13:17:53,216 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:17:53,216 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:17:53,216 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-09 13:17:53,216 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:17:53,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:17:53,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1046484834, now seen corresponding path program 2 times [2020-10-09 13:17:53,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:17:53,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939308364] [2020-10-09 13:17:53,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:17:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:17:54,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 13:17:54,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939308364] [2020-10-09 13:17:54,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:17:54,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-09 13:17:54,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275477795] [2020-10-09 13:17:54,109 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 13:17:54,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:17:54,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 13:17:54,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:17:54,110 INFO L87 Difference]: Start difference. First operand 100 states and 185 transitions. Second operand 14 states. [2020-10-09 13:17:55,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:17:55,214 INFO L93 Difference]: Finished difference Result 155 states and 274 transitions. [2020-10-09 13:17:55,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-09 13:17:55,215 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-10-09 13:17:55,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:17:55,216 INFO L225 Difference]: With dead ends: 155 [2020-10-09 13:17:55,216 INFO L226 Difference]: Without dead ends: 143 [2020-10-09 13:17:55,217 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2020-10-09 13:17:55,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-10-09 13:17:55,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 98. [2020-10-09 13:17:55,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-10-09 13:17:55,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 181 transitions. [2020-10-09 13:17:55,222 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 181 transitions. Word has length 18 [2020-10-09 13:17:55,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:17:55,222 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 181 transitions. [2020-10-09 13:17:55,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 13:17:55,222 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 181 transitions. [2020-10-09 13:17:55,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-09 13:17:55,226 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:17:55,227 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:17:55,227 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-09 13:17:55,227 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:17:55,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:17:55,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1347055900, now seen corresponding path program 3 times [2020-10-09 13:17:55,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:17:55,228 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80712445] [2020-10-09 13:17:55,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:17:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:17:56,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 13:17:56,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80712445] [2020-10-09 13:17:56,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:17:56,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-09 13:17:56,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715886476] [2020-10-09 13:17:56,084 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 13:17:56,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:17:56,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 13:17:56,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:17:56,084 INFO L87 Difference]: Start difference. First operand 98 states and 181 transitions. Second operand 14 states. [2020-10-09 13:17:57,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:17:57,067 INFO L93 Difference]: Finished difference Result 139 states and 253 transitions. [2020-10-09 13:17:57,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-09 13:17:57,068 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-10-09 13:17:57,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:17:57,070 INFO L225 Difference]: With dead ends: 139 [2020-10-09 13:17:57,070 INFO L226 Difference]: Without dead ends: 123 [2020-10-09 13:17:57,071 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2020-10-09 13:17:57,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-10-09 13:17:57,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 96. [2020-10-09 13:17:57,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-10-09 13:17:57,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 177 transitions. [2020-10-09 13:17:57,075 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 177 transitions. Word has length 18 [2020-10-09 13:17:57,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:17:57,075 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 177 transitions. [2020-10-09 13:17:57,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 13:17:57,076 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 177 transitions. [2020-10-09 13:17:57,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-09 13:17:57,076 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:17:57,076 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:17:57,077 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-09 13:17:57,077 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:17:57,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:17:57,077 INFO L82 PathProgramCache]: Analyzing trace with hash 646402192, now seen corresponding path program 2 times [2020-10-09 13:17:57,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:17:57,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835708268] [2020-10-09 13:17:57,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:17:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:17:57,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 13:17:57,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835708268] [2020-10-09 13:17:57,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:17:57,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-09 13:17:57,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929664404] [2020-10-09 13:17:57,355 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-09 13:17:57,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:17:57,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-09 13:17:57,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-09 13:17:57,356 INFO L87 Difference]: Start difference. First operand 96 states and 177 transitions. Second operand 8 states. [2020-10-09 13:17:57,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:17:57,699 INFO L93 Difference]: Finished difference Result 119 states and 212 transitions. [2020-10-09 13:17:57,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-09 13:17:57,700 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-10-09 13:17:57,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:17:57,701 INFO L225 Difference]: With dead ends: 119 [2020-10-09 13:17:57,702 INFO L226 Difference]: Without dead ends: 119 [2020-10-09 13:17:57,702 INFO L673 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-10-09 13:17:57,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-10-09 13:17:57,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 96. [2020-10-09 13:17:57,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-10-09 13:17:57,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 177 transitions. [2020-10-09 13:17:57,706 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 177 transitions. Word has length 18 [2020-10-09 13:17:57,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:17:57,707 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 177 transitions. [2020-10-09 13:17:57,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-09 13:17:57,707 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 177 transitions. [2020-10-09 13:17:57,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-09 13:17:57,708 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:17:57,708 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:17:57,708 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-09 13:17:57,708 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:17:57,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:17:57,708 INFO L82 PathProgramCache]: Analyzing trace with hash 646402210, now seen corresponding path program 4 times [2020-10-09 13:17:57,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:17:57,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230473476] [2020-10-09 13:17:57,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:17:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:17:58,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 13:17:58,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230473476] [2020-10-09 13:17:58,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:17:58,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-09 13:17:58,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152311225] [2020-10-09 13:17:58,432 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 13:17:58,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:17:58,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 13:17:58,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:17:58,433 INFO L87 Difference]: Start difference. First operand 96 states and 177 transitions. Second operand 14 states. [2020-10-09 13:17:59,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:17:59,407 INFO L93 Difference]: Finished difference Result 135 states and 244 transitions. [2020-10-09 13:17:59,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-09 13:17:59,407 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-10-09 13:17:59,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:17:59,408 INFO L225 Difference]: With dead ends: 135 [2020-10-09 13:17:59,408 INFO L226 Difference]: Without dead ends: 113 [2020-10-09 13:17:59,409 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2020-10-09 13:17:59,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-10-09 13:17:59,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 92. [2020-10-09 13:17:59,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-10-09 13:17:59,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 171 transitions. [2020-10-09 13:17:59,413 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 171 transitions. Word has length 18 [2020-10-09 13:17:59,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:17:59,414 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 171 transitions. [2020-10-09 13:17:59,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 13:17:59,414 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 171 transitions. [2020-10-09 13:17:59,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-09 13:17:59,414 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:17:59,415 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:17:59,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-09 13:17:59,415 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:17:59,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:17:59,415 INFO L82 PathProgramCache]: Analyzing trace with hash -318962108, now seen corresponding path program 5 times [2020-10-09 13:17:59,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:17:59,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543313623] [2020-10-09 13:17:59,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:17:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:00,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 13:18:00,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543313623] [2020-10-09 13:18:00,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:00,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-09 13:18:00,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596173911] [2020-10-09 13:18:00,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 13:18:00,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:00,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 13:18:00,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:18:00,196 INFO L87 Difference]: Start difference. First operand 92 states and 171 transitions. Second operand 14 states. [2020-10-09 13:18:01,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:01,244 INFO L93 Difference]: Finished difference Result 152 states and 280 transitions. [2020-10-09 13:18:01,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-09 13:18:01,244 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-10-09 13:18:01,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:01,245 INFO L225 Difference]: With dead ends: 152 [2020-10-09 13:18:01,245 INFO L226 Difference]: Without dead ends: 144 [2020-10-09 13:18:01,246 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2020-10-09 13:18:01,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-10-09 13:18:01,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 100. [2020-10-09 13:18:01,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-10-09 13:18:01,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 187 transitions. [2020-10-09 13:18:01,250 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 187 transitions. Word has length 18 [2020-10-09 13:18:01,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:01,250 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 187 transitions. [2020-10-09 13:18:01,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 13:18:01,251 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 187 transitions. [2020-10-09 13:18:01,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-09 13:18:01,251 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:01,251 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:18:01,251 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-09 13:18:01,252 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:18:01,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:01,253 INFO L82 PathProgramCache]: Analyzing trace with hash -569697014, now seen corresponding path program 6 times [2020-10-09 13:18:01,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:01,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76852016] [2020-10-09 13:18:01,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:02,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 13:18:02,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76852016] [2020-10-09 13:18:02,145 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:02,145 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-09 13:18:02,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102043987] [2020-10-09 13:18:02,145 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 13:18:02,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:02,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 13:18:02,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:18:02,146 INFO L87 Difference]: Start difference. First operand 100 states and 187 transitions. Second operand 14 states. [2020-10-09 13:18:03,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:03,162 INFO L93 Difference]: Finished difference Result 154 states and 283 transitions. [2020-10-09 13:18:03,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-09 13:18:03,163 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-10-09 13:18:03,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:03,164 INFO L225 Difference]: With dead ends: 154 [2020-10-09 13:18:03,164 INFO L226 Difference]: Without dead ends: 142 [2020-10-09 13:18:03,165 INFO L673 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-10-09 13:18:03,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-10-09 13:18:03,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 98. [2020-10-09 13:18:03,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-10-09 13:18:03,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 183 transitions. [2020-10-09 13:18:03,169 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 183 transitions. Word has length 18 [2020-10-09 13:18:03,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:03,169 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 183 transitions. [2020-10-09 13:18:03,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 13:18:03,169 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 183 transitions. [2020-10-09 13:18:03,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-09 13:18:03,170 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:03,170 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:18:03,170 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-09 13:18:03,171 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:18:03,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:03,171 INFO L82 PathProgramCache]: Analyzing trace with hash -269125948, now seen corresponding path program 7 times [2020-10-09 13:18:03,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:03,171 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244128043] [2020-10-09 13:18:03,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:03,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 13:18:03,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244128043] [2020-10-09 13:18:03,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:03,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-09 13:18:03,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400052372] [2020-10-09 13:18:03,940 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 13:18:03,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:03,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 13:18:03,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:18:03,941 INFO L87 Difference]: Start difference. First operand 98 states and 183 transitions. Second operand 14 states. [2020-10-09 13:18:04,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:04,913 INFO L93 Difference]: Finished difference Result 149 states and 278 transitions. [2020-10-09 13:18:04,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-09 13:18:04,914 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-10-09 13:18:04,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:04,915 INFO L225 Difference]: With dead ends: 149 [2020-10-09 13:18:04,916 INFO L226 Difference]: Without dead ends: 133 [2020-10-09 13:18:04,916 INFO L673 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-10-09 13:18:04,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-10-09 13:18:04,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 96. [2020-10-09 13:18:04,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-10-09 13:18:04,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 179 transitions. [2020-10-09 13:18:04,920 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 179 transitions. Word has length 18 [2020-10-09 13:18:04,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:04,921 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 179 transitions. [2020-10-09 13:18:04,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 13:18:04,921 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 179 transitions. [2020-10-09 13:18:04,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-09 13:18:04,921 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:04,921 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:18:04,922 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-09 13:18:04,922 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:18:04,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:04,922 INFO L82 PathProgramCache]: Analyzing trace with hash -969779638, now seen corresponding path program 8 times [2020-10-09 13:18:04,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:04,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94294549] [2020-10-09 13:18:04,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:05,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 13:18:05,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94294549] [2020-10-09 13:18:05,677 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:05,677 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-09 13:18:05,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433373945] [2020-10-09 13:18:05,678 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 13:18:05,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:05,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 13:18:05,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-09 13:18:05,678 INFO L87 Difference]: Start difference. First operand 96 states and 179 transitions. Second operand 14 states. [2020-10-09 13:18:06,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:06,665 INFO L93 Difference]: Finished difference Result 167 states and 302 transitions. [2020-10-09 13:18:06,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-09 13:18:06,666 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-10-09 13:18:06,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:06,667 INFO L225 Difference]: With dead ends: 167 [2020-10-09 13:18:06,667 INFO L226 Difference]: Without dead ends: 147 [2020-10-09 13:18:06,668 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-10-09 13:18:06,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-10-09 13:18:06,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 94. [2020-10-09 13:18:06,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-10-09 13:18:06,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 175 transitions. [2020-10-09 13:18:06,672 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 175 transitions. Word has length 18 [2020-10-09 13:18:06,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:06,672 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 175 transitions. [2020-10-09 13:18:06,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 13:18:06,673 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 175 transitions. [2020-10-09 13:18:06,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-09 13:18:06,673 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:06,673 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:18:06,673 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-09 13:18:06,674 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:18:06,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:06,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1049440908, now seen corresponding path program 3 times [2020-10-09 13:18:06,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:06,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151791914] [2020-10-09 13:18:06,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 13:18:07,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 13:18:07,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151791914] [2020-10-09 13:18:07,048 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 13:18:07,048 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-09 13:18:07,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876826762] [2020-10-09 13:18:07,048 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-09 13:18:07,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 13:18:07,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-09 13:18:07,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-10-09 13:18:07,049 INFO L87 Difference]: Start difference. First operand 94 states and 175 transitions. Second operand 11 states. [2020-10-09 13:18:07,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 13:18:07,615 INFO L93 Difference]: Finished difference Result 206 states and 364 transitions. [2020-10-09 13:18:07,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-09 13:18:07,616 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2020-10-09 13:18:07,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 13:18:07,619 INFO L225 Difference]: With dead ends: 206 [2020-10-09 13:18:07,619 INFO L226 Difference]: Without dead ends: 206 [2020-10-09 13:18:07,620 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2020-10-09 13:18:07,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-10-09 13:18:07,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 116. [2020-10-09 13:18:07,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-10-09 13:18:07,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 229 transitions. [2020-10-09 13:18:07,625 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 229 transitions. Word has length 18 [2020-10-09 13:18:07,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 13:18:07,625 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 229 transitions. [2020-10-09 13:18:07,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-09 13:18:07,626 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 229 transitions. [2020-10-09 13:18:07,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-09 13:18:07,626 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 13:18:07,626 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 13:18:07,626 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-09 13:18:07,627 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 13:18:07,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 13:18:07,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1049440926, now seen corresponding path program 9 times [2020-10-09 13:18:07,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 13:18:07,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957237633] [2020-10-09 13:18:07,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 13:18:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 13:18:07,658 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 13:18:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 13:18:07,699 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 13:18:07,761 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-09 13:18:07,764 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 13:18:07,764 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-09 13:18:07,766 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-09 13:18:07,778 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [392] [392] L1682-->L1739: Formula: (and (not (= ULTIMATE.start_ldv_assert_~expression_Out838197694 0)) (= ULTIMATE.start_ldv_assert_~expression_Out838197694 |ULTIMATE.start_ldv_assert_#in~expression_In838197694|)) InVars {ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_In838197694|} OutVars{ULTIMATE.start_main_#t~mem40=|ULTIMATE.start_main_#t~mem40_Out838197694|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_In838197694|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out838197694} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem40, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2020-10-09 13:18:07,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.10 01:18:07 BasicIcfg [2020-10-09 13:18:07,882 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-09 13:18:07,884 INFO L168 Benchmark]: Toolchain (without parser) took 58855.44 ms. Allocated memory was 249.0 MB in the beginning and 616.0 MB in the end (delta: 367.0 MB). Free memory was 199.1 MB in the beginning and 538.2 MB in the end (delta: -339.1 MB). Peak memory consumption was 27.9 MB. Max. memory is 14.2 GB. [2020-10-09 13:18:07,884 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 249.0 MB. Free memory is still 222.9 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-09 13:18:07,885 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1301.90 ms. Allocated memory was 249.0 MB in the beginning and 352.8 MB in the end (delta: 103.8 MB). Free memory was 199.1 MB in the beginning and 319.0 MB in the end (delta: -119.9 MB). Peak memory consumption was 106.8 MB. Max. memory is 14.2 GB. [2020-10-09 13:18:07,885 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.21 ms. Allocated memory is still 352.8 MB. Free memory was 319.0 MB in the beginning and 315.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. [2020-10-09 13:18:07,886 INFO L168 Benchmark]: Boogie Preprocessor took 52.51 ms. Allocated memory is still 352.8 MB. Free memory was 315.6 MB in the beginning and 312.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. [2020-10-09 13:18:07,886 INFO L168 Benchmark]: RCFGBuilder took 727.19 ms. Allocated memory is still 352.8 MB. Free memory was 312.1 MB in the beginning and 268.3 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 14.2 GB. [2020-10-09 13:18:07,889 INFO L168 Benchmark]: TraceAbstraction took 56692.69 ms. Allocated memory was 352.8 MB in the beginning and 616.0 MB in the end (delta: 263.2 MB). Free memory was 264.9 MB in the beginning and 538.2 MB in the end (delta: -273.4 MB). There was no memory consumed. Max. memory is 14.2 GB. [2020-10-09 13:18:07,892 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.23 ms. Allocated memory is still 249.0 MB. Free memory is still 222.9 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 1301.90 ms. Allocated memory was 249.0 MB in the beginning and 352.8 MB in the end (delta: 103.8 MB). Free memory was 199.1 MB in the beginning and 319.0 MB in the end (delta: -119.9 MB). Peak memory consumption was 106.8 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 76.21 ms. Allocated memory is still 352.8 MB. Free memory was 319.0 MB in the beginning and 315.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 52.51 ms. Allocated memory is still 352.8 MB. Free memory was 315.6 MB in the beginning and 312.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. * RCFGBuilder took 727.19 ms. Allocated memory is still 352.8 MB. Free memory was 312.1 MB in the beginning and 268.3 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 14.2 GB. * TraceAbstraction took 56692.69 ms. Allocated memory was 352.8 MB in the beginning and 616.0 MB in the end (delta: 263.2 MB). Free memory was 264.9 MB in the beginning and 538.2 MB in the end (delta: -273.4 MB). There was no memory consumed. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1421 VarBasedMoverChecksPositive, 57 VarBasedMoverChecksNegative, 1 SemBasedMoverChecksPositive, 42 SemBasedMoverChecksNegative, 14 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 31.2s, 39 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 36.9s, 129 PlacesBefore, 34 PlacesAfterwards, 131 TransitionsBefore, 32 TransitionsAfterwards, 2200 CoEnabledTransitionPairs, 6 FixpointIterations, 63 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 16 ConcurrentYvCompositions, 4 ChoiceCompositions, 138 TotalNumberOfCompositions, 4067 MoverChecksTotal - 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={3:24}, t1={5:0}, t2={6: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={3:24}, arg={3:24}, arg={3:24}, data={3:0}, dev={3:24}, t1={5:0}, t2={6:0}] [L1700] 1 data->shared.b VAL [__mptr={3:24}, arg={3:24}, arg={3:24}, data={3:0}, data->shared.b=0, dev={3:24}, t1={5:0}, t2={6:0}] [L1712] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [__mptr={3:24}, arg={3:24}, arg={3:24}, data={3:0}, data->shared.b=0, dev={3:24}, t1={5:0}, t2={6: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={3:24}, arg={3:24}, arg={3:24}, data={3:0}, data->shared.b=0, dev={3:24}, t1={5:0}, t2={6:0}] [L1700] EXPR 2 data->shared.b VAL [__mptr={3:24}, arg={3:24}, arg={3:24}, data={3:0}, data->shared.b=0, dev={3:24}, t1={5:0}, t2={6: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={3:24}, arg={3:24}, arg={3:24}, data={3:0}, dev={3:24}, t1={5:0}, t2={6:0}] [L1736] COND TRUE 0 probe_ret==0 [L1719] 0 void *status; [L1720] 0 \read(t1) VAL [\result={0:0}, __mptr={3:24}, arg={3:24}, arg={3:24}, data={3:0}, dev={3:24}, t1={5:0}, t2={6:0}] [L1720] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, __mptr={3:24}, arg={3:24}, arg={3:24}, data={3:0}, dev={3:24}, t1={5:0}, t2={6:0}] [L1721] 0 \read(t2) VAL [\result={0:0}, __mptr={3:24}, arg={3:24}, arg={3:24}, data={3:0}, dev={3:24}, t1={5:0}, t2={6:0}] [L1721] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\result={0:0}, __mptr={3:24}, arg={3:24}, arg={3:24}, data={3:0}, dev={3:24}, t1={5:0}, t2={6: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={3:24}, arg={3:24}, arg={3:24}, data={3:0}, dev={3:24}, t1={5:0}, t2={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 111 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 56.4s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 36.9s, HoareTripleCheckerStatistics: 269 SDtfs, 583 SDslu, 947 SDs, 0 SdLazy, 3861 SolverSat, 396 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 226 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 10.4s 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.5s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 219 ConstructedInterpolants, 0 QuantifiedInterpolants, 90647 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...