/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/automizer/concurrent/VMCAI2021_PN.epf -i ../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-09 18:31:36,149 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-09 18:31:36,151 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-09 18:31:36,189 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-09 18:31:36,190 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-09 18:31:36,198 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-09 18:31:36,199 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-09 18:31:36,203 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-09 18:31:36,205 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-09 18:31:36,208 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-09 18:31:36,209 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-09 18:31:36,211 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-09 18:31:36,211 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-09 18:31:36,214 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-09 18:31:36,216 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-09 18:31:36,217 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-09 18:31:36,219 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-09 18:31:36,220 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-09 18:31:36,222 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-09 18:31:36,230 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-09 18:31:36,232 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-09 18:31:36,233 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-09 18:31:36,234 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-09 18:31:36,234 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-09 18:31:36,245 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-09 18:31:36,245 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-09 18:31:36,246 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-09 18:31:36,246 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-09 18:31:36,247 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-09 18:31:36,250 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-09 18:31:36,250 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-09 18:31:36,251 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-09 18:31:36,251 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-09 18:31:36,252 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-09 18:31:36,253 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-09 18:31:36,253 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-09 18:31:36,254 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-09 18:31:36,254 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-09 18:31:36,254 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-09 18:31:36,255 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-09 18:31:36,256 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-09 18:31:36,257 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf [2020-10-09 18:31:36,298 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-09 18:31:36,298 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-09 18:31:36,300 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-09 18:31:36,300 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-09 18:31:36,300 INFO L138 SettingsManager]: * Use SBE=true [2020-10-09 18:31:36,300 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-09 18:31:36,300 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-09 18:31:36,301 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-09 18:31:36,301 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-09 18:31:36,301 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-09 18:31:36,302 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-09 18:31:36,302 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-09 18:31:36,302 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-09 18:31:36,303 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-09 18:31:36,303 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-09 18:31:36,303 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-09 18:31:36,303 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-09 18:31:36,304 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-09 18:31:36,304 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-09 18:31:36,304 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-09 18:31:36,304 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-09 18:31:36,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-09 18:31:36,305 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-09 18:31:36,305 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-09 18:31:36,305 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-09 18:31:36,305 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-10-09 18:31:36,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-09 18:31:36,305 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-09 18:31:36,306 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-09 18:31:36,306 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-09 18:31:36,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-09 18:31:36,625 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-09 18:31:36,628 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-09 18:31:36,630 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-09 18:31:36,630 INFO L275 PluginConnector]: CDTParser initialized [2020-10-09 18:31:36,631 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2020-10-09 18:31:36,696 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a4c0fa61/561e18342d574688b8be43c9f308bedb/FLAG43bbdd242 [2020-10-09 18:31:37,308 INFO L306 CDTParser]: Found 1 translation units. [2020-10-09 18:31:37,309 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2020-10-09 18:31:37,338 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a4c0fa61/561e18342d574688b8be43c9f308bedb/FLAG43bbdd242 [2020-10-09 18:31:37,547 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a4c0fa61/561e18342d574688b8be43c9f308bedb [2020-10-09 18:31:37,556 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-09 18:31:37,558 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-09 18:31:37,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-09 18:31:37,560 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-09 18:31:37,563 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-09 18:31:37,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 06:31:37" (1/1) ... [2020-10-09 18:31:37,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a54700b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 06:31:37, skipping insertion in model container [2020-10-09 18:31:37,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 06:31:37" (1/1) ... [2020-10-09 18:31:37,575 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-09 18:31:37,646 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-09 18:31:38,434 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 18:31:38,444 INFO L203 MainTranslator]: Completed pre-run [2020-10-09 18:31:38,511 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 18:31:39,110 INFO L208 MainTranslator]: Completed translation [2020-10-09 18:31:39,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 06:31:39 WrapperNode [2020-10-09 18:31:39,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-09 18:31:39,114 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-09 18:31:39,114 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-09 18:31:39,114 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-09 18:31:39,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 06:31:39" (1/1) ... [2020-10-09 18:31:39,193 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 06:31:39" (1/1) ... [2020-10-09 18:31:39,259 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-09 18:31:39,260 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-09 18:31:39,260 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-09 18:31:39,260 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-09 18:31:39,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 06:31:39" (1/1) ... [2020-10-09 18:31:39,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 06:31:39" (1/1) ... [2020-10-09 18:31:39,278 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 06:31:39" (1/1) ... [2020-10-09 18:31:39,278 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 06:31:39" (1/1) ... [2020-10-09 18:31:39,292 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 06:31:39" (1/1) ... [2020-10-09 18:31:39,294 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 06:31:39" (1/1) ... [2020-10-09 18:31:39,300 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 06:31:39" (1/1) ... [2020-10-09 18:31:39,308 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-09 18:31:39,309 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-09 18:31:39,309 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-09 18:31:39,309 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-09 18:31:39,310 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 06:31:39" (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 18:31:39,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-09 18:31:39,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-09 18:31:39,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-09 18:31:39,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-09 18:31:39,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-09 18:31:39,393 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-10-09 18:31:39,393 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-10-09 18:31:39,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-09 18:31:39,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-09 18:31:39,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-09 18:31:39,397 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 18:31:40,134 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-09 18:31:40,134 INFO L298 CfgBuilder]: Removed 24 assume(true) statements. [2020-10-09 18:31:40,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 06:31:40 BoogieIcfgContainer [2020-10-09 18:31:40,136 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-09 18:31:40,150 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-09 18:31:40,153 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-09 18:31:40,158 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-09 18:31:40,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.10 06:31:37" (1/3) ... [2020-10-09 18:31:40,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f404137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 06:31:40, skipping insertion in model container [2020-10-09 18:31:40,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 06:31:39" (2/3) ... [2020-10-09 18:31:40,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f404137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 06:31:40, skipping insertion in model container [2020-10-09 18:31:40,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 06:31:40" (3/3) ... [2020-10-09 18:31:40,163 INFO L111 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2020-10-09 18:31:40,174 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-09 18:31:40,183 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-10-09 18:31:40,184 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-09 18:31:40,217 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,217 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,218 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,218 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,218 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,218 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,219 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,219 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,219 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,219 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,219 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,219 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,220 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,220 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,220 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,220 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,221 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,221 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,221 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,221 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,222 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,222 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,222 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,222 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,223 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,223 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,223 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,223 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,223 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,223 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,224 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,224 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,224 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,224 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,224 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,225 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,225 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,225 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,225 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,226 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,226 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,226 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,226 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,226 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,227 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,227 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,230 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,231 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,231 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,231 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,231 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,232 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,232 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,232 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,232 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,238 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,238 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,238 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,239 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,239 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,239 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,239 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,239 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,240 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 18:31:40,267 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-10-09 18:31:40,289 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 18:31:40,290 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 18:31:40,290 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 18:31:40,290 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 18:31:40,290 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 18:31:40,290 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 18:31:40,290 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 18:31:40,290 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 18:31:40,308 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 144 places, 148 transitions, 318 flow [2020-10-09 18:31:40,376 INFO L129 PetriNetUnfolder]: 11/186 cut-off events. [2020-10-09 18:31:40,376 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-09 18:31:40,382 INFO L80 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 186 events. 11/186 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 334 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 104. Up to 4 conditions per place. [2020-10-09 18:31:40,382 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 148 transitions, 318 flow [2020-10-09 18:31:40,390 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 137 transitions, 292 flow [2020-10-09 18:31:40,399 INFO L129 PetriNetUnfolder]: 1/33 cut-off events. [2020-10-09 18:31:40,399 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 18:31:40,400 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 18:31:40,401 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 18:31:40,401 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 18:31:40,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 18:31:40,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1713283788, now seen corresponding path program 1 times [2020-10-09 18:31:40,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 18:31:40,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [523756211] [2020-10-09 18:31:40,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-10-09 18:31:40,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 18:31:40,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-09 18:31:40,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 18:31:40,709 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-10-09 18:31:40,709 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:31:40,721 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:31:40,722 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:31:40,722 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2020-10-09 18:31:40,768 INFO L350 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2020-10-09 18:31:40,769 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2020-10-09 18:31:40,771 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:31:40,780 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:31:40,781 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:31:40,781 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2020-10-09 18:31:40,810 INFO L350 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2020-10-09 18:31:40,811 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2020-10-09 18:31:40,813 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:31:40,815 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:31:40,815 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:31:40,816 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2020-10-09 18:31:40,856 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 18:31:40,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 18:31:40,884 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:40,899 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 18:31:40,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [523756211] [2020-10-09 18:31:40,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 18:31:40,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 7 [2020-10-09 18:31:40,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049935890] [2020-10-09 18:31:40,913 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-09 18:31:40,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 18:31:40,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-09 18:31:40,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-09 18:31:42,587 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 148 [2020-10-09 18:31:42,590 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 137 transitions, 292 flow. Second operand 7 states. [2020-10-09 18:31:42,591 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 18:31:42,591 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 148 [2020-10-09 18:31:42,592 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 18:31:42,952 INFO L129 PetriNetUnfolder]: 132/488 cut-off events. [2020-10-09 18:31:42,952 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2020-10-09 18:31:42,955 INFO L80 FinitePrefix]: Finished finitePrefix Result has 772 conditions, 488 events. 132/488 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2501 event pairs, 128 based on Foata normal form. 14/489 useless extension candidates. Maximal degree in co-relation 606. Up to 260 conditions per place. [2020-10-09 18:31:42,960 INFO L132 encePairwiseOnDemand]: 132/148 looper letters, 30 selfloop transitions, 11 changer transitions 0/133 dead transitions. [2020-10-09 18:31:42,960 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 133 transitions, 366 flow [2020-10-09 18:31:42,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-09 18:31:42,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-09 18:31:42,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 973 transitions. [2020-10-09 18:31:42,986 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7304804804804805 [2020-10-09 18:31:42,986 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 973 transitions. [2020-10-09 18:31:42,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 973 transitions. [2020-10-09 18:31:42,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 18:31:42,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 973 transitions. [2020-10-09 18:31:42,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-09 18:31:43,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-09 18:31:43,010 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-09 18:31:43,012 INFO L185 Difference]: Start difference. First operand has 135 places, 137 transitions, 292 flow. Second operand 9 states and 973 transitions. [2020-10-09 18:31:43,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 133 transitions, 366 flow [2020-10-09 18:31:43,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 133 transitions, 354 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-09 18:31:43,024 INFO L241 Difference]: Finished difference. Result has 138 places, 133 transitions, 306 flow [2020-10-09 18:31:43,027 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=306, PETRI_PLACES=138, PETRI_TRANSITIONS=133} [2020-10-09 18:31:43,028 INFO L341 CegarLoopForPetriNet]: 135 programPoint places, 3 predicate places. [2020-10-09 18:31:43,028 INFO L481 AbstractCegarLoop]: Abstraction has has 138 places, 133 transitions, 306 flow [2020-10-09 18:31:43,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-09 18:31:43,029 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 18:31:43,029 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 18:31:43,241 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-09 18:31:43,242 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 18:31:43,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 18:31:43,242 INFO L82 PathProgramCache]: Analyzing trace with hash -251908973, now seen corresponding path program 1 times [2020-10-09 18:31:43,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 18:31:43,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1546427367] [2020-10-09 18:31:43,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-10-09 18:31:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 18:31:43,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-09 18:31:43,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 18:31:43,359 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-10-09 18:31:43,360 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:31:43,362 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:31:43,363 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:31:43,363 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2020-10-09 18:31:43,385 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2020-10-09 18:31:43,386 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:31:43,388 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:31:43,389 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:31:43,389 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2020-10-09 18:31:43,415 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 18:31:43,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 18:31:43,435 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:43,442 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 18:31:43,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1546427367] [2020-10-09 18:31:43,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 18:31:43,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2020-10-09 18:31:43,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908640086] [2020-10-09 18:31:43,445 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-09 18:31:43,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 18:31:43,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-09 18:31:43,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-09 18:31:44,559 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 148 [2020-10-09 18:31:44,560 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 133 transitions, 306 flow. Second operand 6 states. [2020-10-09 18:31:44,561 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 18:31:44,561 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 148 [2020-10-09 18:31:44,561 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 18:31:44,790 INFO L129 PetriNetUnfolder]: 132/478 cut-off events. [2020-10-09 18:31:44,790 INFO L130 PetriNetUnfolder]: For 46/52 co-relation queries the response was YES. [2020-10-09 18:31:44,793 INFO L80 FinitePrefix]: Finished finitePrefix Result has 816 conditions, 478 events. 132/478 cut-off events. For 46/52 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2355 event pairs, 32 based on Foata normal form. 3/471 useless extension candidates. Maximal degree in co-relation 684. Up to 168 conditions per place. [2020-10-09 18:31:44,799 INFO L132 encePairwiseOnDemand]: 135/148 looper letters, 39 selfloop transitions, 12 changer transitions 0/143 dead transitions. [2020-10-09 18:31:44,799 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 143 transitions, 434 flow [2020-10-09 18:31:44,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-09 18:31:44,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-09 18:31:44,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 988 transitions. [2020-10-09 18:31:44,804 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7417417417417418 [2020-10-09 18:31:44,830 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 988 transitions. [2020-10-09 18:31:44,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 988 transitions. [2020-10-09 18:31:44,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 18:31:44,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 988 transitions. [2020-10-09 18:31:44,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-09 18:31:44,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-09 18:31:44,838 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-09 18:31:44,838 INFO L185 Difference]: Start difference. First operand has 138 places, 133 transitions, 306 flow. Second operand 9 states and 988 transitions. [2020-10-09 18:31:44,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 143 transitions, 434 flow [2020-10-09 18:31:44,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 143 transitions, 418 flow, removed 0 selfloop flow, removed 7 redundant places. [2020-10-09 18:31:44,844 INFO L241 Difference]: Finished difference. Result has 139 places, 133 transitions, 327 flow [2020-10-09 18:31:44,844 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=327, PETRI_PLACES=139, PETRI_TRANSITIONS=133} [2020-10-09 18:31:44,845 INFO L341 CegarLoopForPetriNet]: 135 programPoint places, 4 predicate places. [2020-10-09 18:31:44,845 INFO L481 AbstractCegarLoop]: Abstraction has has 139 places, 133 transitions, 327 flow [2020-10-09 18:31:44,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-09 18:31:44,845 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 18:31:44,846 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 18:31:45,058 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-09 18:31:45,059 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 18:31:45,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 18:31:45,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1207684161, now seen corresponding path program 1 times [2020-10-09 18:31:45,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 18:31:45,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994673425] [2020-10-09 18:31:45,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-10-09 18:31:45,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 18:31:45,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-09 18:31:45,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 18:31:45,194 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-10-09 18:31:45,194 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:31:45,196 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:31:45,197 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:31:45,197 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2020-10-09 18:31:45,223 INFO L350 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2020-10-09 18:31:45,224 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2020-10-09 18:31:45,225 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:31:45,231 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:31:45,231 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:31:45,232 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2020-10-09 18:31:45,255 INFO L350 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2020-10-09 18:31:45,256 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 14 [2020-10-09 18:31:45,261 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:31:45,267 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:31:45,268 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:31:45,268 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:3 [2020-10-09 18:31:45,299 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 18:31:45,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 18:31:45,324 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:45,338 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 18:31:45,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994673425] [2020-10-09 18:31:45,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 18:31:45,339 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 7 [2020-10-09 18:31:45,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871789742] [2020-10-09 18:31:45,340 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-09 18:31:45,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 18:31:45,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-09 18:31:45,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-09 18:31:46,979 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 148 [2020-10-09 18:31:46,980 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 133 transitions, 327 flow. Second operand 7 states. [2020-10-09 18:31:46,980 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 18:31:46,980 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 148 [2020-10-09 18:31:46,980 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 18:31:47,376 INFO L129 PetriNetUnfolder]: 316/964 cut-off events. [2020-10-09 18:31:47,376 INFO L130 PetriNetUnfolder]: For 151/157 co-relation queries the response was YES. [2020-10-09 18:31:47,379 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1791 conditions, 964 events. 316/964 cut-off events. For 151/157 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5940 event pairs, 56 based on Foata normal form. 18/973 useless extension candidates. Maximal degree in co-relation 535. Up to 324 conditions per place. [2020-10-09 18:31:47,385 INFO L132 encePairwiseOnDemand]: 135/148 looper letters, 64 selfloop transitions, 43 changer transitions 0/197 dead transitions. [2020-10-09 18:31:47,385 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 197 transitions, 707 flow [2020-10-09 18:31:47,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-09 18:31:47,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-09 18:31:47,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1518 transitions. [2020-10-09 18:31:47,391 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7326254826254827 [2020-10-09 18:31:47,391 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1518 transitions. [2020-10-09 18:31:47,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1518 transitions. [2020-10-09 18:31:47,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 18:31:47,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1518 transitions. [2020-10-09 18:31:47,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-09 18:31:47,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-09 18:31:47,399 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-09 18:31:47,400 INFO L185 Difference]: Start difference. First operand has 139 places, 133 transitions, 327 flow. Second operand 14 states and 1518 transitions. [2020-10-09 18:31:47,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 197 transitions, 707 flow [2020-10-09 18:31:47,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 197 transitions, 688 flow, removed 0 selfloop flow, removed 6 redundant places. [2020-10-09 18:31:47,410 INFO L241 Difference]: Finished difference. Result has 150 places, 193 transitions, 640 flow [2020-10-09 18:31:47,411 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=640, PETRI_PLACES=150, PETRI_TRANSITIONS=193} [2020-10-09 18:31:47,411 INFO L341 CegarLoopForPetriNet]: 135 programPoint places, 15 predicate places. [2020-10-09 18:31:47,411 INFO L481 AbstractCegarLoop]: Abstraction has has 150 places, 193 transitions, 640 flow [2020-10-09 18:31:47,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-09 18:31:47,411 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 18:31:47,412 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 18:31:47,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-09 18:31:47,626 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 18:31:47,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 18:31:47,626 INFO L82 PathProgramCache]: Analyzing trace with hash -818897435, now seen corresponding path program 1 times [2020-10-09 18:31:47,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 18:31:47,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1155024390] [2020-10-09 18:31:47,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-10-09 18:31:47,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 18:31:47,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-09 18:31:47,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 18:31:47,751 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-10-09 18:31:47,751 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:31:47,754 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:31:47,755 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:31:47,755 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2020-10-09 18:31:47,767 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2020-10-09 18:31:47,768 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:31:47,771 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:31:47,771 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:31:47,771 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2020-10-09 18:31:47,802 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 18:31:47,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 18:31:47,819 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:47,834 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 18:31:47,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1155024390] [2020-10-09 18:31:47,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 18:31:47,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2020-10-09 18:31:47,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398008360] [2020-10-09 18:31:47,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-09 18:31:47,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 18:31:47,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-09 18:31:47,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-09 18:31:48,857 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 148 [2020-10-09 18:31:48,858 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 193 transitions, 640 flow. Second operand 6 states. [2020-10-09 18:31:48,858 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 18:31:48,858 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 148 [2020-10-09 18:31:48,859 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 18:31:49,253 INFO L129 PetriNetUnfolder]: 462/1298 cut-off events. [2020-10-09 18:31:49,253 INFO L130 PetriNetUnfolder]: For 664/672 co-relation queries the response was YES. [2020-10-09 18:31:49,258 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3249 conditions, 1298 events. 462/1298 cut-off events. For 664/672 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8728 event pairs, 56 based on Foata normal form. 26/1315 useless extension candidates. Maximal degree in co-relation 2948. Up to 502 conditions per place. [2020-10-09 18:31:49,265 INFO L132 encePairwiseOnDemand]: 139/148 looper letters, 71 selfloop transitions, 26 changer transitions 66/254 dead transitions. [2020-10-09 18:31:49,265 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 254 transitions, 1232 flow [2020-10-09 18:31:49,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-09 18:31:49,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-09 18:31:49,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 995 transitions. [2020-10-09 18:31:49,269 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.746996996996997 [2020-10-09 18:31:49,269 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 995 transitions. [2020-10-09 18:31:49,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 995 transitions. [2020-10-09 18:31:49,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 18:31:49,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 995 transitions. [2020-10-09 18:31:49,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-09 18:31:49,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-09 18:31:49,274 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-09 18:31:49,274 INFO L185 Difference]: Start difference. First operand has 150 places, 193 transitions, 640 flow. Second operand 9 states and 995 transitions. [2020-10-09 18:31:49,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 254 transitions, 1232 flow [2020-10-09 18:31:49,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 254 transitions, 1198 flow, removed 17 selfloop flow, removed 0 redundant places. [2020-10-09 18:31:49,291 INFO L241 Difference]: Finished difference. Result has 165 places, 184 transitions, 708 flow [2020-10-09 18:31:49,292 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=708, PETRI_PLACES=165, PETRI_TRANSITIONS=184} [2020-10-09 18:31:49,292 INFO L341 CegarLoopForPetriNet]: 135 programPoint places, 30 predicate places. [2020-10-09 18:31:49,292 INFO L481 AbstractCegarLoop]: Abstraction has has 165 places, 184 transitions, 708 flow [2020-10-09 18:31:49,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-09 18:31:49,292 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 18:31:49,293 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 18:31:49,509 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-09 18:31:49,511 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 18:31:49,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 18:31:49,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1820980684, now seen corresponding path program 1 times [2020-10-09 18:31:49,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 18:31:49,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32855765] [2020-10-09 18:31:49,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-10-09 18:31:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 18:31:49,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-09 18:31:49,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 18:31:49,643 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 18:31:49,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 18:31:49,648 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 18:31:49,649 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [32855765] [2020-10-09 18:31:49,649 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 18:31:49,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2020-10-09 18:31:49,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081672516] [2020-10-09 18:31:49,650 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-09 18:31:49,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 18:31:49,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-09 18:31:49,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-09 18:31:49,716 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 148 [2020-10-09 18:31:49,716 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 184 transitions, 708 flow. Second operand 5 states. [2020-10-09 18:31:49,716 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 18:31:49,716 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 148 [2020-10-09 18:31:49,717 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 18:31:49,774 INFO L129 PetriNetUnfolder]: 6/144 cut-off events. [2020-10-09 18:31:49,775 INFO L130 PetriNetUnfolder]: For 90/98 co-relation queries the response was YES. [2020-10-09 18:31:49,775 INFO L80 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 144 events. 6/144 cut-off events. For 90/98 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 241 event pairs, 4 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 232. Up to 14 conditions per place. [2020-10-09 18:31:49,776 INFO L132 encePairwiseOnDemand]: 143/148 looper letters, 4 selfloop transitions, 4 changer transitions 0/109 dead transitions. [2020-10-09 18:31:49,776 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 109 transitions, 302 flow [2020-10-09 18:31:49,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-09 18:31:49,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-09 18:31:49,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 801 transitions. [2020-10-09 18:31:49,779 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.902027027027027 [2020-10-09 18:31:49,779 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 801 transitions. [2020-10-09 18:31:49,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 801 transitions. [2020-10-09 18:31:49,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 18:31:49,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 801 transitions. [2020-10-09 18:31:49,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-09 18:31:49,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-09 18:31:49,783 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-09 18:31:49,783 INFO L185 Difference]: Start difference. First operand has 165 places, 184 transitions, 708 flow. Second operand 6 states and 801 transitions. [2020-10-09 18:31:49,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 109 transitions, 302 flow [2020-10-09 18:31:49,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 109 transitions, 260 flow, removed 16 selfloop flow, removed 8 redundant places. [2020-10-09 18:31:49,787 INFO L241 Difference]: Finished difference. Result has 124 places, 109 transitions, 252 flow [2020-10-09 18:31:49,787 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=252, PETRI_PLACES=124, PETRI_TRANSITIONS=109} [2020-10-09 18:31:49,787 INFO L341 CegarLoopForPetriNet]: 135 programPoint places, -11 predicate places. [2020-10-09 18:31:49,787 INFO L481 AbstractCegarLoop]: Abstraction has has 124 places, 109 transitions, 252 flow [2020-10-09 18:31:49,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-09 18:31:49,788 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 18:31:49,788 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 18:31:49,993 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-10-09 18:31:49,994 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 18:31:49,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 18:31:49,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1318796402, now seen corresponding path program 1 times [2020-10-09 18:31:49,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 18:31:49,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [747458692] [2020-10-09 18:31:49,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-10-09 18:31:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 18:31:50,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 39 conjunts are in the unsatisfiable core [2020-10-09 18:31:50,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 18:31:50,161 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-09 18:31:50,162 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:31:50,164 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:31:50,164 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:31:50,164 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-09 18:31:50,216 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:31:50,217 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-10-09 18:31:50,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 18:31:50,220 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:31:50,227 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:31:50,227 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:31:50,227 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2020-10-09 18:31:50,323 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-10-09 18:31:50,323 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:31:50,331 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:31:50,332 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:31:50,332 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2020-10-09 18:31:50,387 INFO L350 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2020-10-09 18:31:50,387 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2020-10-09 18:31:50,388 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:31:50,396 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:31:50,398 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:31:50,398 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:14 [2020-10-09 18:31:50,427 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-10-09 18:31:50,427 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:31:50,433 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:31:50,434 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:31:50,434 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:14 [2020-10-09 18:31:50,449 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-10-09 18:31:50,450 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:31:50,455 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:31:50,461 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:31:50,462 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2020-10-09 18:31:50,486 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2020-10-09 18:31:50,487 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:31:50,492 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:31:50,493 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:31:50,493 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2020-10-09 18:31:50,559 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 18:31:50,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 18:31:50,597 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:50,610 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 18:31:50,614 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:31:50,615 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 18:31:50,615 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:17 [2020-10-09 18:31:50,713 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:31:50,717 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:31:50,718 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 18:31:50,719 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:17 [2020-10-09 18:31:59,708 WARN L838 $PredicateComparison]: unable to prove that (forall ((|my_callbackThread1of1ForFork0_#t~mem30| Int) (v_DerPreprocessor_1 Int) (|ULTIMATE.start_my_drv_disconnect_~#status~0.offset| Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| c_my_callbackThread1of1ForFork0_~data~0.base (store (select |c_#memory_int| c_my_callbackThread1of1ForFork0_~data~0.base) (+ c_my_callbackThread1of1ForFork0_~data~0.offset 28) (+ |my_callbackThread1of1ForFork0_#t~mem30| 1))))) (store .cse0 |c_ULTIMATE.start_my_drv_disconnect_~#status~0.base| (store (select .cse0 |c_ULTIMATE.start_my_drv_disconnect_~#status~0.base|) |ULTIMATE.start_my_drv_disconnect_~#status~0.offset| v_DerPreprocessor_1))) |c_ULTIMATE.start_main_~#data~1.base|) (+ |c_ULTIMATE.start_main_~#data~1.offset| 24)) 1)) is different from false [2020-10-09 18:31:59,727 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 882 treesize of output 858 [2020-10-09 18:31:59,729 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,731 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,732 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-09 18:31:59,734 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:31:59,735 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:31:59,736 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,738 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-09 18:31:59,739 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,740 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,745 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,746 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,747 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,755 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:31:59,756 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,757 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,761 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,762 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,763 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,774 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-09 18:31:59,775 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:31:59,777 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,778 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-09 18:31:59,778 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,780 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,782 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,784 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,785 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,788 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-09 18:31:59,789 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,790 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,793 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,794 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,800 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-09 18:31:59,801 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-09 18:31:59,802 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,803 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,804 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,805 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,837 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-09 18:31:59,838 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-09 18:31:59,839 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,840 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,846 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,847 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,850 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,853 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,855 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,856 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,863 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-09 18:31:59,864 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-09 18:31:59,864 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-09 18:31:59,865 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-09 18:31:59,866 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,867 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,869 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,870 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,873 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-09 18:31:59,874 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-09 18:31:59,874 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,875 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,877 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,878 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,881 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-09 18:31:59,882 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-09 18:31:59,883 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,884 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,887 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,888 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,891 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,892 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,894 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,895 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,900 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,901 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,906 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,907 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,914 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,914 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,916 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,917 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,926 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:31:59,927 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,928 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,930 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,931 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,932 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,937 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:31:59,938 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,938 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,940 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,941 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,942 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:31:59,955 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-10-09 18:32:00,556 WARN L193 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 37 [2020-10-09 18:32:00,557 INFO L625 ElimStorePlain]: treesize reduction 8483, result has 2.0 percent of original size [2020-10-09 18:32:00,564 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:32:00,565 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:32:00,573 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2020-10-09 18:32:00,574 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:65 [2020-10-09 18:32:00,612 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:32:01,633 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 18:32:01,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [747458692] [2020-10-09 18:32:01,634 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 18:32:01,634 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16, 16] imperfect sequences [] total 23 [2020-10-09 18:32:01,634 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800834568] [2020-10-09 18:32:01,635 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-10-09 18:32:01,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 18:32:01,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-10-09 18:32:01,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=391, Unknown=7, NotChecked=40, Total=506 [2020-10-09 18:32:03,108 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 148 [2020-10-09 18:32:03,109 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 109 transitions, 252 flow. Second operand 23 states. [2020-10-09 18:32:03,110 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 18:32:03,110 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 148 [2020-10-09 18:32:03,110 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 18:32:06,663 WARN L193 SmtUtils]: Spent 2.90 s on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2020-10-09 18:32:08,118 INFO L129 PetriNetUnfolder]: 652/1715 cut-off events. [2020-10-09 18:32:08,118 INFO L130 PetriNetUnfolder]: For 271/271 co-relation queries the response was YES. [2020-10-09 18:32:08,126 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3404 conditions, 1715 events. 652/1715 cut-off events. For 271/271 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 10938 event pairs, 181 based on Foata normal form. 0/1686 useless extension candidates. Maximal degree in co-relation 3391. Up to 342 conditions per place. [2020-10-09 18:32:08,138 INFO L132 encePairwiseOnDemand]: 123/148 looper letters, 142 selfloop transitions, 38 changer transitions 0/226 dead transitions. [2020-10-09 18:32:08,138 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 226 transitions, 912 flow [2020-10-09 18:32:08,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-09 18:32:08,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-10-09 18:32:08,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1481 transitions. [2020-10-09 18:32:08,152 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.4765122265122265 [2020-10-09 18:32:08,152 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1481 transitions. [2020-10-09 18:32:08,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1481 transitions. [2020-10-09 18:32:08,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 18:32:08,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1481 transitions. [2020-10-09 18:32:08,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 22 states. [2020-10-09 18:32:08,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 22 states. [2020-10-09 18:32:08,168 INFO L81 ComplementDD]: Finished complementDD. Result 22 states. [2020-10-09 18:32:08,168 INFO L185 Difference]: Start difference. First operand has 124 places, 109 transitions, 252 flow. Second operand 21 states and 1481 transitions. [2020-10-09 18:32:08,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 226 transitions, 912 flow [2020-10-09 18:32:08,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 226 transitions, 905 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-09 18:32:08,178 INFO L241 Difference]: Finished difference. Result has 153 places, 141 transitions, 505 flow [2020-10-09 18:32:08,179 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=505, PETRI_PLACES=153, PETRI_TRANSITIONS=141} [2020-10-09 18:32:08,179 INFO L341 CegarLoopForPetriNet]: 135 programPoint places, 18 predicate places. [2020-10-09 18:32:08,179 INFO L481 AbstractCegarLoop]: Abstraction has has 153 places, 141 transitions, 505 flow [2020-10-09 18:32:08,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-10-09 18:32:08,179 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 18:32:08,180 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 18:32:08,393 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-10-09 18:32:08,394 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 18:32:08,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 18:32:08,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1500842856, now seen corresponding path program 2 times [2020-10-09 18:32:08,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 18:32:08,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [970828605] [2020-10-09 18:32:08,397 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-10-09 18:32:08,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-10-09 18:32:08,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 18:32:08,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 39 conjunts are in the unsatisfiable core [2020-10-09 18:32:08,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 18:32:08,609 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-09 18:32:08,609 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:32:08,611 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:32:08,612 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:32:08,612 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-09 18:32:08,774 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-10-09 18:32:08,774 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:32:08,783 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:32:08,784 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:32:08,784 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2020-10-09 18:32:08,822 INFO L350 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2020-10-09 18:32:08,822 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2020-10-09 18:32:08,823 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:32:08,836 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:32:08,837 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:32:08,837 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:15 [2020-10-09 18:32:08,866 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:32:08,867 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-10-09 18:32:08,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 18:32:08,870 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:32:08,874 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:32:08,875 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:32:08,875 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2020-10-09 18:32:08,897 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-10-09 18:32:08,898 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:32:08,903 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:32:08,903 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:32:08,904 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:14 [2020-10-09 18:32:08,919 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-10-09 18:32:08,919 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:32:08,925 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:32:08,927 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:32:08,927 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2020-10-09 18:32:08,950 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2020-10-09 18:32:08,951 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:32:08,954 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:32:08,954 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:32:08,954 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2020-10-09 18:32:09,036 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 18:32:09,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 18:32:09,066 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:32:09,071 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 18:32:09,074 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:32:09,075 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 18:32:09,075 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:17 [2020-10-09 18:32:09,143 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:32:09,146 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:32:09,146 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 18:32:09,147 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:17 [2020-10-09 18:32:21,148 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 424 treesize of output 412 [2020-10-09 18:32:21,149 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:32:21,149 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:32:21,153 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:32:21,154 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:32:21,156 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:32:21,157 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:32:21,162 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:32:21,538 WARN L193 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 36 [2020-10-09 18:32:21,539 INFO L625 ElimStorePlain]: treesize reduction 539, result has 13.1 percent of original size [2020-10-09 18:32:21,546 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:32:21,547 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:32:21,547 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 18:32:21,548 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:57, output treesize:28 [2020-10-09 18:32:21,548 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:32:23,595 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:32:25,642 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:32:26,264 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 18:32:26,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [970828605] [2020-10-09 18:32:26,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 18:32:26,266 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16, 16] imperfect sequences [] total 26 [2020-10-09 18:32:26,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019176560] [2020-10-09 18:32:26,267 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-10-09 18:32:26,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 18:32:26,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-10-09 18:32:26,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=545, Unknown=10, NotChecked=0, Total=650 [2020-10-09 18:36:54,398 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 148 [2020-10-09 18:36:54,399 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 141 transitions, 505 flow. Second operand 26 states. [2020-10-09 18:36:54,399 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 18:36:54,400 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 148 [2020-10-09 18:36:54,400 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 18:36:56,752 INFO L129 PetriNetUnfolder]: 791/2171 cut-off events. [2020-10-09 18:36:56,752 INFO L130 PetriNetUnfolder]: For 2022/2094 co-relation queries the response was YES. [2020-10-09 18:36:56,760 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6013 conditions, 2171 events. 791/2171 cut-off events. For 2022/2094 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 15853 event pairs, 43 based on Foata normal form. 1/2149 useless extension candidates. Maximal degree in co-relation 5987. Up to 848 conditions per place. [2020-10-09 18:36:56,772 INFO L132 encePairwiseOnDemand]: 127/148 looper letters, 171 selfloop transitions, 48 changer transitions 0/265 dead transitions. [2020-10-09 18:36:56,772 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 265 transitions, 1550 flow [2020-10-09 18:36:56,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-09 18:36:56,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-09 18:36:56,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1393 transitions. [2020-10-09 18:36:56,778 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.4706081081081081 [2020-10-09 18:36:56,778 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1393 transitions. [2020-10-09 18:36:56,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1393 transitions. [2020-10-09 18:36:56,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 18:36:56,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1393 transitions. [2020-10-09 18:36:56,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 21 states. [2020-10-09 18:36:56,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 21 states. [2020-10-09 18:36:56,788 INFO L81 ComplementDD]: Finished complementDD. Result 21 states. [2020-10-09 18:36:56,788 INFO L185 Difference]: Start difference. First operand has 153 places, 141 transitions, 505 flow. Second operand 20 states and 1393 transitions. [2020-10-09 18:36:56,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 265 transitions, 1550 flow [2020-10-09 18:36:56,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 265 transitions, 1511 flow, removed 16 selfloop flow, removed 4 redundant places. [2020-10-09 18:36:56,806 INFO L241 Difference]: Finished difference. Result has 177 places, 172 transitions, 810 flow [2020-10-09 18:36:56,806 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=810, PETRI_PLACES=177, PETRI_TRANSITIONS=172} [2020-10-09 18:36:56,806 INFO L341 CegarLoopForPetriNet]: 135 programPoint places, 42 predicate places. [2020-10-09 18:36:56,807 INFO L481 AbstractCegarLoop]: Abstraction has has 177 places, 172 transitions, 810 flow [2020-10-09 18:36:56,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-10-09 18:36:56,807 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 18:36:56,807 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 18:36:57,019 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-10-09 18:36:57,021 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 18:36:57,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 18:36:57,022 INFO L82 PathProgramCache]: Analyzing trace with hash 733355178, now seen corresponding path program 3 times [2020-10-09 18:36:57,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 18:36:57,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1429752426] [2020-10-09 18:36:57,023 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-10-09 18:36:57,168 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2020-10-09 18:36:57,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 18:36:57,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 39 conjunts are in the unsatisfiable core [2020-10-09 18:36:57,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 18:36:57,189 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-09 18:36:57,189 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:36:57,191 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:36:57,191 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:36:57,192 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-09 18:36:57,277 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:36:57,277 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-10-09 18:36:57,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 18:36:57,280 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:36:57,287 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:36:57,288 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:36:57,288 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2020-10-09 18:36:57,328 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-10-09 18:36:57,329 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:36:57,343 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:36:57,343 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:36:57,344 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2020-10-09 18:36:57,383 INFO L350 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2020-10-09 18:36:57,384 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2020-10-09 18:36:57,385 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:36:57,391 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:36:57,394 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:36:57,395 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:14 [2020-10-09 18:36:57,420 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-10-09 18:36:57,420 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:36:57,426 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:36:57,426 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:36:57,427 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:14 [2020-10-09 18:36:57,440 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-10-09 18:36:57,440 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:36:57,446 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:36:57,447 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:36:57,447 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2020-10-09 18:36:57,465 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2020-10-09 18:36:57,465 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:36:57,467 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:36:57,467 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:36:57,467 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2020-10-09 18:36:57,541 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 18:36:57,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 18:36:57,574 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:36:57,578 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 18:36:57,582 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:36:57,582 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 18:36:57,583 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:17 [2020-10-09 18:36:57,659 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:36:57,662 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:36:57,662 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 18:36:57,663 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:17 [2020-10-09 18:36:59,402 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_5 Int) (|ULTIMATE.start_my_drv_disconnect_~#status~0.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_my_drv_disconnect_~#status~0.base| (store (select |c_#memory_int| |c_ULTIMATE.start_my_drv_disconnect_~#status~0.base|) |ULTIMATE.start_my_drv_disconnect_~#status~0.offset| v_DerPreprocessor_5)) |c_ULTIMATE.start_main_~#data~1.base|) (+ |c_ULTIMATE.start_main_~#data~1.offset| 24)) 1)) is different from false [2020-10-09 18:37:01,249 WARN L838 $PredicateComparison]: unable to prove that (forall ((|my_callbackThread1of1ForFork1_#t~mem30| Int) (v_DerPreprocessor_5 Int) (|ULTIMATE.start_my_drv_disconnect_~#status~0.offset| Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| c_my_callbackThread1of1ForFork1_~data~0.base (store (select |c_#memory_int| c_my_callbackThread1of1ForFork1_~data~0.base) (+ c_my_callbackThread1of1ForFork1_~data~0.offset 28) (+ |my_callbackThread1of1ForFork1_#t~mem30| 1))))) (store .cse0 |c_ULTIMATE.start_my_drv_disconnect_~#status~0.base| (store (select .cse0 |c_ULTIMATE.start_my_drv_disconnect_~#status~0.base|) |ULTIMATE.start_my_drv_disconnect_~#status~0.offset| v_DerPreprocessor_5))) |c_ULTIMATE.start_main_~#data~1.base|) (+ |c_ULTIMATE.start_main_~#data~1.offset| 24)) 1)) is different from false [2020-10-09 18:37:01,262 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 428 treesize of output 416 [2020-10-09 18:37:01,262 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:01,263 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:01,263 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:01,264 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:01,265 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:01,265 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:01,266 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:01,267 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:01,272 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-10-09 18:37:01,558 WARN L193 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 31 [2020-10-09 18:37:01,559 INFO L625 ElimStorePlain]: treesize reduction 1060, result has 5.7 percent of original size [2020-10-09 18:37:01,561 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-10-09 18:37:01,562 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:15 [2020-10-09 18:37:01,577 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:02,121 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 18:37:02,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1429752426] [2020-10-09 18:37:02,122 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 18:37:02,122 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16, 16] imperfect sequences [] total 24 [2020-10-09 18:37:02,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160316161] [2020-10-09 18:37:02,124 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-10-09 18:37:02,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 18:37:02,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-10-09 18:37:02,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=395, Unknown=2, NotChecked=82, Total=552 [2020-10-09 18:37:02,672 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 148 [2020-10-09 18:37:02,674 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 172 transitions, 810 flow. Second operand 24 states. [2020-10-09 18:37:02,674 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 18:37:02,674 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 148 [2020-10-09 18:37:02,675 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 18:37:07,690 WARN L193 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2020-10-09 18:37:09,079 INFO L129 PetriNetUnfolder]: 961/2821 cut-off events. [2020-10-09 18:37:09,080 INFO L130 PetriNetUnfolder]: For 4706/4911 co-relation queries the response was YES. [2020-10-09 18:37:09,093 INFO L80 FinitePrefix]: Finished finitePrefix Result has 8767 conditions, 2821 events. 961/2821 cut-off events. For 4706/4911 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 22555 event pairs, 121 based on Foata normal form. 21/2796 useless extension candidates. Maximal degree in co-relation 8732. Up to 1109 conditions per place. [2020-10-09 18:37:09,110 INFO L132 encePairwiseOnDemand]: 127/148 looper letters, 207 selfloop transitions, 60 changer transitions 0/313 dead transitions. [2020-10-09 18:37:09,110 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 313 transitions, 2189 flow [2020-10-09 18:37:09,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-09 18:37:09,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-09 18:37:09,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1538 transitions. [2020-10-09 18:37:09,118 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.47235872235872234 [2020-10-09 18:37:09,119 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1538 transitions. [2020-10-09 18:37:09,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1538 transitions. [2020-10-09 18:37:09,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 18:37:09,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1538 transitions. [2020-10-09 18:37:09,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 23 states. [2020-10-09 18:37:09,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 23 states. [2020-10-09 18:37:09,130 INFO L81 ComplementDD]: Finished complementDD. Result 23 states. [2020-10-09 18:37:09,130 INFO L185 Difference]: Start difference. First operand has 177 places, 172 transitions, 810 flow. Second operand 22 states and 1538 transitions. [2020-10-09 18:37:09,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 313 transitions, 2189 flow [2020-10-09 18:37:09,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 313 transitions, 2147 flow, removed 9 selfloop flow, removed 5 redundant places. [2020-10-09 18:37:09,160 INFO L241 Difference]: Finished difference. Result has 207 places, 201 transitions, 1244 flow [2020-10-09 18:37:09,160 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=777, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1244, PETRI_PLACES=207, PETRI_TRANSITIONS=201} [2020-10-09 18:37:09,160 INFO L341 CegarLoopForPetriNet]: 135 programPoint places, 72 predicate places. [2020-10-09 18:37:09,161 INFO L481 AbstractCegarLoop]: Abstraction has has 207 places, 201 transitions, 1244 flow [2020-10-09 18:37:09,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-10-09 18:37:09,161 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 18:37:09,161 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 18:37:09,382 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-10-09 18:37:09,383 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 18:37:09,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 18:37:09,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1373338492, now seen corresponding path program 4 times [2020-10-09 18:37:09,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 18:37:09,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [362532141] [2020-10-09 18:37:09,385 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-10-09 18:37:09,542 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-09 18:37:09,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 18:37:09,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 38 conjunts are in the unsatisfiable core [2020-10-09 18:37:09,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 18:37:09,554 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-09 18:37:09,554 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:37:09,559 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:37:09,559 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:37:09,560 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-09 18:37:09,693 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:37:09,694 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-10-09 18:37:09,694 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 18:37:09,696 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:37:09,701 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:37:09,702 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:37:09,702 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2020-10-09 18:37:09,722 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-10-09 18:37:09,722 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:37:09,732 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:37:09,733 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:37:09,733 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2020-10-09 18:37:09,770 INFO L350 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2020-10-09 18:37:09,771 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2020-10-09 18:37:09,771 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:37:09,779 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:37:09,780 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:37:09,781 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:14 [2020-10-09 18:37:09,806 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-10-09 18:37:09,806 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:37:09,815 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:37:09,816 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:37:09,816 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2020-10-09 18:37:09,835 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2020-10-09 18:37:09,835 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:37:09,837 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:37:09,837 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:37:09,837 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2020-10-09 18:37:09,904 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 18:37:09,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 18:37:09,935 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:09,940 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 18:37:09,943 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:37:09,943 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 18:37:09,944 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:17 [2020-10-09 18:37:11,749 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_7 Int) (|ULTIMATE.start_my_drv_disconnect_~#status~0.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_my_drv_disconnect_~#status~0.base| (store (select |c_#memory_int| |c_ULTIMATE.start_my_drv_disconnect_~#status~0.base|) |ULTIMATE.start_my_drv_disconnect_~#status~0.offset| v_DerPreprocessor_7)) |c_ULTIMATE.start_main_~#data~1.base|) (+ |c_ULTIMATE.start_main_~#data~1.offset| 24)) 1)) is different from false [2020-10-09 18:37:13,680 WARN L838 $PredicateComparison]: unable to prove that (forall ((|my_callbackThread1of1ForFork1_#t~mem30| Int) (v_DerPreprocessor_7 Int) (|ULTIMATE.start_my_drv_disconnect_~#status~0.offset| Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| c_my_callbackThread1of1ForFork1_~data~0.base (store (select |c_#memory_int| c_my_callbackThread1of1ForFork1_~data~0.base) (+ c_my_callbackThread1of1ForFork1_~data~0.offset 28) (+ |my_callbackThread1of1ForFork1_#t~mem30| 1))))) (store .cse0 |c_ULTIMATE.start_my_drv_disconnect_~#status~0.base| (store (select .cse0 |c_ULTIMATE.start_my_drv_disconnect_~#status~0.base|) |ULTIMATE.start_my_drv_disconnect_~#status~0.offset| v_DerPreprocessor_7))) |c_ULTIMATE.start_main_~#data~1.base|) (+ |c_ULTIMATE.start_main_~#data~1.offset| 24)) 1)) is different from false [2020-10-09 18:37:13,689 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 189 [2020-10-09 18:37:13,691 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:37:13,877 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 31 [2020-10-09 18:37:13,879 INFO L625 ElimStorePlain]: treesize reduction 110, result has 36.0 percent of original size [2020-10-09 18:37:13,884 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-10-09 18:37:13,884 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:15 [2020-10-09 18:37:13,891 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:14,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 18:37:14,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [362532141] [2020-10-09 18:37:14,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 18:37:14,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16, 15] imperfect sequences [] total 24 [2020-10-09 18:37:14,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320414152] [2020-10-09 18:37:14,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-10-09 18:37:14,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 18:37:14,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-10-09 18:37:14,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=394, Unknown=2, NotChecked=82, Total=552 [2020-10-09 18:37:15,198 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 148 [2020-10-09 18:37:15,200 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 201 transitions, 1244 flow. Second operand 24 states. [2020-10-09 18:37:15,200 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 18:37:15,200 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 148 [2020-10-09 18:37:15,200 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 18:37:17,679 INFO L129 PetriNetUnfolder]: 962/2875 cut-off events. [2020-10-09 18:37:17,679 INFO L130 PetriNetUnfolder]: For 7666/7877 co-relation queries the response was YES. [2020-10-09 18:37:17,694 INFO L80 FinitePrefix]: Finished finitePrefix Result has 9952 conditions, 2875 events. 962/2875 cut-off events. For 7666/7877 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 23000 event pairs, 69 based on Foata normal form. 41/2884 useless extension candidates. Maximal degree in co-relation 9903. Up to 1123 conditions per place. [2020-10-09 18:37:17,707 INFO L132 encePairwiseOnDemand]: 127/148 looper letters, 221 selfloop transitions, 79 changer transitions 0/346 dead transitions. [2020-10-09 18:37:17,708 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 346 transitions, 2770 flow [2020-10-09 18:37:17,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-09 18:37:17,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-09 18:37:17,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1545 transitions. [2020-10-09 18:37:17,711 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.4745085995085995 [2020-10-09 18:37:17,711 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1545 transitions. [2020-10-09 18:37:17,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1545 transitions. [2020-10-09 18:37:17,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 18:37:17,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1545 transitions. [2020-10-09 18:37:17,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 23 states. [2020-10-09 18:37:17,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 23 states. [2020-10-09 18:37:17,719 INFO L81 ComplementDD]: Finished complementDD. Result 23 states. [2020-10-09 18:37:17,720 INFO L185 Difference]: Start difference. First operand has 207 places, 201 transitions, 1244 flow. Second operand 22 states and 1545 transitions. [2020-10-09 18:37:17,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 346 transitions, 2770 flow [2020-10-09 18:37:17,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 346 transitions, 2709 flow, removed 20 selfloop flow, removed 6 redundant places. [2020-10-09 18:37:17,776 INFO L241 Difference]: Finished difference. Result has 232 places, 222 transitions, 1666 flow [2020-10-09 18:37:17,777 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=1185, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1666, PETRI_PLACES=232, PETRI_TRANSITIONS=222} [2020-10-09 18:37:17,777 INFO L341 CegarLoopForPetriNet]: 135 programPoint places, 97 predicate places. [2020-10-09 18:37:17,777 INFO L481 AbstractCegarLoop]: Abstraction has has 232 places, 222 transitions, 1666 flow [2020-10-09 18:37:17,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-10-09 18:37:17,777 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 18:37:17,777 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 18:37:17,990 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-10-09 18:37:17,990 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 18:37:17,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 18:37:17,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1077117854, now seen corresponding path program 5 times [2020-10-09 18:37:17,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 18:37:17,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175575086] [2020-10-09 18:37:17,993 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2020-10-09 18:37:18,132 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-10-09 18:37:18,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 18:37:18,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 38 conjunts are in the unsatisfiable core [2020-10-09 18:37:18,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 18:37:18,145 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-09 18:37:18,145 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:37:18,148 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:37:18,148 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:37:18,149 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-09 18:37:18,227 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:37:18,228 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-10-09 18:37:18,229 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 18:37:18,231 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:37:18,236 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:37:18,236 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:37:18,237 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2020-10-09 18:37:18,317 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-10-09 18:37:18,318 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:37:18,327 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:37:18,328 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:37:18,328 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2020-10-09 18:37:18,368 INFO L350 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2020-10-09 18:37:18,368 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2020-10-09 18:37:18,369 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:37:18,377 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:37:18,378 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:37:18,378 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:14 [2020-10-09 18:37:18,407 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-10-09 18:37:18,408 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:37:18,412 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:37:18,413 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:37:18,413 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2020-10-09 18:37:18,429 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2020-10-09 18:37:18,430 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:37:18,432 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:37:18,432 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:37:18,432 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2020-10-09 18:37:18,502 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 18:37:18,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 18:37:18,538 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:18,555 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 18:37:18,558 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:37:18,559 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 18:37:18,559 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:17 [2020-10-09 18:37:20,507 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_8 Int) (|ULTIMATE.start_my_drv_disconnect_~#status~0.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_my_drv_disconnect_~#status~0.base| (store (select |c_#memory_int| |c_ULTIMATE.start_my_drv_disconnect_~#status~0.base|) |ULTIMATE.start_my_drv_disconnect_~#status~0.offset| v_DerPreprocessor_8)) |c_ULTIMATE.start_main_~#data~1.base|) (+ |c_ULTIMATE.start_main_~#data~1.offset| 24)) 1)) is different from false [2020-10-09 18:37:22,513 WARN L838 $PredicateComparison]: unable to prove that (forall ((|my_callbackThread1of1ForFork1_#t~mem30| Int) (v_DerPreprocessor_8 Int) (|ULTIMATE.start_my_drv_disconnect_~#status~0.offset| Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| c_my_callbackThread1of1ForFork1_~data~0.base (store (select |c_#memory_int| c_my_callbackThread1of1ForFork1_~data~0.base) (+ c_my_callbackThread1of1ForFork1_~data~0.offset 28) (+ |my_callbackThread1of1ForFork1_#t~mem30| 1))))) (store .cse0 |c_ULTIMATE.start_my_drv_disconnect_~#status~0.base| (store (select .cse0 |c_ULTIMATE.start_my_drv_disconnect_~#status~0.base|) |ULTIMATE.start_my_drv_disconnect_~#status~0.offset| v_DerPreprocessor_8))) |c_ULTIMATE.start_main_~#data~1.base|) (+ |c_ULTIMATE.start_main_~#data~1.offset| 24)) 1)) is different from false [2020-10-09 18:37:22,523 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 189 [2020-10-09 18:37:22,525 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:37:22,703 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 31 [2020-10-09 18:37:22,704 INFO L625 ElimStorePlain]: treesize reduction 110, result has 36.0 percent of original size [2020-10-09 18:37:22,712 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-10-09 18:37:22,712 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:15 [2020-10-09 18:37:22,726 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:24,208 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 18:37:24,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175575086] [2020-10-09 18:37:24,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 18:37:24,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16, 15] imperfect sequences [] total 22 [2020-10-09 18:37:24,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985334007] [2020-10-09 18:37:24,210 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-10-09 18:37:24,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 18:37:24,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-10-09 18:37:24,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=324, Unknown=2, NotChecked=74, Total=462 [2020-10-09 18:37:25,666 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 148 [2020-10-09 18:37:25,668 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 222 transitions, 1666 flow. Second operand 22 states. [2020-10-09 18:37:25,668 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 18:37:25,668 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 148 [2020-10-09 18:37:25,668 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 18:37:27,806 INFO L129 PetriNetUnfolder]: 965/2949 cut-off events. [2020-10-09 18:37:27,806 INFO L130 PetriNetUnfolder]: For 10701/10978 co-relation queries the response was YES. [2020-10-09 18:37:27,823 INFO L80 FinitePrefix]: Finished finitePrefix Result has 10979 conditions, 2949 events. 965/2949 cut-off events. For 10701/10978 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 23782 event pairs, 226 based on Foata normal form. 40/2933 useless extension candidates. Maximal degree in co-relation 10920. Up to 1137 conditions per place. [2020-10-09 18:37:27,836 INFO L132 encePairwiseOnDemand]: 130/148 looper letters, 193 selfloop transitions, 64 changer transitions 0/303 dead transitions. [2020-10-09 18:37:27,837 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 303 transitions, 2766 flow [2020-10-09 18:37:27,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-09 18:37:27,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-10-09 18:37:27,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1451 transitions. [2020-10-09 18:37:27,840 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.46685971685971683 [2020-10-09 18:37:27,840 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1451 transitions. [2020-10-09 18:37:27,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1451 transitions. [2020-10-09 18:37:27,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 18:37:27,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1451 transitions. [2020-10-09 18:37:27,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 22 states. [2020-10-09 18:37:27,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 22 states. [2020-10-09 18:37:27,846 INFO L81 ComplementDD]: Finished complementDD. Result 22 states. [2020-10-09 18:37:27,846 INFO L185 Difference]: Start difference. First operand has 232 places, 222 transitions, 1666 flow. Second operand 21 states and 1451 transitions. [2020-10-09 18:37:27,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 303 transitions, 2766 flow [2020-10-09 18:37:27,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 303 transitions, 2660 flow, removed 31 selfloop flow, removed 8 redundant places. [2020-10-09 18:37:27,905 INFO L241 Difference]: Finished difference. Result has 255 places, 238 transitions, 1934 flow [2020-10-09 18:37:27,906 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=1573, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1934, PETRI_PLACES=255, PETRI_TRANSITIONS=238} [2020-10-09 18:37:27,906 INFO L341 CegarLoopForPetriNet]: 135 programPoint places, 120 predicate places. [2020-10-09 18:37:27,906 INFO L481 AbstractCegarLoop]: Abstraction has has 255 places, 238 transitions, 1934 flow [2020-10-09 18:37:27,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-10-09 18:37:27,907 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 18:37:27,907 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 18:37:28,128 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-10-09 18:37:28,128 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 18:37:28,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 18:37:28,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1496880162, now seen corresponding path program 6 times [2020-10-09 18:37:28,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 18:37:28,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [688835549] [2020-10-09 18:37:28,130 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2020-10-09 18:37:28,273 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2020-10-09 18:37:28,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 18:37:28,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 40 conjunts are in the unsatisfiable core [2020-10-09 18:37:28,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 18:37:28,282 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-10-09 18:37:28,283 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:37:28,288 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:37:28,289 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:37:28,289 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-09 18:37:28,441 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-10-09 18:37:28,441 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:37:28,456 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:37:28,456 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:37:28,456 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2020-10-09 18:37:28,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-09 18:37:28,493 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2020-10-09 18:37:28,494 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:37:28,506 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:37:28,507 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:37:28,508 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:21 [2020-10-09 18:37:28,551 INFO L350 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2020-10-09 18:37:28,552 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2020-10-09 18:37:28,553 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:37:28,560 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:37:28,561 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:37:28,561 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:15 [2020-10-09 18:37:28,594 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:37:28,594 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-10-09 18:37:28,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 18:37:28,601 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:37:28,606 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:37:28,606 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:37:28,606 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2020-10-09 18:37:28,628 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-10-09 18:37:28,629 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:37:28,634 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:37:28,635 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:37:28,635 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:14 [2020-10-09 18:37:28,641 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2020-10-09 18:37:28,641 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:37:28,647 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:37:28,648 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:37:28,648 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2020-10-09 18:37:28,667 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2020-10-09 18:37:28,667 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:37:28,669 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:37:28,670 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-09 18:37:28,670 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2020-10-09 18:37:28,739 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 18:37:28,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 18:37:28,772 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:28,776 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 18:37:28,779 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:37:28,779 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-09 18:37:28,779 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:17 [2020-10-09 18:37:28,841 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-09 18:37:28,845 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-09 18:37:28,845 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-09 18:37:28,845 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:17 [2020-10-09 18:37:46,603 WARN L193 SmtUtils]: Spent 1.97 s on a formula simplification that was a NOOP. DAG size: 16 [2020-10-09 18:37:46,953 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 864 treesize of output 852 [2020-10-09 18:37:46,954 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:46,955 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:46,956 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:46,958 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:46,959 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:46,960 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:46,964 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-10-09 18:37:47,619 WARN L193 SmtUtils]: Spent 653.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 58 [2020-10-09 18:37:47,620 INFO L625 ElimStorePlain]: treesize reduction 1945, result has 8.3 percent of original size [2020-10-09 18:37:47,622 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:47,623 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-09 18:37:47,623 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-09 18:37:47,627 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:47,628 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:47,629 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-10-09 18:37:47,629 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:115, output treesize:176 [2020-10-09 18:37:47,630 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:47,631 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-09 18:37:47,631 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:47,632 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:47,633 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:47,633 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:47,633 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-09 18:37:47,634 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:47,635 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:47,635 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:47,635 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:47,636 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:47,636 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:47,637 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:47,638 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:47,638 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:47,638 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:47,639 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:47,640 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-09 18:37:47,640 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:47,641 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:47,641 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:47,642 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:47,642 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:47,643 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:47,644 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:47,645 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:47,646 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-09 18:37:47,646 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:47,647 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:47,647 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:47,648 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:47,648 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-09 18:37:47,649 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:47,650 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:47,650 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:47,651 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:47,652 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:47,653 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:47,653 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:47,654 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:47,655 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:47,655 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:47,656 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:47,657 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-09 18:37:47,657 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:47,659 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:47,659 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:47,660 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:47,660 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:47,662 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:47,662 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-09 18:37:47,663 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:47,663 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:47,664 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:47,665 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:47,665 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-09 18:37:47,666 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:47,666 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:47,667 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:47,668 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:47,668 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:47,669 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:47,672 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:47,673 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:47,674 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:47,674 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:47,676 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:47,676 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-09 18:37:47,677 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:47,678 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:47,678 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:47,679 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:47,679 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:47,682 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:49,756 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:49,756 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-09 18:37:49,757 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-09 18:37:49,758 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 18:37:49,758 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 18:37:50,085 WARN L193 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 31 [2020-10-09 18:37:50,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 18:37:50,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [688835549] [2020-10-09 18:37:50,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 18:37:50,849 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18, 19] imperfect sequences [] total 31 [2020-10-09 18:37:50,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312259587] [2020-10-09 18:37:50,850 INFO L461 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-10-09 18:37:50,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 18:37:50,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-10-09 18:37:50,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=795, Unknown=9, NotChecked=0, Total=930 Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown